Hello World!

; let b = 0; let d = 0; /* * Should pun the first example: */ let a = 5 ; let a = 5 ; let a = 5 ; let a = 0.55 ; let a = Foo.createElement """" [@JSX]; let ident = a ; let fragment1 = <> ; let fragment2 = <> ; let fragment3 = <> ; let fragment4 = <> ; let fragment5 = <> ; let fragment6 = <> ; let fragment7 = <> ; let fragment8 = <> ; let fragment9 = <> 2 2 2 2 ; let fragment10 = <> 2.2 3.2 4.6 1.2 ; let fragment11 = <> ""str"" ; let fragment12 = <> (6 + 2) (6 + 2) (6 + 2) ; let fragment13 = <> fragment11 fragment11 ; let listOfItems1 = 1 2 3 4 5 ; let listOfItems2 = 1.0 2.8 3.8 4.0 5.1 ; let listOfItems3 = fragment11 fragment11 ; /* * Several sequential simple jsx expressions must be separated with a space. */ let thisIsRight a b => (); let tagOne children => (); let tagTwo children => (); /* thisIsWrong ; */ thisIsRight ; /* thisIsWrong ; */ thisIsRight ; let a children => (); let b children => (); let thisIsOkay = ; let thisIsAlsoOkay = ; /* Doesn't make any sense, but suppose you defined an infix operator to compare jsx */ < ; > ; < ; > ; let listOfListOfJsx = [<> ]; let listOfListOfJsx = [<> ]; let listOfListOfJsx = [ <> , <> ]; let listOfListOfJsx = [ <> , <> , ...listOfListOfJsx ]; let sameButWithSpaces = [<> ]; let sameButWithSpaces = [<> ]; let sameButWithSpaces = [ <> , <> ]; let sameButWithSpaces = [ <> , <> , ...sameButWithSpaces ]; /* * Test named tag right next to an open bracket. */ let listOfJsx = []; let listOfJsx = []; let listOfJsx = [, ]; let listOfJsx = [, , ...listOfJsx]; let sameButWithSpaces = []; let sameButWithSpaces = []; let sameButWithSpaces = [, ]; let sameButWithSpaces = [ , , ...sameButWithSpaces ]; /** * Test no conflict with polymorphic variant types. */ type thisType = [ | `Foo | `Bar]; type t 'a = [< thisType] as 'a; let asd = ""a"" ""b"" [@foo]; let asd2 = One.createElementobvioustypo test::false [""a"", ""b""] [@JSX] [@foo]; let span test::(test: bool) foo::(foo: int) children => 1; let asd = ""a"" ""b"" [@foo]; /* ""video"" call doesn't end with a list, so the expression isn't converted to JSX */ let video test::(test: bool) children => children; let asd2 = video test::false 10 [@JSX] [@foo]; let div children => 1; ((fun () => div) ()) [] [@JSX]; let myFun () => <> ; let myFun () => <> ; let myFun () => <> ; /** * Children should wrap without forcing attributes to. */ ; /** * Failing test cases: */ /* let res = ) > */ /* */ /* ; */ /* let res = ) />; */ " ReasonML https://riju.codes/reasonml "print_string(""Hello, world!\n"");" Reason https://github.com/jaredly/reason-language-server 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 https://github.com/facebook/reason https://www.meetup.com/topics/reasonml // /* */ print_string """" true false true true false true true true true true true true true true true true true false true true true 1 3 reasonml.github.io Reason https://github.com/reasonml-editor/language-reason year|publisher|title|authors|isbn13\n2006|Pc Publishing|Fast Guide To Propellerhead Reason|Hollin Jones; Debbie Poyser; Derek Johnson|9781870775274 Reason 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 graphql GraphQL 2012 Lee Byron 46 queryLanguage http://graphql.org/ 9 https://graphql.org/blog/ https://github.com/graphql/graphql-js/releases 56 2 25135 true 10 ace cloc codeql dgraph gintonic michelson ngql prettier pygments wasmer queryLanguage 1 0 text source.graphql data false g/GraphQL.graphql 47 2015 2018 2 6 2015 2015 javascript ruby scala GraphQL is a data query language developed internally by Facebook in 2012 before being publicly released in 2015. It provides an alternative to REST and ad-hoc webservice architectures.. It allows clients to define the structure of the data required, and exactly the same structure of the data is returned from the server. It is a strongly typed runtime which allows clients to dictate what data is needed. This avoids both the problems of over-fetching as well as under-fetching of data. Major GraphQL clients include Apollo Client and Relay. GraphQL servers are available for multiple languages, including JavaScript, Python, Ruby, Java, C#, Scala, Go, Elixir, Erlang, PHP, and Clojure. 2016 195 15 65 50353761 Facebook graphql gql graphqls graphql javascript https://cheatsheets.zip/graphql 18676 0 71 1 gql graphql graphqls https://graphql.org/learn/ https://graphql.org/community/upcoming-events/ https://graphql.org/faq/ text https://graphql.org/foundation/annual-reports/ https://github.com/antlr/grammars-v4/tree/master/graphql graphql "{ ""Hello World"" }" "# Copyright (c) 2015, Facebook, Inc. # All rights reserved. # # This source code is licensed under the BSD-style license found in the # LICENSE file in the root directory of this source tree. An additional grant # of patent rights can be found in the PATENTS file in the same directory. schema { query: QueryType mutation: MutationType } type Foo implements Bar { one: Type two(argument: InputType!): Type three(argument: InputType, other: String): Int four(argument: String = ""string""): String five(argument: [String] = [""string"", ""string""]): String six(argument: InputType = {key: ""value""}): Type } interface Bar { one: Type four(argument: String = ""string""): String } union Feed = Story | Article | Advert scalar CustomScalar enum Site { DESKTOP MOBILE } input InputType { key: String! answer: Int = 42 } extend type Foo { seven(argument: [String]): Type } directive @skip(if: Boolean!) on FIELD | FRAGMENT_SPREAD | INLINE_FRAGMENT directive @include(if: Boolean!) on FIELD | FRAGMENT_SPREAD | INLINE_FRAGMENT " https://reddit.com/r/GraphQL https://twitter.com/graphql GraphQL https://github.com/Mayank1791989/gql-language-server null true false query mutation subscription extend schema directive scalar type interface union enum input implements fragment on # """" true false true false true true true true true true true true false true true https://en.wikipedia.org/wiki/GraphQL 11 7 graphql.org https://github.com/rmosolgo/language-graphql year|publisher|title|authors|isbn13\n2017|Manning Publications|React Quickly: Painless web apps with React, JSX, Redux, and GraphQL|Mardan, Azat|9781617293344\n2019|Packt Publishing|Hands-On Full-Stack Web Development with GraphQL and React: Build scalable full-stack applications while learning to solve complex problems with GraphQL|Grebe, Sebastian|9781789135763\n2020|Packt Publishing|Full-Stack React, TypeScript, and Node: Build cloud-ready web applications using React 17 with Hooks and GraphQL|Choi, David|9781839214691\n2019|Packt Publishing|Mastering React Test-Driven Development: Build rock-solid, well-tested web apps with React, Redux and GraphQL|Irvine, Daniel|9781789138788\n2018|Apress|Visual Design of GraphQL Data: A Practical Introduction with Legacy Data and Neo4j|Frisendal, Thomas|9781484239049\n20180809|O'Reilly Media, Inc.|Learning GraphQL|Eve Porcello; Alex Banks|9781492044864\n20210221|Simon & Schuster|GraphQL in Action|Samer Buna|9781638350859\n2016-08-30|Packt Publishing|Learning GraphQL and Relay|Samer Buna|9781786461971\n20180327|O'Reilly Media, Inc.|Craft GraphQL APIs in Elixir with Absinthe|Bruce Williams; Ben Wilson|9781680505931\n2022-03-30|Packt Publishing|Full Stack Development with Angular and GraphQL|Ahmed Bouchefra|9781800209756\n28-02-2022|Packt Publishing|Full-Stack Web Development with GraphQL and React|Sebastian Grebe|9781801079174 GraphQL year|title|doi|citations|influentialCitations|authors|paperId\n2018|Semantics and Complexity of GraphQL|10.1145/3178876.3186014|51|6|O. Hartig and Jorge Pérez|cf1ac803fcd5339063003a7847556055d25983d7\n2019|An Empirical Study of GraphQL Schemas|10.1007/978-3-030-33702-5_1|19|0|Erik Wittern and Alan Cha and James C. Davis and Guillaume Baudart and Louis Mandel|512fb84e420f7001c9b4ba1e7b485d4cd06ba1cb\n2017|Implementing GraphQL as a Query Language for Deductive Databases in SWI-Prolog Using DCGs, Quasi Quotations, and Dicts|10.4204/EPTCS.234.4|14|2|Falco Nogatz and D. Seipel|6fc5114fada3dc4eaa0a33345522c5b353b3d702\n2019|Comparative Analysis Between Standards Oriented to Web Services: SOAP, REST and GRAPHQL|10.1007/978-3-030-42517-3_22|4|0|Jaime Sayago Heredia and Evelin Flores-García and Andrés Solano|1d0a063e1ae7cff3197be11322ecf7f63740c4c2\n2019|morph-GraphQL: GraphQL Servers Generation from R2RML Mappings (S)|10.18293/SEKE2019-055|4|0|Freddy Priyatna and David Chaves-Fraga and Ahmad Alobaid and Óscar Corcho|c0f1a7e772591f87b5ef2a232d3196ef5752a9d3\n2020|Exploiting Declarative Mapping Rules for Generating GraphQL Servers with Morph-GraphQL|10.1142/s0218194020400070|3|0|David Chaves-Fraga and Freddy Priyatna and Ahmad Alobaid and Óscar Corcho|08e989912b7ed00b32195c269edea18edcc33f6b\n2020|COMPARATIVE ANALYSIS OF WEB APPLICATION PERFORMANCE IN CASE OF USING REST VERSUS GRAPHQL|10.31410/ITEMA.2020.17|1|0|M. Vesić and N. Kojić|bc1399b7e27c20633989a561d8cfd00f746391af d D 2001 Walter Bright and Andrei Alexandrescu 66 pl https://dlang.org 32 https://dlang.org/blog/ https://dlang.org/changelog/ https://dlang.org/download.html 2.109.0 57 5 25131 3173 true 34 alma-007 berkeleydb cir cmake cperl dlvm drakon dub-pm encore erlang flow9 gcc ghc invokator iode java julia mal mongodb monkeyx open-shading-language perl php pony postgresql pygments python ruby rust saltstack sdlang surrealdb swift volt pl 5871 7198 13224 0 Dlang d d text/x-d source.d programming false 113 2006 2018 9 7 1445 7 d.py 26 2010 2001 freebsd linux c csharp eiffel java python minid vala swift genie ruby assembly-language llvmir cil eclipse-editor visual-studio-editor emacs-editor vim textmate-editor visual-studio-code-editor gdb utf-8 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. 2003 1008 708 1343 243881 Digital Mars d d di d di d d 6311 0 https://exercism.org/tracks/d 76 2 2 true d true false https://tio.run/#d https://dlang.org/documentation.html https://dlang.org/articles/faq.html text 158 d D http://www.rosettacode.org/wiki/Category:D https://code.dlang.org/ gdc United States D // Type your code here, or load an example. int square(int num) { return num * num; } "// Hello World in D import std.stdio; void main() { writefln(""Hello World!""); } " unittest { } D https://riju.codes/d "import std.stdio; void main() { writeln(""Hello, world!""); } " https://twitter.com/d_programming "1 import std.stdio, std.algorithm, std.range, std.string; 2 3 void main() 4 { 5 dstring[][dstring] signs2words; 6 7 foreach(dchar[] w; lines(File(""words.txt""))) 8 { 9 w = w.chomp().toLower(); 10 immutable key = w.dup.sort().release().idup; 11 signs2words[key] ~= w.idup; 12 } 13 14 foreach(words; signs2words) 15 if(words.length > 1) 16 writefln(words.join("" "")); 17 }" D https://github.com/d-language-server/dls https://www.meetup.com/topics/dpl // /+ +/ printf """" true false true true true true true true true true true true false true true true https://en.wikipedia.org/wiki/D_(programming_language) 2 4 https://hopl.info/showlanguage.prx?exp=3173 D dlang.org D https://github.com/textmate/d.tmbundle 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 D 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 elm Elm 2012 Evan Czaplicki 55 pl http://elm-lang.org 6 https://elm-lang.org/news 0.19.1 58 5 11 25111 true 9 ace bosque civet cloc elm mal pygments reason scrapscript https://github.com/elm-lang/elm-compiler pl 2094 2864 19905 0 elm elm text/x-elm source.elm programming 2012 2024 2012 206 659 7484 336 false e/Elm.elm 295 2013 2017 3 19 elm.py 2012 2023 5829 120 236 11 56923 https://github.com/elm/compiler/blob/master/roadmap.md http://elm-lang.org/try 2011 2012 haskell standard-ml ocaml f-sharp vuejs javascript typescript "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." 2012 268 54 395 37552825 https://github.com/elm elm elm elm elm elm elm haskell markdown json elm bourne-shell yaml javascript css xml python dockerfile javascript true 12193 127 https://exercism.org/tracks/elm 73 1 true 0 true elm false https://elm-lang.org/docs https://faq.elm-community.org/ text elm http://www.rosettacode.org/wiki/Category:Elm https://package.elm-lang.org/ United States and France Elm "-- Hello world in Elm import Text main = Text.plainText ""Hello, world!""" "import Html exposing (text) main = text ""Hello World"" " " main = asText (qsort [3,9,1,8,5,4,7]) qsort lst = case lst of x:xs -> qsort (filter ((>=)x) xs) ++ [x] ++ qsort (filter ((<)x) xs) [] -> [] {--------------------- QuickSort works as follows: - Choose a pivot element which be placed in the ""middle"" of the sorted list. In our case we are choosing the first element as the pivot. - Gather all of the elements less than the pivot (the first filter). We know that these must come before our pivot element in the sorted list. Note: ((>=)x) === (\y -> (>=) x y) === (\y -> x >= y) - Gather all of the elements greater than the pivot (the second filter). We know that these must come after our pivot element in the sorted list. - Run `qsort` on the lesser elements, producing a sorted list that contains only elements less than the pivot. Put these before the pivot. - Run `qsort` on the greater elements, producing a sorted list. Put these after the pivot. Note that choosing a bad pivot can have bad effects. Take a sorted list with N elements. The pivot will always be the lowest member, meaning that it does not divide the list very evenly. The list of lessers has 0 elements and the list of greaters has N-1 elemens. This means qsort will be called N times, each call looking through the entire list. This means, in the worst case, QuickSort will make N^2 comparisons. ----------------------} " Elm https://riju.codes/elm "module Main exposing (..) output : String output = ""Hello, world!"" " https://twitter.com/elmlang "-- This is a single line comment {- This is a multi-line comment. It can span multiple lines. -} {- It is possible to {- nest -} multi-line comments -} -- Here we define a value named ''greeting''. The type is inferred as a String. greeting = ""Hello World!"" -- It is best to add type annotations to top-level declarations. hello : String hello = ""Hi there."" -- Functions are declared the same way, with arguments following the function name. add x y = x + y -- Again, it is best to add type annotations. hypotenuse : Float -> Float -> Float hypotenuse a b = sqrt (a^2 + b^2) -- Functions are also curried; here we've curried the multiplication -- infix operator with a `2` multiplyBy2 : number -> number multiplyBy2 = (*) 2 -- If-expressions are used to branch on values absoluteValue : number -> number absoluteValue number = if number < 0 then negate number else number -- Records are used to hold values with named fields book : { title : String, author : String, pages : Int } book = { title = ""Steppenwolf"" , author = ""Hesse"" , pages = 237 } -- Record access is done with `.` title : String title = book.title -- Record access `.` can also be used as a function author : String author = .author book -- We can create entirely new types with the `type` keyword. -- The following value represents a binary tree. type Tree a = Empty | Node a (Tree a) (Tree a) -- It is possible to inspect these types with case-expressions. depth : Tree a -> Int depth tree = case tree of Empty -> 0 Node value left right -> 1 + max (depth left) (depth right)" Elm https://github.com/elm-tooling/elm-language-server https://github.com/elm-lang/elm-compiler -- {- -} """" false true true true true true true true true https://en.wikipedia.org/wiki/Elm_(programming_language) 5 2 Elm elm-lang.org Elm https://github.com/elm-community/Elm.tmLanguage 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 Elm elm engineer 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 haxe Haxe 2005 Nicolas Cannasse 50 pl http://haxe.org 11 https://haxe.org/blog/ 4.3.4 59 4 20 25104 true 12 ace cloc flow9 ghc hashlink haxe haxelibs-pm mal neko pygments reason star https://github.com/HaxeFoundation/haxe pl 2069 3304 16827 0 haxe haxe text/x-haxe source.hx programming 2013 2024 2005 170 647 6045 1050 false h/Haxe.hx 109 2017 2018 4 haxe.py 2003 2025 23771 282 7364 89 443260 2005 2005 hack ocaml arm ia-32 android ios linux actionscript java javascript csharp php python lua neko xml haskell ml go dart opa clojure coffeescript typescript scala monkey vala Haxe is computer software, a high-level, cross-platform, multi-paradigm programming language and compiler that can produce applications and source code, for many different computing platforms, from one code-base. It is free and open-source software, distributed under the GNU General Public License (GPL) 2.0, and the standard library under an MIT License. Haxe includes a set of common functions that are supported across all platforms, such as numeric data types, text, arrays, binary and some common file formats. Haxe also includes platform-specific application programming interface (API) for Adobe Flash, C++, PHP and other languages. Code written in the Haxe language can be source-to-source compiled into ActionScript 3, JavaScript, Java, C++, C#, PHP, Python, Lua and Node.js. Haxe can also emit small web format SWF and Neko bytecode. Major users of Haxe include BBC, Coca-Cola, Disney, Hasbro, Mattel, Nickelodeon, Prezi, TiVo, Toyota, and Zynga. OpenFL, Kha and Flambe are popular Haxe frameworks that enable creating multi-platform content from one codebase. 2006 150 218 353 5404706 Haxe Foundation hx hxml hx hxsl hx hx hxsl hx hxml haxe haxe ocaml json lua java yaml make actionscript bourne-shell markdown c xml javascript python php diff cpp objective-c ini html true 10290 1 78 1 true 4 true hx hxsl https://tio.run/#haxe https://haxe.org/documentation/introduction/ text haxe Haxe http://www.rosettacode.org/wiki/Category:Haxe https://lib.haxe.org/ haxe Unknown "// Hello world in Haxe class Hello { static public function main() { trace(""Hello world!""); } }" "class HelloWorld { static function main() { trace(""Hello World""); } }" Haxe https://riju.codes/haxe "class Main { static public function main() { trace(""Hello, world!""); } } " https://twitter.com/haxe_org "class FooBar { public var foo:Int; public var bar:String; public function new(){ foo=1; bar=""2"";} function anyFooBar(v:{foo:Int,bar:String}) trace(v.foo); static function test(){ var fb = new FooBar(); fb.anyFooBar(fb); fb.anyFooBar({foo:123,bar:""456""}); } }" Haxe https://github.com/vshaxe/haxe-language-server https://github.com/HaxeFoundation/haxe // /* */ """" true true true false true true true https://en.wikipedia.org/wiki/Haxe 5 0 Haxe haxe.org Haxe https://github.com/vshaxe/haxe-TmLanguage year|publisher|title|authors|isbn13\n2015|Packt Publishing|Haxe Game Development Essentials|McCurdy, Jeremy|9781785286919\n2015-11-26|Packt Publishing|Haxe Game Development Essentials|Jeremy McCurdy|9781785289781\n2011-07-26|Packt Publishing|haXe 2 Beginner's Guide|Benjamin Dasnois|9781849512565\n20110726|Packt Publishing|haXe 2 Beginner's Guide|Benjamin Dasnois|9781849512572 Haxe haxe developer title|year|author|goodreadsId|rating|ratings|reviews\nProfessional haXe and Neko (Programmer to Programmer)|2008|L. McColl-Sylvester|42053093|0.0|0|0 pug Pug 2010 Tj Holowaychuk 40 template https://pugjs.org 6 2.0.0-beta6 60 3 10 25097 true 6 ace jedi kaffeine netbeans-editor nit pug https://github.com/pugjs/pug template 528 575 11560 0 jade pug text/x-pug text.jade markup 2010 2024 2010 538 1959 21601 315 false p/Pug.pug 118 2010 2016 2 16 html.py 2010 2024 2716 266 918 15 104113 https://playcode.io/pug/ https://github.com/pugjs jade pug pug pug jade pug json html javascript markdown yaml typescript stylus css coffeescript true 27946 0 70 1 true 2 true jade pug https://pugjs.org/api/getting-started.html text pug Various doctype html html head title Hello World body h1 Hello World p. Hello, World! Pug https://riju.codes/pug html body p Hello, world! Pug append block case default doctype each else extends for if in include mixin typeof unless var when https://github.com/pugjs/pug // true true true true true true true true true true true 2 0 pugjs.org Pug https://github.com/davidrios/jade-tmbundle 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 Pug scheme Scheme 1975 Guy Steele and Gerald Jay Sussman 58 pl lisp http://www.scheme-reports.org/ 42 https://planet.scheme.org/ https://www.scheme.com/csv6.9c/6.9c.html 6.9c 61 5 25093 694 true 52 ace atomspace bio black carbon carth chicken chicken chisel cir cloc co2 codeql ecl eiffel femtolisp firrtl flare gerbil gforth gwl hare harlan idio idris jal-compiler javascript julia laml lux mal minikanren nodejs particles poke prescheme pycket pygments racket rainbow ruby scheme48 slideshow slope spatial sporth sympy unison uxf v8 vyxal wing pl 5469 7221 16742 0 scheme guile bigloo chicken csi gosh r6rs scheme scheme text/x-scheme source.scheme programming false s/Scheme.scm 42 2006 2014 4 10 lisp.py https://try.scheme.org/ 2009 1970 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 "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." 2001 705 929 1710 28119 https://community.scheme.org/ scm ss scm sch sld sls sps ss scm scm ss scm ss 3796 1174 https://exercism.org/tracks/scheme 96 2 6 true sc sch scm sld sps ss sls https://docs.scheme.org/ https://events.scheme.org/ http://community.schemewiki.org/?scheme-faq text 2803 scheme scheme Scheme https://repl.it/languages/scheme http://www.rosettacode.org/wiki/Category:Scheme guile-2.0 United States Scheme "; Hello World in Scheme (display ""Hello, world!"") (newline)" "(display ""Hello World"") (newline) " (define-library (libs basic) (export list2 x) (begin (define (list2 . objs) objs) (define x 'libs-basic) (define not-exported 'should-not-be-exported) )) Scheme https://riju.codes/scheme "(display ""Hello, world!"") (newline) " "(set! + (let ((original+ +)) (lambda args (if (and (not (null? args)) (string? (car args))) (apply string-append args) (apply original+ args))))) (+ 1 2 3) ===> 6 (+ ""1"" ""2"" ""3"") ===> ""123""" Scheme case do let loop if else when cons car cdr cond lambda lambda* syntax-rules format set! quote eval append list list? member? load ; #| |# display """" false true true true true true true true true false true https://github.com/Calysto/calysto_scheme https://en.wikipedia.org/wiki/Scheme_(programming_language) 24 23 https://hopl.info/showlanguage.prx?exp=694 Scheme scheme-reports.org Scheme https://github.com/textmate/scheme.tmbundle 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 Scheme scheme engineer 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 chapel Chapel 2004 David Callahan and Hans Zima and Brad Chamberlain and John Plevyak 121 pl arrayLang https://chapel-lang.org/ https://chapel-lang.org/docs/language/spec/index.html 3 https://chapel-lang.org/blog/index.html https://chapel-lang.org/releaseNotes.html https://chapel-lang.org/download.html 2.2.0 62 2 6 25076 8171 true 3 chapel cloc pygments https://chapel-lang.org/ChapelCon.html https://github.com/chapel-lang/chapel pl 50 55 212 0 chpl text source.chapel programming 2014 2024 2009 64 414 1758 2796 false c/Chapel.chpl 40 2011 2018 5 7 Cascade High Productivity Language HPE chapel.py 2009 2025 106965 383 71180 1038 14088586 https://ato.pxeger.com/run?1=m70sOSOxIDVnwYKlpSVpuhY7y4syS1Jz8jSUPFJzcvJ1FMrzi3JSFJU0rSHyUGUw5QA 2014 2009 ada csharp c fortran java fortress unified-parallel-c x10 isbn 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. 2006 63 198 122 6776794 Productive parallel computing at every scale Productive parallel computing at every scale Cray Inc. Productive parallel computing at every scale chpl chpl chpl chpl chpl https://www.hpcwire.com/2024/09/04/whats-new-with-chapel-nine-questions-for-the-development-team/ chapel cpp c bash make python c true 16909 1 214 x10 fortress zpl unified-parallel-c python zpl ada csharp java fortran cpp unified-parallel-c 4 true 2 true https://youtu.be/Zdjgy0BlZxs?si=cR3B4oAJcHanOI00 chpl https://tio.run/#chapel https://chapel-lang.org/docs/ https://chapel-lang.org/events.html text 6683 http://www.rosettacode.org/wiki/Category:Chapel United States Chapel https://ieeexplore.ieee.org/document/1299190 https://www.facebook.com/ChapelLanguage/ https://www.youtube.com/@chapellanguage https://mastodon.social/@chapelprogramminglanguage https://chapel.discourse.group/ "writeln(""Hello World""); " "writeln(""Hello, world!""); // print 'Hello, world!' to the console " Chapel https://reddit.com/r/chapel https://twitter.com/ChapelLanguage Chapel _ 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 https://github.com/chapel-lang/chapel // /* */ writeln """" = true false true true true true true true true true true false true true true true true true true false true true true true true true true true true true false true true false true true true true true true true true true true true true false false true true true true true true true false true true https://en.wikipedia.org/wiki/Chapel_(programming_language) 2 19 https://hopl.info/showlanguage.prx?exp=8171 chapel-lang.org Chapel https://github.com/chapel-lang/chapel-tmbundle 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 Chapel chapel developer 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 awk awk 1977 Alfred Aho and Peter J. Weinberger and Brian Kernighan 47 pl http://www.cs.princeton.edu/~bwk/btl.mirror/ 46 63 5 25070 1844 true 47 abcl-lang arrow-format bash bawk beef berkeleydb cir civet crmsh ecl eiffel elfe ffmpeg flex flow9 gforth go groff hhvm incipit java kona ktyek latino lil linux mal manim michelson mongodb ngs nodejs noweb php poke pov-ray-sdl prismjs pygments ragel revolution-programming-language ruby slony smpl swift v wonkey xl-lang pl 13611 20601 2552 0 awk gawk mawk nawk text source.awk programming false a/AWK.awk 22 2012 2016 1 3 Aho, Weinberger, Kernighan textedit.py 37 1977 c snobol bourne-shell tcl ampl perl lua regex unix sed freebsd solaris java isbn 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. 2001 506 495 770 1456 Bell Labs awk auk gawk mawk nawk awk awk awk http://pldb.info/blog/brianKernighan.html https://cheatsheets.zip/awk 4680 7 https://exercism.org/tracks/awk 57 3 auk awk gawk mawk nawk https://tio.run/#awk https://www.gnu.org/software/gawk/manual/gawk.html text https://github.com/antlr/grammars-v4/tree/master/awk Awk http://www.rosettacode.org/wiki/Category:AWK gawk United States AWK "# awk -f awk.awk BEGIN { print ""Hello World"" } " "#!/bin/awk -f BEGIN { # It is not possible to define output file names here because # FILENAME is not define in the BEGIN section n = """"; printf ""Generating data files ...""; network_max_bandwidth_in_byte = 10000000; network_max_packet_per_second = 1000000; last3 = 0; last4 = 0; last5 = 0; last6 = 0; } { if ($1 ~ /Average/) { # Skip the Average values n = """"; next; } if ($2 ~ /all/) { # This is the cpu info print $3 > FILENAME"".cpu.user.dat""; # print $4 > FILENAME"".cpu.nice.dat""; print $5 > FILENAME"".cpu.system.dat""; # print $6 > FILENAME"".cpu.iowait.dat""; print $7 > FILENAME"".cpu.idle.dat""; print 100-$7 > FILENAME"".cpu.busy.dat""; } if ($2 ~ /eth0/) { # This is the eth0 network info if ($3 > network_max_packet_per_second) print last3 > FILENAME"".net.rxpck.dat""; # Total number of packets received per second. else { last3 = $3; print $3 > FILENAME"".net.rxpck.dat""; # Total number of packets received per second. } if ($4 > network_max_packet_per_second) print last4 > FILENAME"".net.txpck.dat""; # Total number of packets transmitted per second. else { last4 = $4; print $4 > FILENAME"".net.txpck.dat""; # Total number of packets transmitted per second. } if ($5 > network_max_bandwidth_in_byte) print last5 > FILENAME"".net.rxbyt.dat""; # Total number of bytes received per second. else { last5 = $5; print $5 > FILENAME"".net.rxbyt.dat""; # Total number of bytes received per second. } if ($6 > network_max_bandwidth_in_byte) print last6 > FILENAME"".net.txbyt.dat""; # Total number of bytes transmitted per second. else { last6 = $6; print $6 > FILENAME"".net.txbyt.dat""; # Total number of bytes transmitted per second. } # print $7 > FILENAME"".net.rxcmp.dat""; # Number of compressed packets received per second (for cslip etc.). # print $8 > FILENAME"".net.txcmp.dat""; # Number of compressed packets transmitted per second. # print $9 > FILENAME"".net.rxmcst.dat""; # Number of multicast packets received per second. } # Detect which is the next info to be parsed if ($2 ~ /proc|cswch|tps|kbmemfree|totsck/) { n = $2; } # Only get lines with numbers (real data !) if ($2 ~ /[0-9]/) { if (n == ""proc/s"") { # This is the proc/s info print $2 > FILENAME"".proc.dat""; # n = """"; } if (n == ""cswch/s"") { # This is the context switches per second info print $2 > FILENAME"".ctxsw.dat""; # n = """"; } if (n == ""tps"") { # This is the disk info print $2 > FILENAME"".disk.tps.dat""; # total transfers per second print $3 > FILENAME"".disk.rtps.dat""; # read requests per second print $4 > FILENAME"".disk.wtps.dat""; # write requests per second print $5 > FILENAME"".disk.brdps.dat""; # block reads per second print $6 > FILENAME"".disk.bwrps.dat""; # block writes per second # n = """"; } if (n == ""kbmemfree"") { # This is the mem info print $2 > FILENAME"".mem.kbmemfree.dat""; # Amount of free memory available in kilobytes. print $3 > FILENAME"".mem.kbmemused.dat""; # Amount of used memory in kilobytes. This does not take into account memory used by the kernel itself. print $4 > FILENAME"".mem.memused.dat""; # Percentage of used memory. # It appears the kbmemshrd has been removed from the sysstat output - ntolia # print $X > FILENAME"".mem.kbmemshrd.dat""; # Amount of memory shared by the system in kilobytes. Always zero with 2.4 kernels. # print $5 > FILENAME"".mem.kbbuffers.dat""; # Amount of memory used as buffers by the kernel in kilobytes. print $6 > FILENAME"".mem.kbcached.dat""; # Amount of memory used to cache data by the kernel in kilobytes. # print $7 > FILENAME"".mem.kbswpfree.dat""; # Amount of free swap space in kilobytes. # print $8 > FILENAME"".mem.kbswpused.dat""; # Amount of used swap space in kilobytes. print $9 > FILENAME"".mem.swpused.dat""; # Percentage of used swap space. # n = """"; } if (n == ""totsck"") { # This is the socket info print $2 > FILENAME"".sock.totsck.dat""; # Total number of used sockets. print $3 > FILENAME"".sock.tcpsck.dat""; # Number of TCP sockets currently in use. # print $4 > FILENAME"".sock.udpsck.dat""; # Number of UDP sockets currently in use. # print $5 > FILENAME"".sock.rawsck.dat""; # Number of RAW sockets currently in use. # print $6 > FILENAME"".sock.ip-frag.dat""; # Number of IP fragments currently in use. # n = """"; } } } END { print "" '"" FILENAME ""' done.""; } " Awk https://reddit.com/r/awk https://riju.codes/awk "BEGIN { print ""Hello, world!"" } " "BEGIN { pattern = ARGV[1] for (i = 1; i < ARGC; i++) # remove first argument ARGV[i] = ARGV[i + 1] ARGC-- if (ARGC == 1) { # the pattern was the only thing, so force read from standard input (used by book) ARGC = 2 ARGV[1] = ""-"" } } $0 ~ pattern { print FILENAME "":"" $0 }" AWK https://savannah.gnu.org/git/?group=gawk # print """" true true true true true true false true https://en.wikipedia.org/wiki/AWK 26 8 https://hopl.info/showlanguage.prx?exp=1844 Awk Awk https://github.com/github-linguist/awk-sublime 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 Awk awk engineer 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 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 groovy Groovy 2003 James Strachan 66 pl http://groovy-lang.org/ 16 https://blogs.apache.org/groovy/ http://groovy-lang.org/releases.html https://groovy.apache.org/download.html 64 5 25068 true 16 ace ballerina ceylon cloc couchdb dexvis flutter gradle kotlin mal mps netbeans-editor nextflow pygments xgboost-model xgboost pl 19506 27223 Jenkinsfile 76001 3 "author name avatar url language languageColor stars forks currentPeriodStars description\njenkinsci pipeline-examples https://github.com/jenkinsci.png https://github.com/jenkinsci/pipeline-examples Groovy #e69f56 2979 1833 67 ""A collection of examples, tips and tricks and snippets of scripting for the Jenkins Pipeline plugin""\nben-manes gradle-versions-plugin https://github.com/ben-manes.png https://github.com/ben-manes/gradle-versions-plugin Groovy #e69f56 2012 111 52 ""Gradle plugin to discover dependency updates""" groovy groovy groovy text/x-groovy source.groovy programming false g/Groovy.groovy 113 2007 2014 5 9 24522 49 jvm.py 29 2011 2003 java python ruby perl smalltalk objective-c kotlin jvm regex xml html json android eclipse-editor emacs-editor textmate-editor visual-studio-code-editor javascript Apache Groovy is an object-oriented programming language for the Java platform. It is a dynamic language with features similar to those of Python, Ruby, Perl, and Smalltalk. It can be used as a scripting language for the Java Platform, is dynamically compiled to Java virtual machine (JVM) bytecode, and interoperates with other Java code and libraries. Groovy uses a Java-like curly-bracket syntax. Most Java code is also syntactically valid Groovy, although semantics may be different. Groovy 1.0 was released on January 2, 2007, and Groovy 2.0 in July, 2012. Since version 2, Groovy can also be compiled statically, offering type inference, and performance near that of Java. Groovy 2.4 was the last major release under Pivotal Software's sponsorship which ended in March 2015. Groovy has since changed its governance structure to a Project Management Committee (PMC) in the Apache Software Foundation. 2018 577 583 1 508401 https://github.com/grails groovy groovy grt gtpl gvy groovy groovy gradle groovy java true 6056 0 https://exercism.org/tracks/groovy 118 jvm 1 gant groovy grt gtpl gvy jenkinsfile https://tio.run/#groovy https://groovy-lang.org/documentation.html https://devdocs.io/groovy~3.0/ https://groovy-lang.org/faq.html text groovy Groovy http://www.rosettacode.org/wiki/Category:Groovy groovy United States and Spain and France Groovy "// Hello World in Groovy println ""Hello World"" " "println ""Hello World"" " "#!/usr/bin/env groovy println ""Groovy!"" " Groovy https://reddit.com/r/groovy https://riju.codes/groovy "print ""Hello, world!""; " https://twitter.com/apachegroovy "class Bird implements FlyingAbility {} /* Adds the trait FlyingAbility to the Bird class capabilities */ def bird = new Bird() /* instantiate a new Bird */ assert bird.fly() == ""I'm flying!"" /* the Bird class automatically gets the behavior of the FlyingAbility trait */" Groovy https://github.com/palantir/groovy-language-server/ as assert break case catch class const continue def default do else enum extends false finally for goto if implements import in instanceof interface new null package return super switch this throw throws trait true try while https://www.meetup.com/topics/groovy-programming-language // /* */ println """" true false true true true true true true true true true true true true false true true true https://en.wikipedia.org/wiki/Groovy_(programming_language) 22 7 Groovy Groovy groovy-lang.org Groovy https://github.com/textmate/groovy.tmbundle year|publisher|title|authors|isbn13\n2014|Apress|Scripting in Java: Integrating with Groovy and JavaScript|Sharan, Kishori|9781484207147\n2013|Packt Publishing|Groovy 2 Cookbook|Adamovich, Andrey and Fiandesio, Luciano|9781849519366\n2008|Pragmatic Bookshelf|Groovy Recipes: Greasing the Wheels of Java (Pragmatic Programmers)|Davis, Scott|9780978739294\n2019|Apress|Learning Groovy 3: Java-Based Dynamic Scripting|Davis, Adam L.|9781484250587\n2013|Pragmatic Bookshelf|Programming Groovy 2: Dynamic Productivity for the Java Developer (Pragmatic Programmers)|Subramaniam, Venkat|9781937785307\n2007|Manning Publications|Groovy in Action|Dierk Koenig and Andrew Glover and Paul King and Guillaume Laforge and Jon Skeet|9781932394849\n2006|Morgan Kaufmann|Groovy Programming: An Introduction for Java Developers|Barclay, Kenneth and Savage, John|9780123725073\n2008|Apress|Beginning Groovy and Grails: From Novice to Professional|Christopher M. Judd and Joseph Faisal Nusairat and James Shingler|9781430210450\n2017|Packt Publishing|Introduction to JVM Languages: Get familiar with the world of Java, Scala, Clojure, Kotlin, and Groovy|Leun, Vincent van der|9781787126589\n2010|Packt Publishing|Groovy for Domain-Specific Languages|Dearle,Fergal|9781847196903\n|San Francisco, CA : Morgan Kaufmann Publishers, 2006.|Groovy programming||9786610751563\n20160805|Springer Nature|Learning Groovy|Adam L. Davis|9781484221174\n20100727|Elsevier S & T|Groovy Programming|Kenneth Barclay|9780080471594\n2010||Groovy (programming Language)|Miller and Frederic P. and Vandome and Agnes F. and McBrewster and John|9786133734975\n20130918|Simon & Schuster|Making Java Groovy|Kenneth Kousen|9781638352266\n20131022|Packt Publishing|Groovy 2 Cookbook|Andrey Adamovich; Luciano Fiandesio|9781849519373\n20150603|Simon & Schuster|Groovy in Action|Cédric Champeau; Dierk Koenig; Hamlet D'Arcy; Paul King|9781638352877\n2010-06-01|Packt Publishing|Groovy for Domain-Specific Languages|Fergal Dearle|9781847196910\n20150928|Packt Publishing|Groovy for Domain-specific Languages - Second Edition|Fergal Dearle|9781849695411\n|The Pragmatic Programmers|Programming Groovy 2: dynamic productivity for the Java developer|Subramaniam, Venkat.|9781937785307\n|Packt Pub.|Unity 4.x Game Development By Example Beginner's Guide: A Seat-of-your-pants Manual For Building Fun, Groovy Little Games Quickly With Unity 4.x|Creighton, Ryan Henson.|9781849695268 Groovy year|title|doi|citations|influentialCitations|authors|paperId\n2009|Groovy package templates: supporting reuse and runtime adaption of class hierarchies|10.1145/1640134.1640139|14|2|Eyvind W. Axelsen and S. Krogdahl|6d32b1e21b79b56e6970eca79df12539a7090851\n2008|Groovy AOP: a dynamic AOP system for a JVM-based language|10.1145/1408647.1408650|10|1|Chanwit Kaewkasi and J. Gurd|b9125c558cb65125be9dc25ffd2d8ec967aea36e\n2006|A crash overview of groovy|10.1145/1144366.1144371|8|3|K. Henry|752a78ce9f5af6994d923ca7fe45cf154d3e7357\n2008|Groovy and Grails Recipes|10.1007/978-1-4302-1601-8|5|1|Bashar Abdul-Jawad|71f9838bf73355f59f64428147dcbc8244277377\n2013|Implementing patient recruitment on EURECA semantic integration platform through a Groovy query engine|10.1109/BIBE.2013.6701645|2|0|B. Claerhout and Kristof de Schepper and D. Pérez-Rey and R. Alonso-Calvo and J. V. Leeuwen and A. Bucur|439d4a11b11be4326401b13fce2e755f0fe99a3f\n2020|A history of the Groovy programming language|10.1145/3386326|2|0|Paul King|87b32a739617b59dee229021e92709b399426c47\n2017|Feature oriented programming in Groovy|10.1145/3141848.3141851|1|0|G. T. Assis and Gustavo Vale and Eduardo Figueiredo|61d2c11296a483800dea25917c23e878a87097cb title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Groovy|2008|Venkat Subramaniam|2695005|3.81|121|13 coq Coq 1989 Thierry Coquand 41 pl mathematics https://coq.inria.fr/ 9 8.19.1 65 1 20 25062 6970 true 12 coq fstar hacspec lean lego ligo menhir metamath pygments simplictiy urweb v https://github.com/coq/coq pl 793 1013 5206 0 text source.coq programming 2011 2024 103 637 4738 2608 false 62 2013 2018 13 4 theorem.py 1999 2025 54632 328 5150 209 609049 https://coq.vercel.app/ 1989 ocaml agda idris c isabelle 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. 2004 265 138 267 581974 https://coq.zulipchat.com/ Inria coq v v coq ocaml bourne-shell restructuredtext markdown nix python tex css yaml make html c xml javascript bash dockerfile csv lisp diff true 10590 0 66 lean metamath 1 true 8 true v https://coq.inria.fr/documentation https://github.com/coq/coq/blob/master/CONTRIBUTING.md text http://www.rosettacode.org/wiki/Category:Coq France https://coq.discourse.group/ "Require Import FunctionNinjas.All. Require Import ListString.All. Require Import Computation. Import C.Notations. Definition error (message : LString.t) : C.t := do_call! Command.ShowError message in ret. Definition main : C.t := call! card_is_valid := Command.AskCard in if card_is_valid then call! pin := Command.AskPIN in match pin with | None => error @@ LString.s ""No PIN given."" | Some pin => call! pin_is_valid := Command.CheckPIN pin in if pin_is_valid then call! ask_amount := Command.AskAmount in match ask_amount with | None => error @@ LString.s ""No amount given."" | Some amount => call! amount_is_valid := Command.CheckAmount amount in if amount_is_valid then call! card_is_given := Command.GiveCard in if card_is_given then call! amount_is_given := Command.GiveAmount amount in if amount_is_given then ret else error @@ LString.s ""Cannot give you the amount. Please contact your bank."" else error @@ LString.s ""Cannot give you back the card. Please contact your bank."" else error @@ LString.s ""Invalid amount."" end else error @@ LString.s ""Invalid PIN."" end else error @@ LString.s ""Invalid card."". " Coq https://reddit.com/r/Coq https://twitter.com/CoqLang https://github.com/coq/coq (* *) true true true true true true true true https://en.wikipedia.org/wiki/Coq 3 27 https://hopl.info/showlanguage.prx?exp=6970 Coq https://github.com/mkolosick/Sublime-Coq 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 Coq 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 tex Tex 1978 Donald Knuth 38 pl http://tug.org 120 66 4 25050 833 true 126 abcl-lang ace aith atomspace bamboo bash beef caramel catala checked-c chicken cir click clike cloc cmake conceptual coq cperl cryptol dafny dasm datafun dgraph differential-datalog dllup ec eiffel elpi emscripten eqn euphoria felix flow9 frege frundis futhark gap gerbil gforth ghc golo groff hacspec hakaru hazel htsql i invokator iterm2 jal-compiler jflex julia kamilalisp katex koka l2 latino lean lever links-programming-language linux manim mathics mathjson mathtype matplotlib menhir metalang99 mewmew michelson micro-cpp microsoft-equation-editor minizinc mlpolyr mongodb mythryl nesc nim nit noweb obsidian-lang oden oil opal open-shading-language opencv org pawn-scripting-language pawn perl plaid-programming-language polyglot-compiler popr pygments quint racket ragel rascal recfiles redprl rmarkdown saltstack scipy scribble scroll setlx sile simplictiy slick smallbasic smpl spatial sqlalchemy swi-prolog swift sympy t-lang tidyverse typst urweb wasp-lang xgboost-model xgboost yeti zl pl 24476 31515 248842 true 14 "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""" latex tex stex text/x-stex text.tex.latex markup false t/TeX.tex 7 markup.py https://latexbase.com/ 1993 1978 pascal metafont troff unix latex m4 c linux xetex unicode bibtex pdf emacs-editor lyx-editor vim mediawiki isbn "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." 2001 611 1657 1391 30065 tex aux bbx cbx cls dtx ins lbx ltx mkii mkiv mkvi sty toc tex tex aux toc true true 4276 3 54 1 aux bbx bib bst cbx dtx ins lbx ltx mkii mkiv mkvi sty tex cls https://tug.org/texlive/doc.html https://visualmatheditor.equatheque.net/doc/texbook.pdf https://tug.org/meetings.html https://texfaq.org/ text 7751 https://ctan.org/ United States % Hello World in plain \TeX \immediate\write16{Hello World!} \end Hello World \bye \ProvidesFile{verbose.bbx} [\abx@bbxid] \RequireBibliographyStyle{authortitle} \endinput TeX https://twitter.com/texusersgroup The quadratic formula is $$-b \pm \sqrt{b^2 - 4ac} \over 2a$$ \bye TeX % true true true false false https://en.wikipedia.org/wiki/TeX 3 1 https://hopl.info/showlanguage.prx?exp=833 Tex tug.org TeX https://github.com/textmate/latex.tmbundle 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 TeX tex engineer 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 spss SPSS 1968 Norman H. Nie and C. Hadlai Hull and Dale H. Bent 29 pl https://www.ibm.com/us-en/marketplace/spss-statistics 0 https://www.ibm.com/support/pages/ibm-spss-statistics-200-release-notess 67 2 25032 240 true 2 jsl tea-pl pl false s/SPSS.spss 1968 linux java python visual-basic r ascii sql html xml unix 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. 2002 1898 503 878 179088 SPSS Inc spss 965674 9587 33 3 https://www.ibm.com/support/pages/ibm-spss-statistics-28-documentation text United States "* SPSS Syntax * ""Hello World"" title in the Output Window of SPSS via SPSS Syntax. TITLE 'Hello World'. " "BEGIN PROGRAM. print ""Hello World"" END PROGRAM." SPSS print """" true true false true false true https://en.wikipedia.org/wiki/SPSS 14 5 https://hopl.info/showlanguage.prx?exp=240 SPSS 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 spss developer spss 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 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 ocaml OCaml 1996 Xavier Leroy 69 pl http://ocaml.org 53 https://ocaml.org/blog https://ocaml.org/releases 68 6 25023 2294 true 57 ace atomspace austral bamboo bucklescript caml caramel catala ccl cir cloc comby coq datafun dedukti eff elpi fact-lang felix flow flow9 fstar gintonic haxe hazel hhvm intuitionistic juvix koka ligo ligo linearml links-programming-language mal menhir michelson mlscript neko nqc opa opam-pm psyche pygments ragel ramen reason reason reko-decompiler rescript satysfi silk sill skip slick smpl vale-assembly xs-lang pl 3634 5622 27376 6 "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""" ocaml ocamlrun ocamlscript ocaml mllike text/x-ocaml source.ocaml programming false o/OCaml.ml 241 2005 2015 10 11 23394 87 ml.py 2000 1996 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 opengl hack php ios android coq wasm haskell 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. 2002 424 445 886 39652 Inria ml mli ml eliom eliomi ml4 mli mll mly ml ml mli mll mly ml mli true 3341 0 https://exercism.org/tracks/ocaml 131 1 eliom eliomi ml ml4 mli mll mly false https://tio.run/#ocaml https://ocaml.org/docs https://devdocs.io/ocaml/ https://opam.ocaml.org/doc/FAQ.html text OCaml http://www.rosettacode.org/wiki/Category:OCaml https://opam.ocaml.org/ ocaml France OCaml let square x = x * x "(* Hello World in OCaml *) print_string ""Hello World!\n"";;" "print_string ""Hello World\n""" (* * Copyright (c) 2013 Jeremy Yallop. * * This file is distributed under the terms of the MIT License. * See the file LICENSE for details. *) let string_of format v = let buf = Buffer.create 100 in let fmt = Format.formatter_of_buffer buf in begin format fmt v; Format.pp_print_flush fmt (); Buffer.contents buf end OCaml https://riju.codes/ocaml ";; print_string ""Hello, world!\n"" " https://twitter.com/ocamllang fun x_1 -> (x_1 * let y_3 = let y_2 = (x_1 * 1) in (y_2 * y_2) in (y_3 * y_3)) OCaml OCaml 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 https://www.meetup.com/topics/ocaml-programming (* *) print_string true false true true false true true true true true true true false true true true true true false true true false true true https://github.com/akabe/ocaml-jupyter https://en.wikipedia.org/wiki/OCaml 11 14 https://hopl.info/showlanguage.prx?exp=2294 OCaml ocaml.org OCaml https://github.com/textmate/ocaml.tmbundle 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 OCaml 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 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 llvmir LLVM IR 2003 Chris Lattner 35 ir http://llvm.org/docs/LangRef.html 24 https://blog.llvm.org/tags/llvm-ir/ https://releases.llvm.org/14.0.0/docs/ReleaseNotes.html https://releases.llvm.org/download.html 69 4 25021 true 29 cir cir cloc dlvm emscripten firrtl flex halide hhvm invokator julia kotlin lfortran mlir mojo neeilang oopsilon pony reko-decompiler rhine rust-mir simit sixten souper swift-il swift tensorflow triton xla ir 1263 1345 1351 2 "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.""" text source.llvm programming false l/LLVM.ll llvm asm.py 2000 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 "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 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." 2004 693 252 692 654611 https://github.com/llvm ll ll ll true 5812 23 37 1 ll https://tio.run/#llvm https://llvm.org/docs/LangRef.html https://discourse.llvm.org/t/llvm-community-events-calendar/63237 https://llvm.org/docs/FAQ.html text https://github.com/antlr/grammars-v4/tree/master/llvm-ir LLVM asm llvm Various define i32 @square(i32) local_unnamed_addr #0 { %2 = mul nsw i32 %0, %0 ret i32 %2 } "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"" @.str = internal constant [12 x i8] c""Hello World\00"" ; puts from libc declare i32 @puts(i8*) define i32 @main(...) { call i32 @puts(i8* getelementptr([12 x i8]* @.str, i32 0, i32 0)) ret i32 0 } " LLVM https://riju.codes/llvm "@.str = private unnamed_addr constant [13 x i8] c""Hello, world!"" declare i32 @puts(i8* nocapture) nounwind define i32 @main() { %cast210 = getelementptr [13 x i8],[13 x i8]* @.str, i64 0, i64 0 call i32 @puts(i8* %cast210) ret i32 0 } " "@.str = internal constant [14 x i8] c""hello, world\0A\00"" declare i32 @printf(i8*, ...) define i32 @main(i32 %argc, i8** %argv) nounwind { entry: %tmp1 = getelementptr [14 x i8], [14 x i8]* @.str, i32 0, i32 0 %tmp2 = call i32 (i8*, ...) @printf( i8* %tmp1 ) nounwind ret i32 0 }" LLVM LLVM IR ; true true false https://en.wikipedia.org/wiki/LLVM 0 0 LLVM LLVM llvm f-sharp F# 2005 Don Syme 74 pl http://fsharp.org 19 https://github.com/dotnet/fsharp/blob/main/release-notes.md 70 6 25019 3716 true 19 ace blech cloc corescript dafny fstar gforth jsil-compiler juniper mal preforth pygments r3 reforth roslyn-compiler spiral tao3d vale-assembly wonkey pl 3845 5877 2 "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#""" fsharp text mllike text/x-fsharp source.fsharp programming false f/FSharp.fs 347 2015 2017 8 6 37224 128 fsharp dotnet.py 2005 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. 2003 619 429 714 239964 Microsoft fs fsi fsx fsscript fs fsi fsx fs fs fsi fs fsi fsx fsscript true 4316 0 https://exercism.org/tracks/f-sharp 185 1 fsi fs fs false https://learn.microsoft.com/en-us/dotnet/fsharp/ https://forums.fsharp.org/ text fsharp F# https://repl.it/languages/fsharp https://www.nuget.org/ fsharp United Kingdom F# https://docs.microsoft.com/en-us/dotnet/fsharp/language-reference/index module Program let square num = num * num "(* Hello World in F# *) printf ""Hello World!\n""" "printfn ""Hello World"" " "module Sample open System type Foo = { Bar : string } type Baz = interface end let Sample1(xs : int list) : string = xs |> List.map (fun x -> string x) |> String.concat "","" " F# https://riju.codes/fsharp "printfn ""Hello, world!"" " "/// A simple prime number detector let isPrime (n:int) = let bound = int (sqrt (float n)) seq {2 .. bound} |> Seq.forall (fun x -> n % x <> 0) // We are using async workflows let primeAsync n = async { return (n, isPrime n) } /// Return primes between m and n using multiple threads let primes m n = seq {m .. n} |> Seq.map primeAsync |> Async.Parallel |> Async.RunSynchronously |> Array.filter snd |> Array.map fst // Run a test primes 1000000 1002000 |> Array.iter (printfn ""%d"")" FSharp F# 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 https://www.meetup.com/topics/f-programming // (* *) printfn """" true false true true true false true true true true true true true true true true true true true true true true true true true true true true https://github.com/fsprojects/IfSharp https://en.wikipedia.org/wiki/F_Sharp_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=3716 F# fsharp.org F# https://github.com/fsprojects/atom-fsharp F# gleam Gleam 2016 Louis Pilfold 42 pl https://gleam.run/ 3 v1.2.0-rc1 71 1 16 25013 true 3 cloc eyg gleam https://github.com/lpil/gleam pl 2 2 104 text source.gleam programming 2016 2024 2016 88 704 16825 145 false 2016 2025 8418 310 2845 21 234898 https://tour.gleam.run/ 2019 Gleam is a statically typed functional programming language for building scalable concurrent systems. It compiles to Erlang and has straightforward interop with other BEAM languages such as Erlang, Elixir and LFE. Gleam is a statically typed functional programming language for building scalable concurrent systems. It compiles to Erlang and has straightforward interop with other BEAM languages such as Erlang, Elixir and LFE. https://github.com/gleam-lang Gleam is a statically typed functional programming language for building scalable concurrent systems. It compiles to Erlang and has straightforward interop with other BEAM languages such as Erlang, Elixir and LFE. gleam gleam rust gleam toml markdown javascript dockerfile erlang make yaml bourne-shell css html elixir powershell json typescript erlang javascript true 21849 0 https://exercism.org/tracks/gleam 63 alpaca 1 true 1 true gleam https://gleam.run/documentation/ United States and United Kingdom https://news.ycombinator.com/item?id=22902462 "import gleam/io pub fn main() { io.println(""hello, friend!"") }" https://discord.gg/Fm8Pwmy https://www.reddit.com/r/gleamlang/ https://twitter.com/gleamlang https://github.com/lpil/gleam true true true true true true true true true true false true true true 0 0 gleam.run Gleam Gleam hcl HCL 2014 35 dataNotation 16 v2.20.1 72 2 10 25011 true 16 ace cloc dgraph ecl edgedb haxelibs-pm hcl hotcocoalisp ko m3db michelson minidsdb netbeans-editor nomad smpl wing https://github.com/hashicorp/hcl dataNotation 2307 2995 180390 6 "author name avatar url language languageColor stars forks currentPeriodStars description\nterraform-google-modules terraform-google-kubernetes-engine https://github.com/terraform-google-modules.png https://github.com/terraform-google-modules/terraform-google-kubernetes-engine HCL #ccc 146 113 18 ""A Terraform module for configuring GKE clusters.""\nhashicorp terraform-guides https://github.com/hashicorp.png https://github.com/hashicorp/terraform-guides HCL #ccc 413 279 28 ""Example usage of HashiCorp Terraform""\nbrikis98 terraform-up-and-running-code https://github.com/brikis98.png https://github.com/brikis98/terraform-up-and-running-code HCL #ccc 767 451 41 ""Code samples for the book """"Terraform: Up & Running"""" by Yevgeniy Brikman""\nterraform-aws-modules terraform-aws-eks https://github.com/terraform-aws-modules.png https://github.com/terraform-aws-modules/terraform-aws-eks HCL #ccc 660 480 44 ""A Terraform module to create an Elastic Kubernetes (EKS) cluster and associated worker instances on AWS.""\nterraform-aws-modules terraform-aws-vpc https://github.com/terraform-aws-modules.png https://github.com/terraform-aws-modules/terraform-aws-vpc HCL #ccc 770 732 32 ""Terraform module which creates VPC resources on AWS""" HashiCorp Configuration Language or terraform ruby ruby text/x-ruby source.terraform programming 2014 2024 2014 367 585 5192 208 false 58 2015 2018 5 16 HashiCorp configuration language 2014 2025 1635 111 367 4 10611 HCL (HashiCorp Configuration Language) is a configuration language built by HashiCorp. The goal of HCL is to build a structured configuration language that is both human and machine friendly for use with command-line tools, but specifically targeted towards DevOps tools, servers, etc. HCL is also fully JSON compatible. That is, JSON can be used as completely valid input to a system expecting HCL. This helps makes systems interoperable with other systems. HCL is heavily inspired by libucl, nginx configuration, and others similar. HCL (HashiCorp Configuration Language) is a configuration language built by HashiCorp. The goal of HCL is to build a structured configuration language that is both human and machine friendly for use with command-line tools, but specifically targeted towards DevOps tools, servers, etc. HCL is also fully JSON compatible. That is, JSON can be used as completely valid input to a system expecting HCL. This helps makes systems interoperable with other systems. HCL is heavily inspired by libucl, nginx configuration, and others similar. HashiCorp HCL (HashiCorp Configuration Language) is a configuration language built by HashiCorp. The goal of HCL is to build a structured configuration language that is both human and machine friendly for use with command-line tools, but specifically targeted towards DevOps tools, servers, etc. HCL is also fully JSON compatible. That is, JSON can be used as completely valid input to a system expecting HCL. This helps makes systems interoperable with other systems. HCL is heavily inspired by libucl, nginx configuration, and others similar. hcl nomad tf tfvars workflow go hcl markdown json restructuredtext make bourne-shell yaml ruby python true 7259 0 75 true 2 true hcl nomad tf tfvars https://developer.hashicorp.com/terraform/language/syntax/configuration text https://github.com/antlr/grammars-v4/tree/master/terraform hcl "variable ""ami"" { description = ""the AMI to use"" } < String greet name = ""Hello, "" <> name <> ""!"" main = log (greet ""World"")" "module Main where import Debug.Trace main = trace ""Hello World"" " module Control.Arrow where import Data.Tuple class Arrow a where arr :: forall b c. (b -> c) -> a b c first :: forall b c d. a b c -> a (Tuple b d) (Tuple c d) instance arrowFunction :: Arrow (->) where arr f = f first f (Tuple b d) = Tuple (f b) d second :: forall a b c d. (Category a, Arrow a) => a b c -> a (Tuple d b) (Tuple d c) second f = arr swap >>> first f >>> arr swap swap :: forall a b. Tuple a b -> Tuple b a swap (Tuple x y) = Tuple y x infixr 3 *** infixr 3 &&& (***) :: forall a b b' c c'. (Category a, Arrow a) => a b c -> a b' c' -> a (Tuple b b') (Tuple c c') (***) f g = first f >>> second g (&&&) :: forall a b b' c c'. (Category a, Arrow a) => a b c -> a b c' -> a b (Tuple c c') (&&&) f g = arr (\b -> Tuple b b) >>> (f *** g) class ArrowZero a where zeroArrow :: forall b c. a b c infixr 5 <+> class ArrowPlus a where (<+>) :: forall b c. a b c -> a b c -> a b c https://twitter.com/purescript PureScript https://github.com/nwolverson/purescript-language-server https://github.com/purescript/purescript -- {- -} """" true true true true true true https://github.com/Eoksni/ipurescript https://en.wikipedia.org/wiki/PureScript 0 0 PureScript https://github.com/purescript-contrib/atom-language-purescript 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 PureScript haml HAML 2006 Hampton Lintorn-Catlin 37 template http://haml.info/ 6 v6.3.0 76 4 9 24930 true 10 ace cloc csvw haml mastodon particles particles scroll speedie txtzyme https://github.com/haml/haml template 390 465 323 0 haml haml text/x-haml text.haml markup 2008 2024 2006 81 571 3750 11 false h/Haml.haml 171 2014 2018 2 29 HTML Abstraction Markup Language html.py 2006 2024 6804 225 209 12 21005 https://haml-multiline--pftg.repl.co/ 2012 2015 ruby html php asp java-server-pages erb ascii utf-8 rails css bbcode yaml sass wml Haml (HTML Abstraction Markup Language) is a templating system that is designed to avoid writing inline code in a web document and make the HTML easy and clean. Haml gives the flexibility to have some dynamic content in HTML. Similar to other web languages like PHP, ASP, JSP and template systems like eRuby, Haml also embeds some code that gets executed during runtime and generates HTML code in order to provide some dynamic content. In order to run Haml code, files need to have .haml extension. These files are similar to .erb or eRuby files which also help to embed Ruby code while developing a web application. While parsing coding comments, Haml uses the same rules as Ruby 1.9 or later. Haml understands only ASCII compatible encodings like UTF-8 but not UTF-16 or UTF-32 because these are not compatible with ASCII. Haml can be used in command line, as a separate Ruby module, or in a Ruby on Rails application making Haml suitable for a wide range of applications. 2006 45 34 283 11674306 Unspace Interactive haml hamldeface haml haml ruby haml xhtml erb markdown yaml bash logos slim https://devhints.io/haml true 6652 0 49 1 true 6 true haml haml.deface https://haml.info/docs.html text haml Canada %section.container %h1= post.title %h2= post.subtitle .content = post.content %html %title Hello World %body %h1 Hello World %p Hello, World! Haml https://reddit.com/r/dlang " BoBlog

BoBlog

Bob's Blog

Halloween

Tuesday, October 31, 2006

Happy Halloween, glorious readers! I'm going to a party this evening... I'm very excited.

New Rails Templating Engine

Friday, August 11, 2006

There's a very cool new Templating Engine out for Ruby on Rails. It's called Haml.

All content copyright © Bob

" Haml https://github.com/haml/haml -# false true true true https://en.wikipedia.org/wiki/Haml 2 0 haml.info Haml https://github.com/ezekg/language-haml year|publisher|title|authors|isbn13\n2013-09-25|Packt Publishing|Instant Haml|Krzysztof Niksinskiis|9781783283781 Haml title|year|author|goodreadsId|rating|ratings|reviews\nHTML: Hypertext Markup Language, Cascading Style Sheets, Dynamic HTML, Extensible Hypertext Markup Language, Html5, Haml, Webfarbe|2010|Books LLC|14640226|5.00|2|0 svg SVG 2001 24 textMarkup 356 77 3 24929 true 358 abs ace activity-pub aframe alumina apache-hbase argdown arkscript arquero arrow-format assemblyscript asterius-compiler atomspace avail avi-synth ballerina bazel bee bicep bitsy blender-app blockml bosque bounce-lang bqn bucklescript capn-proto caramel carbon carp cat catala chaiscript chatterbot chika chisel chrysalisp cir cito civet clash clay cloc clojurescript codeql coffeescript conan-pm concise-encoding concurr cor couchdb crmsh cryptol crystal cspydr csvw cwerg d3 dafny dak datascript deno dexvis dhall djangoql dplyr drupal dynamo-visual-language ec ecl ecr edgedb eff eiffel elvish elymas emscripten enso erg erlang f-prime factor felix firrtl fleck flix flow flow9 flowchart-fun flutter flux forest-lang frege fstar futhark g-fu gerbil ggplot2 ghc gintonic gogs-editor gradle gridstudio-editor hacspec haxelibs-pm hazel hedy heron-lang hhvm hjson homebrew-pm hoot-smalltalk horse64 hrqr htmx huginn hurl hy hyperscript-lang ibis icarus idris idyll imba imhex impala infusion-framework insitux invokator iterm2 ixml janet jasmine java jeeves jekyll jinja jq jquery jsoncanvas jsonnet julia juvix kaffeine kakoune-editor katex kdl kitlang ko kode koka koto ktexteditor-editor kubernetes kumir ladybird latino leo-editor lesma lever lfortran ligo lila-lang link linux literate-coffeescript livr lobster loci luna lux m3db mal mangle manhood manim marko markwhen marp mastodon mathics matplotlib mdx melody mermaid mgmt michelson micro-editor microblocks micropython mimium minidsdb minizinc mirth mobl-lang mochajs monaco mongodb moya mps mun-lang mys nearley netbeans-editor neut nextflow ngs nit nodejs nomnoml nulan numba observable-plot obsidian-lang oden ohayo onnx oopsilon opa opencv openscad openverse p-star p packagist-pm pan pandas paraview parsers particles passerine penrose pest phel pkl please-build polymath pomsky popr postgresql powershell praat-script prettier prismjs project-mentat prometheus prql psvg psvg pyret-lang pyret pyth python pytorch qore quint r4 rakudo ramen rant reach react-native reactjs redis rescript revolution-programming-language rio rita rmarkdown robotframework roc rocksdb rust rye sagemath saltstack sanddance satysfi scikit-learn scipy score scryer semver shen shml sile simoji skip slony snowman-decompiler solid-network solidity son sqrl stacklang statsplorer sugar sugarss surrealdb svelte svgbob swallow sympy tablam tangledown tao-lang tao3d tensorflow textadept-editor threejs tibet tiledb tiscript tldr tldraw toml toontalk tosh treesheets triton twine twtxt uiua ultralisp-pm v v8 vega vega vimwiki vine visdown vlc vsxu vyper wasmer wasp-lang wax web3js wenyan wing wiredtiger wlambda wonkey wren wyvern xarray xgboost-model xgboost xidoc xla xlwings-editor xodio xtext yang yara yess yggdrasil yii textMarkup 27 0 xml xml text/xml text.xml.svg data false s/SVG.svg 97 2004 2018 12 Scalable Vector Graphics 2011 xml css javascript pdf synchronized-multimedia-integration-language gzip url html android dxf gnuplot vml 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. 2001 1237 34348 2645 27751 W3C svg svg true 6405 0 28 SVG svg https://developer.mozilla.org/en-US/docs/Web/SVG text " " " " " " SVG true false true false https://en.wikipedia.org/wiki/Scalable_Vector_Graphics 21 4 https://github.com/textmate/xml.tmbundle 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 SVG svg developer 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 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 git Git 2005 Linus Torvalds Junio Hamano 27 versionControlApplication https://git-scm.com 0 https://github.com/git/git/tree/master/Documentation/RelNotes v2.45.1 78 1 23 24928 false 1 sourcetree https://github.com/git/git versionControlApplication 2008 2024 2402 25374 51231 188 false 23696 102 global information tracker Software Freedom Conservancy 2005 2025 79358 2293 4621 270 879031 2008 2005 c perl tcl python linux ia-32 mercurial http ftp subversion Git () is a version control system for tracking changes in computer files and coordinating work on those files among multiple people. It is primarily used for source code management in software development, but it can be used to keep track of changes in any set of files. As a distributed revision control system it is aimed at speed, data integrity, and support for distributed, non-linear workflows. Git was created by Linus Torvalds in 2005 for development of the Linux kernel, with other kernel developers contributing to its initial development. Its current maintainer since 2005 is Junio Hamano. As with most other distributed version control systems, and unlike most client–server systems, every Git directory on every computer is a full-fledged repository with complete history and full version tracking abilities, independent of network access or a central server. Git is free software distributed under the terms of the GNU General Public License version 2. 2005 2205 286 2277 1771747 https://github.com/git/ bourne-shell c perl tcl diff make markdown asp.net yaml javascript xslt go python bash m4 css xml lisp cmake z-shell c-shell ruby rescript https://training.github.com/downloads/github-git-cheat-sheet.pdf https://training.github.com/ true 843847 7032 53 https://web.libera.chat/#git-devel 1 false 2 true https://git-scm.com/doc https://git-scm.com/book/en/v2 text Various "The name ""git"" was given by Linus Torvalds when he wrote the very first version. He described the tool as ""the stupid content tracker"" and the name as (depending on your way): - random three-letter combination that is pronounceable, and not actually used by any common UNIX command. The fact that it is a mispronunciation of ""get"" may or may not be relevant. - stupid. contemptible and despicable. simple. Take your pick from the dictionary of slang. - ""global information tracker"": you're in a good mood, and it actually works for you. Angels sing, and a light suddenly fills the room. - ""goddamn idiotic truckload of shit"": when it breaks" https://www.youtube.com/watch?v=RnCC4U-K300 https://github.com/git/git https://www.meetup.com/topics/git https://en.wikipedia.org/wiki/Git 0 0 git-scm.com git tcl Tcl 1988 John Ousterhout 51 pl http://www.tcl.tk 20 https://www.tcl.tk/software/tcltk/whatsnew.tml http://www.tcl.tk/software/tcltk/relnotes/index.tml?sc_format=wider 79 5 24920 true 23 ace berkeleydb chicken clash cloc cmake dern drakon duro git hecl invokator mal mongodb opal redis spatial sqlite srt th1 tk v wiredtiger pl 7067 8111 owh starfield 13969 0 tclsh wish tcl tcl text/x-tcl source.tcl programming false t/Tcl.tcl 56 2005 2013 2 4 Tool Command Language Tcl/Tk tcl.py 1988 awk lisp php tea powershell c python expect unicode regex java unix linux bourne-shell xotcl snit verilog vhdl udp mysql postgresql sqlite "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." 2001 567 938 944 39880682 tcl tbc tcl adp tclin tm tcl tcl rvt tcl tbc http://pldb.info/blog/JohnOusterhout.html true 3106 0 https://exercism.org/tracks/tcl 57 tk 1 false https://tio.run/#tcl https://www.tcl.tk/doc/ https://devdocs.io/tcl_tk/ text tcl tcl Tcl http://www.rosettacode.org/wiki/Category:Tcl tcl Tcl https://www.tcl.tk/about/history.html "#!/usr/local/bin/tclsh # Hello World in Tcl puts ""Hello World!"" " "puts ""Hello World""" "# XDG Base Directory Specification handling # # Copyright (C) 2013 Lawrence Woodman # # Licensed under an MIT licence. Please see LICENCE.md for details. # # For XDG Base Directory Specification # http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html # package require Tcl 8.5 namespace eval XDG { variable DEFAULTS """" namespace export DATA_HOME CONFIG_HOME CACHE_HOME namespace export RUNTIME_DIR DATA_DIRS CONFIG_DIRS } proc XDG::SetDefaults {} { variable DEFAULTS if {$DEFAULTS ne """"} return set DEFAULTS [list \ DATA_HOME [file join $::env(HOME) .local share] \ CONFIG_HOME [file join $::env(HOME) .config] \ CACHE_HOME [file join $::env(HOME) .cache] \ DATA_DIRS [list [file join /usr local share] [file join /usr share]] \ CONFIG_DIRS [list [file join /etc xdg ]] ] } proc XDG::XDGVarSet {var} { expr {[info exists ::env(XDG_$var)] && $::env(XDG_$var) ne """"} } proc XDG::Dir {var {subdir """"} } { variable DEFAULTS SetDefaults set dir [dict get $DEFAULTS $var] if {[XDGVarSet $var]} { set dir $::env(XDG_$var) } return [file join $dir $subdir] } proc XDG::Dirs {var {subdir """"} } { variable DEFAULTS SetDefaults set rawDirs [dict get $DEFAULTS $var] if {[XDGVarSet $var]} { set rawDirs [split $::env(XDG_$var) "":""] } set outDirs {} foreach dir $rawDirs { lappend outDirs [file join $dir $subdir] } return $outDirs } # The remaining procs reference the environmental variables XDG_ # followed by the proc name. proc XDG::DATA_HOME {{subdir """"}} {Dir DATA_HOME $subdir} proc XDG::CONFIG_HOME {{subdir """"}} {Dir CONFIG_HOME $subdir} proc XDG::CACHE_HOME {{subdir """"}} {Dir CACHE_HOME $subdir} proc XDG::RUNTIME_DIR {{subdir """"}} { if {![XDGVarSet RUNTIME_DIR]} { return {} } return [file join $::env(XDG_RUNTIME_DIR) $subdir] } # The following procs returning the directories as a list with the most # important first. proc XDG::DATA_DIRS {{subdir """"}} {Dirs DATA_DIRS $subdir} proc XDG::CONFIG_DIRS {{subdir """"}} {Dirs CONFIG_DIRS $subdir} " Tcl https://www.reddit.com/r/Tcl/ https://riju.codes/tcl puts {Hello, world!} "oo::class create fruit { method eat {} { puts ""yummy!"" } } oo::class create banana { superclass fruit constructor {} { my variable peeled set peeled 0 } method peel {} { my variable peeled set peeled 1 puts ""skin now off"" } method edible? {} { my variable peeled return $peeled } method eat {} { if {![my edible?]} { my peel } next } } set b [banana new] $b eat → prints ""skin now off"" and ""yummy!"" fruit destroy $b eat → error ""unknown command""" Tcl # puts """" false true true false true false true https://github.com/rpep/tcl_kernel https://en.wikipedia.org/wiki/Tcl 26 2 Tcl tcl.tk Tcl https://github.com/textmate/tcl.tmbundle 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 Tcl 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 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 liquid Liquid 2008 Tobias Lütke 27 template https://shopify.github.io/liquid/ 5 v5.5.0 80 1 4 24918 true 5 11ty ace liquid mochajs pygments https://github.com/Shopify/liquid template 947 1018 11459 2 "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.""" liquid text.html.liquid markup 2008 2024 2008 774 1372 10950 355 false 2 2010 2015 2 2 templates.py 2008 2025 2704 240 195 7 21576 https://github.com/Shopify liquid liquid ruby liquid yaml markdown true 15508 325 34 1 true 5 true liquid https://shopify.dev/api/liquid text 3533 liquid Canada "
We have wonderful products!

{% for image in product.images %} {% if forloop.first %} {% else %} {% endif %} {% endfor %}

{{ product.title }}

Vendor: {{ product.vendor | link_to_vendor }}

Type: {{ product.type | link_to_type }}

{{ product.price_min | money }}{% if product.price_varies %} - {{ product.price_max | money }}{% endif %}

{{ product.description }}

" liquid https://github.com/Shopify/liquid true false true 2 15 Liquid https://github.com/bastilian/validcode-textmate-bundles 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 Liquid liquid engineer 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 vhdl VHDL 1983 45 hardwareDescriptionLanguage 5 81 4 24916 1188 true 5 ace invokator mal pygments spatial hardwareDescriptionLanguage 1748 2099 34211 2 "author name avatar url language languageColor stars forks currentPeriodStars description\nghdl ghdl https://github.com/ghdl.png https://github.com/ghdl/ghdl VHDL #adb2cb 777 147 24 ""VHDL 2008/93/87 simulator""" vhdl vhdl text/x-vhdl source.vhdl programming false v/VHDL.vhdl 23 2008 2017 1 2 VHSIC Hardware Description Language hdl.py 44 1980 verilog ada pascal vhdl-ams property-specification-language isbn VHDL (VHSIC Hardware Description Language) is a hardware description language used in electronic design automation to describe digital and mixed-signal systems such as field-programmable gate arrays and integrated circuits. VHDL can also be used as a general purpose parallel programming language. 2002 731 548 893 43410 vhdl vhd vhf vhi vho vhs vht vhw vhdl vhdl vhd rust 6245 0 155 VHD vhd VHDL vhdl vhf vhi vho vhs vht vhw https://vhdlguide.readthedocs.io/en/latest/ text https://github.com/antlr/grammars-v4/tree/master/vhdl/vhdl vhdl http://www.rosettacode.org/wiki/Category:VHDL United States "--Hello World in VHDL ENTITY helloworld IS END helloworld; ARCHITECTURE hw OF helloworld IS BEGIN ASSERT FALSE REPORT ""HELLO, WORLD!"" SEVERITY NOTE; END hw; " "use std.textio.all; entity hello_world is end hello_world; architecture behaviour of hello_world is begin process begin write (output, String'(""Hello World"")); wait; end process; end behaviour;" -- VHDL example file library ieee; use ieee.std_logic_1164.all; entity inverter is port(a : in std_logic; b : out std_logic); end entity; architecture rtl of inverter is begin b <= not a; end architecture; vhdl https://reddit.com/r/VHDL process begin wait until START = '1'; -- wait until START is high for i in 1 to 10 loop -- then wait for a few clock periods... wait until rising_edge(CLK); end loop; for i in 1 to 10 loop -- write numbers 1 to 10 to DATA, 1 every cycle DATA <= to_unsigned(i, 8); wait until rising_edge(CLK); end loop; -- wait until the output changes wait on RESULT; -- now raise ACK for clock period ACK <= '1'; wait until rising_edge(CLK); ACK <= '0'; -- and so on... end process; VHDL https://github.com/kraigher/rust_hdl abs access after alias all and architecture array assert attribute begin block body buffer bus case component configuration constant disconnect downto else elsif end entity exit file for function generate generic group guarded if impure in inertial inout is label library linkage literal loop map mod nand new next nor not null of on open or others out package port postponed procedure process pure range record register reject rem report return rol ror select severity signal shared sla sll sra srl subtype then to transport type unaffected units until use variable wait when while with xnor xor -- write """" true true true true true true true true true false true true false true true https://en.wikipedia.org/wiki/VHDL 50 39 https://hopl.info/showlanguage.prx?exp=1188 VHDL VHDL https://github.com/textmate/vhdl.tmbundle year|publisher|title|authors|isbn13\n2002|Prentice Hall|Digital Fundamentals with VHDL|Floyd, Thomas L.|9780130995278\n2007|Cengage Learning|Digital Systems Design Using VHDL|Roth, Jr. Charles H. and John, Lizy K.|9780534384623\n2008|Pearson|VHDL for Engineers|Short, Kenneth|9780131424784\n1993|Mcgraw-hill Inc|Vhdl Edition (Computer Engineering Series)|Perry, Douglas|9780070494343\n2005|Charles River Media|HDL Programming Fundamentals: VHDL and Verilog (DaVinci Engineering)|Botros, Nazeih M|9781584508557\n2000|Prentice Hall|VHDL Design Representation and Synthesis (2nd Edition)|Armstrong, James R. and Gray, F. Gail|9780130216700\n1992|Springer|VHDL for Simulation, Synthesis and Formal Proofs of Hardware (The Springer International Series in Engineering and Computer Science, 183)||9780792392538\n2002|Prentice Hall|Digital Logic Simulation And Cpld Programming With Vhdl|Steve Waterman|9780130967602\n2000|Wiley, John & Sons, Incorporated|The VHDL Reference: A Practical Guide to Computer-Aided Integrated Circuit Design including VHDL-AMS|Ulrich Heinkel and Werner Haas and Martin Padeffke and Thomas Buerner and Herbert Braisz|9780471899723\n2017|McGraw-Hill Education|Digital System Design with FPGA: Implementation Using Verilog and VHDL|Unsalan, Cem and Tar, Bora|9781259837913\n2010|Morgan Kaufmann|The Designer's Guide to VHDL (ISSN)|Ashenden, Peter J.|9780080568850\n1999|Wiley-IEEE Computer Society Pr|Digital Systems Design with VHDL and Synthesis: An Integrated Approach|Chang, K. C.|9780769500232\n2002|McGraw-Hill Education|VHDL : Programming By Example|Perry, Douglas|9780071400701\n2008|McGraw-Hill College|Fundamentals of Digital Logic with VHDL Design|Brown, Stephen D.|9780073529530\n2008|Morgan Kaufmann|Digital Electronics and Design with VHDL|Pedroni, Volnei A.|9780080557557\n2018|Springer|A Tutorial Introduction to VHDL Programming|Gazi, Orhan|9789811323096\n2007|Morgan Kaufmann|VHDL 2008: Just the New Stuff (Systems on Silicon)|Ashenden, Peter J. and Lewis, Jim|9780123742490\n2003|Pearson|Digital System Design with VHDL (2nd Edition)|Zwolinski, Mark|9780130399854\n2008|Morgan Kaufmann|Digital Electronics and Design with VHDL|Pedroni Ph.D. California Institute of Technology; former visiting Professor Harvey Mudd College, Volnei A.|9780123742704\n1997|Prentice Hall|Vhdl Starter's Guide|Yalamanchili, Sudhakar|9780135198025\n2018|Springer|A Tutorial Introduction to VHDL Programming|Gazi, Orhan|9789811323089\n2011|Wiley|Introduction to Digital Systems: Modeling, Synthesis, and Simulation Using VHDL|Ferdjallah, Mohammed|9780470900550\n1708|Wiley India Private Limited|HDL Programming Fundamentals: VHDL and Verilog, w/CD|NAZEIH M.BOTROS|9788177226973\n1998|Wiley|VHDL for Logic Synthesis|Rushton, Andrew|9780471983255\n2000|Prentice Hall|Digital System Design and VHDL|Zwolinski, Mark|9780201360639\n2016|LAP LAMBERT Academic Publishing|Design of a Data Analyser for Ethernet Packets Using VHDL: Analysis and Representation of Ethernet Communication Protocol Using Finite State Machines with VHDL Programming|Gooroochurn, Mahendra|9783659826948\n2012|Springer|VHDL and FPLDs in Digital Systems Design, Prototyping and Customization|Salcic, Zoran|9781461376712\n2019|Springer|A Tutorial Introduction to VHDL Programming|Gazi, Orhan|9789811347641\n2021|Cengage Learning|HDL Programming Fundamentals: VHDL and Verilog (Davinci Engineering)|Botros|9788131502013\n|John Wiley & Sons Inc|Vhdl Programming|L. Baker|9780471574125\n2019-07-24|LAP LAMBERT Academic Publishing|VHDL Programming|Syed Zaheeruddin and Baddiri Narsimha and Pudari Chiranjeevi|9783659753756\n20130128|De Gruyter|Kompaktkurs VHDL|Paul Molitor; Jörg Ritter|9783486719659\n20180611|De Gruyter|Prozessorentwurf mit VHDL|Dieter Wecker|9783110582833\n2011|Pearson Higher Ed|Vhdl For Engineers|Kenneth L. Short|9780133002560\n2010|Springer|A Guide To Vhdl|Patricia Langstraat; Stanley Mazor|9780792393870\n2001|Prentice Hall|Digital Electronics With Vhdl Programming|Brian Hemmelman|9780130867513\n2001|Elsevier|The Designer's Guide To Vhdl|Peter J. Ashenden|9780080477152\n20070330|Cengage Learning US|Digital Systems Design Using VHDL|Charles H. Roth, Jr.; Lizy K. John|9781305325098\n2018-08-18|Springer|A Tutorial Introduction to VHDL Programming|Orhan Gazi|9789811323096\n2020|Emereo|VHDL A Complete Guide - 2021 Edition|Gerardus Blokdyk|9781867469490\n2019-03-10|LAP LAMBERT Academic Publishing|VHDL based automated solar panel intensity controller|Beenish Habib and Rameesa Mufti|9786139460755\n03/2015|Mercury Learning and Information|HDL with Digital Design VHDL and Verilog|Nazeih Botros|9781942270287\n01/2012|McGraw-Hill Higher Education (US)|Fundamentals of Digital and Computer Design with VHDL|Sandige, Richard; Sandige, Michael|9780077418779\n1993|Wiley|Vhdl Programming With Advanced Topics (wiley Professional Computing)|Louis Baker|9780471574644\n2012|Springer-Verlag New York, LLC|Formal Semantics and Proof Techniques for Optimizing VHDL Models|Kothanda Umamageswaran and Sheetanshu L. Pandey and Philip A. Wilsey|9781461373315\n1998|Not Avail|Contemporary Logic Design 32703 And Vhdl For Programming Logic Package|Katz|9780201308624\n2002||Design Automation. Behavioural Languages. Vhdl Multilogic System For Model Interoperability|British Standards Institute Staff|9780580392665 VHDL year|title|doi|citations|influentialCitations|authors|paperId\n2000|HML, a novel hardware description language and its translation to VHDL|10.1109/92.820756|53|5|Yanbing Li and M. Leeser|d171064b70be10228ba7e60166178338eca52e33\n1992|A Guide to VHDL|10.1007/978-1-4757-2114-0|48|2|S. Mazor and Patricia Langstraat|bc6cb7714dd879a58faaf0fc43b0afa6a25ee747\n1995|HML: an innovative hardware description language and its translation to VHDL|10.1109/ASPDAC.1995.486388|36|6|Yanbing Li and M. Leeser|5f4ae80a4ebc9b1b9220b5bbd15545b9d1e5d502\n2016|VHDL Descriptions for the FPGA Implementation of PWL-Function-Based Multi-Scroll Chaotic Oscillators|10.1371/journal.pone.0168300|26|0|E. Tlelo-Cuautle and A. Quintas-Valles and L. G. de la Fraga and J. Rangel-Magdaleno|1c0543b665dc8cc209d7aa2fa24b8e771baa0af0\n1995|A simple denotational semantics, proof theory and a validation condition generator for unit-delay VHDL|10.1007/BF01383872|22|2|Peter T. Breuer and Luis Sánchez-Fernández and C. D. Kloos|97ff0ba97f9aab90c3174a0b378d9fc254ddc1a3\n1989|A VHDL compiler based on attribute grammar methodology|10.1145/73141.74829|19|0|Rodney Farrow and A. Stanculescu|e853bf2bec84a2d6ce9fab94e926c95728d6df9a\n1997|A refinement calculus for the synthesis of verified hardware descriptions in VHDL|10.1145/262004.262007|18|1|Peter T. Breuer and C. D. Kloos and Andrés Marín López and N. M. Madrid and Luis Sánchez-Fernández|f50caba2299a8bf297514ae2905d4c42530fcaed\n2001|An educational environment for VHDL hardware description language using the WWW and specific workbench|10.1109/FIE.2001.963876|17|0|A. Etxebarria and I. Oleagordía and M. Sanchez|89b28bbfc98b8e80ca2f252a61b9308ff5e3f334\n2001|VHDL Standards|10.1109/54.953280|15|1|P. Ashenden|7c22efdebce1575636a6a95679cb7e9d2d7633ba\n2010|Fuzzy logic controller implementation on a FPGA using VHDL|10.1109/NAFIPS.2010.5548192|14|1|Davi Nunes Oliveira and Arthur Plínio De Souza Braga and Otacílio da Mota Almeida|5c673b78d1e63ac6f73f1fb15b22553283684b07\n1995|Denotational semantics of a synchronous VHDL subset|10.1007/BF01383873|11|0|D. Borrione and A. Salem|b3319c892c5b0aa69e41336736ba99dcac9f378c\n1997|Source level optimisation of VHDL for behavioural synthesis|10.1049/IP-CDT:19970631|11|1|T.P.K. Nijhar and A. D. Brown|9827364efb7a253c1a87cc62ba4afee22fa17fe4\n2003|Transformation of VHDL descriptions into DEVS models for fault modeling|10.1109/ICSMC.2003.1244575|11|0|L. Capocchi and F. Bernardi and D. Federici and P. Bisgambiglia|4bcf61f8160baf127294d5ffc953e13a860b7d49\n2010|Design and implementation of a Mamdani Fuzzy Inference System on an FPGA using VHDL|10.1109/NAFIPS.2010.5548190|10|0|Davi Nunes Oliveira and Gustavo Alves de Lima Henn and Otacílio da Mota Almeida|4ee9497b4f706152da5636a3987af3bc8e4bd3bc\n2012|Design of FPGA based 8-bit RISC controller IP core using VHDL|10.1109/INDCON.2012.6420656|10|0|R. P. Aneesh and K. Jiju|62bd019dba43b3f6b3b5cab7334d72b362504650\n2012|A plug-in to Eclipse for VHDL source codes: functionalities|10.1117/12.2005981|10|0|B. Niton and K. Pozniak and R. Romaniuk|0ba95c75ef89ebce2659c69d6f3c16ed745ea947\n1986|VHDL Critique|10.1109/MDT.1986.294917|8|0|J. Nash and Larry F. Saunders|10ba492a9ded9528ca7f5b4d6df99bce5eb0430b\n2014|VHDL implementation of IEEE 754 floating point unit|10.1109/ICICES.2014.7033999|8|1|Anjana Sasidharan and P. Nagarajan|afe2bd78298d7258f69eb1581ae6eb7e27d686d8\n1998|Application of VHDL to software radio technology|10.1109/IVC.1998.660686|7|0|J. Mccloskey|927431223f02e58668a914d55d6faa4b08e05b4e\n2009|Automatic generation of VHDL code from traditional ladder diagrams applying a model-driven engineering approach|10.1109/IECON.2009.5415234|6|0|D. Alonso and J. Suardíaz and P. Navarro and P. Alcover and J.A. Lopez|12b965d688d8e375aef891f3e2e2622ddb1c0684\n2010|C to VHDL compiler|10.1117/12.872194|6|0|Piotr P. Berdychowski and Wojciech Zabolotny|bea42052cbc824efc37434c44b6323b7534cd0f5\n2016|VHDL models e-assessment in Moodle environment|10.1109/ICETA.2016.7802048|6|0|K. Jelemenska and P. Cicak and M. Gazik|e913e62d72a68bd16d56634dbfef1d1a46eed2d6\n1997|ADVISE. Performance evaluation of parallel VHDL simulation|10.1109/SIMSYM.1997.586510|5|0|Wilco Van Hoogstraeten and H. Corporaal|619d7479d26d842136db0820e702e753c867ca60\n2013|Combining Software and Hardware Test Generation Methods to Verify VHDL Models|10.5755/j01.itc.42.4.4261|5|0|V. Jusas and Tomas Neverdauskas|c3949af30fa7264f3bd729071d4100878231c350\n2013|VHDL Design and Synthesis of 64 bit RISC Processor System on Chip (SoC)|10.9790/4200-0353142|5|1|Navneet Kaur|821c2318b84642225f7331d29696557ea593c591\n2018|Designing Digital Systems Using Cartesian Genetic Programming and VHDL|10.1007/978-3-319-67997-6_3|5|0|B. Henson and James Alfred Walker and M. Trefzer and A. Tyrrell|ba08c62f55a4419829df71ed00d91ec02bfc4379\n2006|VHDL Implementation of a (255,191) Reed Solomon Coder for DVB-H|10.1109/ISCE.2006.1689531|4|0|M. Mehnert and D.F. von Droste and D. Schiel|a84c91e63422218fbcd63c5ddcf0b7997e489fdb\n2017|FPGA implementation of RS codec with interleaver in DVB-T using VHDL|10.14419/IJET.V6I4.8205|4|0|Sara Kamar and Abdelmoniem Fouda and A. Zekry and Abdelmoniem Elmahdy|9fcc6c848e25e67caae95cd73981816adf525ac6\n1992|Incremental Design—Application of a Software-based Method for High-level Hardware Design with VHDL|10.1007/978-1-4615-3562-1_19|3|0|A. Hohl|4324a5fd9e183857e2e91c26ba378118687524c4\n1998|Modeling digital systems using VHDL|10.1109/45.666643|3|0|P. Ashenden|e3d647aeda4ca7b3e1750fdf67e375b70a6cffbc\n2017|VHDL based circuits design and synthesis on FPGA: A dice game example for education|10.1109/SIPROCESS.2017.8124575|3|0|Sarah Toonsi and Miznan G. Behri and S. Qaisar and Enas Melibari and Sarah Alolyan|ef425611ac69bf5c274d1dae140e5310dc19a901\n2004|A Small, Effective Vhdl Subset For The Digital Systems Course|10.18260/1-2--14054|2|0|P. Chu|2925c4b23f4999b7dd0f7bfb3e0785788a963be9\n2006|Design and Implementation of ARP Functionality Based on VHDL|10.1109/ITST.2006.288751|2|0|Liu Tian-hua and Zhu Hong-feng and Liu Jun and Zhou Chuan-sheng and Chang Gui-ran|d3256a02faa4ef6e74bc14d39a1c39eb29c80cd9\n2011|Diseño de un codificador y decodificador digital Reed-Solomon usando programación en VHDL|10.5377/NEXO.V21I01.393|2|0|C. Sandoval and A. Fedón|e8a949fc5db30c8c50626484b32fc063a8e486ae\n1999|Adaptive microphone array beamforming for teleconferencing using VHDL and parallel architectures|10.1109/EMPDP.1999.746639|1|0|Tony P. W. Price and D. Howard and A. Lewis and A. Tyrrell|8f65de0ae2550eaee525474b7f1715ed7c9b705e\n1991|Switch-Level Modeling in VHDL|10.1007/978-1-4615-3964-3_1|1|0|A. Stanculescu|fdd422be9e2a8914b714d3e459724cd73d6e05fe\n2013|Novel Method to Generate Tests for VHDL|10.1007/978-3-642-41947-8_31|1|0|V. Jusas and Tomas Neverdauskas|b1d27adda018659ac9677eb7ed9611680b6408cc\n2016|FBDtoVHDL: An Automatic Translation from FBD into VHDL for FPGA Development|10.5626/JOK.2016.43.5.569|1|0|Jaeyeob Kim and Eui-Sub Kim and Junbeom Yoo and Young Jun Lee and J. Choi|b0e3a7ef375095f962ecfcf7f1c604e7a1e042c4\n2018|Electronic Circuit and System Design using Python and VHDL|10.1109/ECTICON.2018.8620048|1|0|I. Grout|f502562d4a5352a7ca67872a30fb187587da7712 title|year|author|goodreadsId|rating|ratings|reviews\nHDL Programming Fundamentals: VHDL and Verilog [With CD-ROM]|2005|Nazeih M. Botros|382542|4.15|55|5\nVHDL: Programming by Example [With CDROM]|1990|Douglas L. Perry|1640016|3.36|14|1\nVHDL for Engineers|2008|Kenneth L. Short|20450098|4.00|5|0 json5 JSON5 2012 Aseem Kishore 30 dataNotation https://json5.org/ 11 2.2.3 82 2 6 24907 true 11 ace avail chevrotain cloc differential-datalog idio json5 mastodon mdx openverse prettier https://github.com/json5/json5 dataNotation 0 0 javascript javascript application/json source.js data 2012 2024 2012 88 242 6409 32 false 1133 2013 2018 2 103 2012 2024 650 29 39 2 9824 2011 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. 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. https://github.com/json5 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. json5 javascript markdown typescript json json5 yaml true 7366 0 41 json 1 true 2 true json5 https://json5.org/ text https://github.com/antlr/grammars-v4/tree/master/json5 United States "{ // comments unquoted: 'and you can quote me on that', singleQuotes: 'I can use ""double quotes"" here', lineBreaks: ""Look, Mom! \ No \\n's!"", hexadecimal: 0xdecaf, leadingDecimalPoint: .8675309, andTrailing: 8675309., positiveSign: +1, trailingComma: 'in objects', andIn: ['arrays',], ""backwardsCompatible"": ""with JSON"", }" "/* * The following is a contrived example, but it illustrates most of the features: */ { foo: 'bar', while: true, this: 'is a \ multi-line string', // this is an inline comment here: 'is another', // inline comment /* this is a block comment that continues on another line */ hex: 0xDEADbeef, half: .5, delta: +10, to: Infinity, // and beyond! finally: 'a trailing comma', oh: [ ""we shouldn't forget"", 'arrays can have', 'trailing commas too', ], }" https://github.com/json5/json5 // /* */ true true true false 0 0 json5.org https://github.com/atom/language-javascript JSON5 mongodb MongoDB 2009 Eliot Horowitz and Dwight Merriman 27 database https://www.mongodb.com/ 0 1.0.0 83 1 46 24903 false 1 wiredtiger https://github.com/mongodb/mongo database 2009 2024 2007 1244 5519 25860 82 false 2007 2025 133662 1463 46426 1132 12426793 2008 2007 c javascript linux solaris freebsd json nginx-config sql 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. 2009 1760 348 1385 21855450 https://www.mongodb.com/community/forums/ cpp javascript c python yaml idl bourne-shell markdown protobuf json starlark assembly-language cmake bazel make xml bash tex dockerfile m4 restructuredtext html pascal diff perl ini ruby meson lua css tcl toml php java objective-cpp reason swift csv jupyter-notebook powershell svg rust awk r d objective-c https://cheatsheets.zip/mongodb true 324428 3787 78 2 false 1 true https://www.mongodb.com/docs/ text https://www.reddit.com/r/mongodb https://riju.codes/mongodb db.collection.find() https://twitter.com/mongodb find findOne drop createIndex https://github.com/mongodb/mongo true true true https://en.wikipedia.org/wiki/MongoDB 2 0 mongodb.com mongodb developer and dba MongoDB 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 rescript Rescript 2020 Hongbo Zhang 28 pl https://rescript-lang.org/ 11 84 2 23 24897 true 11 bucklescript catala cloc fay git ncl nit rescript smpl ucl zl https://github.com/rescript-lang/rescript-compiler pl 52 54 1604 ocaml rust rust text/x-rustsrc source.rescript programming 2016 2024 127 448 6738 174 false r/ReScript.res 2010 2025 15058 431 6397 1874 754954 https://rescript-lang.org/try 2020 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. 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. 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. res res rescript javascript ocaml json typescript cpp markdown bourne-shell rust python make yaml asciidoc c css toml xslt lisp vim-script html dockerfile svg reason javascript true 8515 0 57 1 true res resi China "module Button = { @react.component let make = (~count: int) => { let times = switch count { | 1 => ""once"" | 2 => ""twice"" | n => Belt.Int.toString(n) ++ "" times"" } let msg = ""Click me "" ++ times } }" "Js.log(""Hello World"")" https://twitter.com/rescriptlang ReScript https://github.com/rescript-lang/rescript-compiler // Js.log """" true true true false true 0 0 rescript-lang.org ReScript ReScript idris Idris 2014 Edwin Brady 49 pl http://idris-lang.org 3 https://www.idris-lang.org/category/news.html v1.3.4 85 5 19 24886 true 3 cloc idris pygments https://github.com/idris-lang/Idris-dev pl 219 301 1895 0 text source.idris programming 2011 2024 2011 120 642 3418 708 false i/Idris.idr 24 2013 2017 1 6 haskell.py 2011 2025 10146 445 1643 40 143718 2010 2017 agda coq epigram haskell ml rust perl c javascript java jvm cil ocaml llvmir 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. 2013 123 38 109 39035048 University of St Andrews idr lidr idr lidr idr idr idr lidr idris bourne-shell haskell restructuredtext svg c make markdown yaml javascript perl xml css nix python cmake scheme bash java true 6626 1 74 1 true 1 true idr https://tio.run/#idris http://docs.idris-lang.org/en/latest/ https://docs.idris-lang.org/en/latest/faq/faq.html] text http://www.rosettacode.org/wiki/Category:Idris United Kingdom Idris "Hello world in Idris > main : IO () > main = putStrLn ""Hello, World!""" "module Main main : IO () main = putStrLn ""Hello World"" " module Prelude.Char import Builtins isUpper : Char -> Bool isUpper x = x >= 'A' && x <= 'Z' isLower : Char -> Bool isLower x = x >= 'a' && x <= 'z' isAlpha : Char -> Bool isAlpha x = isUpper x || isLower x isDigit : Char -> Bool isDigit x = (x >= '0' && x <= '9') isAlphaNum : Char -> Bool isAlphaNum x = isDigit x || isAlpha x isSpace : Char -> Bool isSpace x = x == ' ' || x == '\t' || x == '\r' || x == '\n' || x == '\f' || x == '\v' || x == '\xa0' isNL : Char -> Bool isNL x = x == '\r' || x == '\n' toUpper : Char -> Char toUpper x = if (isLower x) then (prim__intToChar (prim__charToInt x - 32)) else x toLower : Char -> Char toLower x = if (isUpper x) then (prim__intToChar (prim__charToInt x + 32)) else x isHexDigit : Char -> Bool isHexDigit x = elem (toUpper x) hexChars where hexChars : List Char hexChars = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'] Idris https://riju.codes/idris "module Main main : IO () main = putStrLn ""Hello, world!"" " https://twitter.com/idrislang total pairAdd : Num a => Vect n a -> Vect n a -> Vect n a pairAdd Nil Nil = Nil pairAdd (x :: xs) (y :: ys) = x + y :: pairAdd xs ys Idris https://github.com/idris-lang/Idris-dev -- putStrLn """" true true true true true true true false true true https://en.wikipedia.org/wiki/Idris_(programming_language) 1 8 Idris idris-lang.org Idris https://github.com/idris-hackers/idris-sublime.git year|publisher|title|authors|isbn13\n20170313|Simon & Schuster|Type-Driven Development with Idris|Edwin Brady|9781638352242 Idris idris developer 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 cmake CMake 2000 28 application https://cmake.org/ 186 86 5 50 24884 false 186 acorn-lang adept apache-hbase arkscript arrow-format atomspace avi-synth basis-universal-format bazel beef berry binaryen bio blender-app blitzmax boomerang-decompiler broccoli-1 c2 c3 calc4 capn-proto chaiscript checked-c cir clay cloc cmake codeql cone croc curv cwerg dale dern dlvm ecl eiffel elena emerald-lang emojicode emscripten f-prime fardlang fern fish flatbuffers flow9 flua flutter forthscript frost gap git glms graph-it gravity gura halide hashlink haxelibs-pm hhvm hobbes homa homebrew-pm hook huginn huwcode hyphy ibis idris imhex impala invokator ircis jakt jank jeebox jinx jsonnet koka kotlin ktexteditor-editor kumir ladybird latino lax ldpl lean lesma leveldb lfortran lift lily linux lobster loci metalang99 mewmew micropython mimium minizinc mojo mongodb monkeyx mun-lang neeilang neko never ngs nimskull ninja nodejs nuua objectscript om onnx ooc oopsilon opal open-nn open-shading-language opencv openscad p paraview pawn-scripting-language pawn pcre pony pov-ray-sdl psyche-c pygments python pytorch qore racket react-native redis reko-decompiler retdec rhine rholang ricscript rocksdb roslyn-compiler rust score seq sile simit simple-binary-encoding skip solidity sophie souper squirrel srt swi-prolog swift t2b taichi tamgu tensorflow terra textadept-editor tiledb tiscript treesheets triton ucl uno vale vcpkg-pm verona vlc vsxu wasm whack wiredtiger wonkey xgboost-model xgboost xla yasl z-flat zig https://gitlab.kitware.com/cmake/cmake application 39454 56490 CMakeLists.txt 4 "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.""" text cmake text/x-cmake source.cmake programming false c/CMake.cmake 48 2008 2015 6 7 make.py 2000 2025 69706 1984 26913 142 1561210 2001 2000 c visual-studio-editor eclipse-editor linux ninja unix falcon kicad llvmir mysql mariadb qt amqp root-lib meson qmake 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. 2006 255 90 560 4965560 Kitware, Inc cmake cmakein cmake cmake CMakeLists.txt cmake restructuredtext cpp c json bourne-shell cuda powershell bash fortran-90 qt python fortran-77 xml dockerfile java csharp swift assembly-language objective-c yaml markdown matlab objective-cpp d lex diff pascal html xaml protobuf yacc perl hlsl vim-script javascript tcl lisp css toml mumps m4 idl php ruby r make expect lua tex true 3530 0 81 true cmake cmake.in CMakeLists.txt text https://github.com/antlr/grammars-v4/tree/master/cmake cmake http://www.rosettacode.org/wiki/Category:CMake United States https://www.jetbrains.com/help/clion/cmakelists-txt-file.html project(default) add_compile_options(-Werror -Wall -Wextra -g) add_executable(output.s example.cpp) "message(""Hello World"") " "cmake_minimum_required(VERSION 2.6) enable_testing() set(CMAKE_BUILD_TYPE debug) include_directories(""/usr/local/include"") find_library(ssl_LIBRARY NAMES ssl PATHS ""/usr/local/lib"") add_custom_command(OUTPUT ""ver.c"" ""ver.h"" COMMAND ./ver.sh) add_executable(foo foo.c bar.c baz.c ver.c) target_link_libraries(foo ${ssl_LIBRARY}) " CMake https://riju.codes/cmake "message(""Hello, world!"") " CMake CMake https://gitlab.kitware.com/cmake/cmake https://en.wikipedia.org/wiki/CMake 4 0 cmake.org CMake https://github.com/textmate/cmake.tmbundle CMake 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 odin Odin 2016 Bill Hall 33 pl https://odin-lang.org/ https://odin-lang.org 4 v0.13.0 87 3 14 24883 true 4 ace cloc odin pygments https://github.com/odin-lang/Odin pl 5 6 417 odinlang or odin-lang text source.odin programming 2016 2024 2016 83 555 6235 277 false o/Odin.odin archetype.py 2016 2025 14403 518 1926 461 1087326 2017 Odin is a general-purpose programming language with distinct typing built for high performance, modern systems and data-oriented programming. Odin is a general-purpose programming language with distinct typing built for high performance, modern systems and data-oriented programming. https://github.com/odin-lang Odin is a general-purpose programming language with distinct typing built for high performance, modern systems and data-oriented programming. odin odin odin odin odin c cpp markdown make python yaml bourne-shell xml assembly-language glsl html javascript nix true 10120 0 51 1 true 0 true odin https://odin-lang.org/docs/ The Netherlands and Denmark and Sweden and United States and Germany "package main import ""core:fmt"" main :: proc() { program := ""+ + * 😃 - /""; accumulator := 0; for token in program { switch token { case '+': accumulator += 1; case '-': accumulator -= 1; case '*': accumulator *= 2; case '/': accumulator /= 2; case '😃': accumulator *= accumulator; case: // Ignore everything else } } fmt.printf(""The program \""%s\"" calculates the value %d\n"", program, accumulator); }" https://discord.com/invite/sVBPHEv "package main import ""core:fmt"" main :: proc() { fmt.println(""Hello World""); } " ODIN https://reddit.com/r/odinlang https://riju.codes/odin "package main import ""core:fmt"" main :: proc() { fmt.printf(""Hello, world!\n""); } " Odin https://github.com/odin-lang/Odin https://github.com/odin-lang/Odin // fmt.println """" true true true false true 0 2 odin-lang.org Odin Odin 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 forth Forth 1970 Charles H. Moore 45 pl 12 88 5 24873 182 true 15 ace cloc dragonbasic frege gforth gforth groff mal particles phorth preforth pygments r3 reforth skip pl 1694 1910 1537 0 forth forth text/x-forth source.forth programming false f/Forth.fth 3 2008 2016 16 1 forth.py 1970 lisp apl factor postscript rpl rebol reverse-polish-notation freebsd c linux unix atmel-avr msp430 ascii joy "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." 2001 392 454 1239 11012 National Radio Astronomy Observatory fth 4th f for forth fr frt fs fth frt fs 3230 0 61 1 4th e4 f83 fb forth fpm fr frt ft fth rx fs f for https://www.forth.com/starting-forth/ text 3664 forth Forth https://repl.it/languages/forth http://www.rosettacode.org/wiki/Category:Forth https://theforth.net/ gforth United States Forth "' Hello world in Forth ."" Hello World"" CR" .( Hello World) ": HELLO ( -- ) ."" Hello Forth (fth)!"" ; HELLO " Forth https://www.reddit.com/r/Forth/ https://riju.codes/forth "."" Hello, world!"" CR " hex create AKey 61 c, 8A c, 63 c, D2 c, FB c, : test cr 0 DO rc4_byte . LOOP cr ; AKey 5 rc4_init 2C F9 4C EE DC 5 test \ output should be: F1 38 29 C9 DE Forth \ . true true true true true true true false false https://github.com/hcchengithub/peforth https://en.wikipedia.org/wiki/Forth_(programming_language) 7 16 https://hopl.info/showlanguage.prx?exp=182 Forth Forth https://github.com/textmate/forth.tmbundle 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 Forth forth developer 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 nodejs Node.js 2009 Ryan Dahl 39 pl https://nodejs.org 0 https://nodejs.org/en/blog/year-2011/ https://nodejs.org/en/download/releases/ https://nodejs.org/en/download/ v22.2.0 89 1 46 24865 true 0 https://github.com/nodejs/node pl 2014 2024 2009 2927 28677 105706 2087 false n/Node.js.js 928277 1560 2009 2025 93629 4173 43051 1253 11653083 2009 2009 c javascript linux freebsd npm-pm tcp tls udp unix coffeescript dart typescript php mps visual-studio-editor eclipse-editor visual-studio-code-editor postgresql mongodb json "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!." 2010 -1 805 2 26415635 OpenJS Foundation js javascript cpp c python html json perl markdown assembly-language typescript bourne-shell yaml cmake starlark restructuredtext m4 make pascal diff wasm xml css powershell idl bash svg rust csv r xhtml lisp toml sql vim-script fortran-90 bazel scheme csharp php awk ruby coffeescript ini jsx dockerfile sed true 410331 6864 87 1 false 22 true https://nodejs.org/en/docs/ https://devdocs.io/node/ text https://repl.it/languages/nodejs https://www.npmjs.com/ United States #!/usr/bin/env node console.log('Hello World'); https://reddit.com/r/node Node.js https://www.youtube.com/watch?v=1eERxzjXeGo https://github.com/nodejs/node https://www.meetup.com/topics/nodejs console.log """" true false true true true true https://en.wikipedia.org/wiki/nodejs 79 18 nodejs.org 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 nodejs developer 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 title|year|author|goodreadsId|rating|ratings|reviews\nNodejs Programming by Example|2012|Agus Kurniawan|22023706|3.75|12|0 deno Deno 2018 Ryan Dahl 31 compiler https://deno.land/ 0 v2.0.0 90 2 18 24859 true 1 bun https://github.com/denoland/deno compiler 2018 2024 2018 1411 5181 93520 2049 false d/Deno.ts 2018 2025 17115 1108 9657 165 1112646 2018 Deno Land Inc ts typescript javascript rust json markdown toml jsx yaml jupyter-notebook lua css c idl csharp xml powershell dockerfile svg true 118419 0 54 javascript typescript 1 false 2 true https://deno.land/manual@v1.27.1/introduction United States "// Imports `serve` from the remote Deno standard library, using URL. import { serve } from ""https://deno.land/std@v0.21.0/http/server.ts""; // `serve` function returns an asynchronous iterator, yielding a stream of requests for await (const req of serve({ port: 8000 })) { req.respond({ body: ""Hello, World!\n"" }); }" "console.log(""Hello World""); " https://reddit.com/r/Deno https://twitter.com/deno_land Deno https://www.youtube.com/watch?v=cV1CEnfKtdI https://github.com/denoland/deno // console.log """" true true true false true https://en.wikipedia.org/wiki/Deno_(software) 2 0 deno.land 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 protobuf Protocol Buffers 2008 35 idl https://developers.google.com/protocol-buffers/ 51 91 3 24855 true 56 ace apache-hbase arrow-format atprotocol avro bazel capn-proto capn-proto carbon cir claro closure-templates cmake codeql crush cuelang dgraph everparse3d firrtl flatbuffers flutter gerbil groff hhvm impala ion iterm2 kaitai ko kotlin kubernetes logica m3db michelson micropython mongodb obsidian-lang onnx opencv paraview please-build prometheus pygments pytorch quint rholang rocksdb solidity tao3d tensorflow vlc wyvern xgboost-model xgboost xla yara idl 10064 11692 23747 0 protobuf or Protocol Buffers protobuf protobuf text/x-protobuf source.proto data false 11 2010 2018 1 2 dsls.py 2001 xml thrift java csharp python go ruby objective-c perl php scala julia 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. 2008 439 86 218 18338104 Google proto proto true 2416 94 63 proto https://developers.google.com/protocol-buffers/docs/overview text https://github.com/antlr/grammars-v4/tree/master/protobuf/protobuf2 protobuf message Person { required string name = 1; required int32 id = 2; optional string email = 3; } "package tutorial; option java_package = ""com.example.tutorial""; option java_outer_classname = ""AddressBookProtos""; message Person { required string name = 1; required int32 id = 2; optional string email = 3; enum PhoneType { MOBILE = 0; HOME = 1; WORK = 2; } message PhoneNumber { required string number = 1; optional PhoneType type = 2 [default = HOME]; } repeated PhoneNumber phone = 4; } message AddressBook { repeated Person person = 1; } " Protocol Buffer "// polyline.cpp #include ""polyline.pb.h"" // generated by calling ""protoc polyline.proto"" Line* createNewLine(const std::string& name) { // create a line from (10, 20) to (30, 40) Line* line = new Line; line->mutable_start()->set_x(10); line->mutable_start()->set_y(20); line->mutable_end()->set_x(30); line->mutable_end()->set_y(40); line->set_label(name); return line; } Polyline* createNewPolyline() { // create a polyline with points at (10,10) and (20,20) Polyline* polyline = new Polyline; Point* point1 = polyline->add_point(); point1->set_x(10); point1->set_y(10); Point* point2 = polyline->add_point(); point2->set_x(20); point2->set_y(20); return polyline; }" syntax import weak public package option repeated oneof map reserved to max enum message service rpc stream returns package optional true false // /* */ true false true true true true true true true true true false true https://en.wikipedia.org/wiki/Protocol_Buffers 0 0 Protocol Buffer https://github.com/michaeledgar/protobuf-tmbundle Protocol Buffer protocol buffers developer gradle Gradle 2008 Hans Dockter 19 application https://gradle.org 56 v8.8.0-RC1 92 1 31 24852 false 56 avail ballerina bazel bebasic ceu ceylon cloc codeql couchdb dafny dyvil elegance flatbuffers flix flow9 flutter golo gradle gun halide hhvm invokator ixml jslt koara kotlin ladybird lobster lwjgl mal melody moirai netbeans-editor nextflow obsidian-lang olc opencv partiql pkl project-mentat pygments python pytorch react-native simple-binary-encoding smali smallbasic tensorflow uno wonkey xtclang xtext yakou-lang yeti zenscript zlang https://github.com/gradle/gradle application 4 0 text source.groovy.gradle data 2009 2024 2008 520 4611 16485 2803 false 29 2011 2014 2 1 2008 2025 129709 1057 25229 656 1443717 2007 https://github.com/gradle gradle java groovy gradle kotlin xml asciidoc toml markdown scala cpp javascript yaml css c html plantuml svg json swift bourne-shell java-server-pages xslt xsd csv objective-cpp assembly-language dtd idl objective-c gherkin ruby true 31577 0 52 1 true 8 true gradle gradle.kts text Various "apply plugin: GreetingPlugin greeting { message = 'Hi' greeter = 'Gradle' } class GreetingPlugin implements Plugin { void apply(Project project) { project.extensions.create(""greeting"", GreetingPluginExtension) project.task('hello') << { println ""${project.greeting.message} from ${project.greeting.greeter}"" } } } class GreetingPluginExtension { String message String greeter }" https://twitter.com/gradle https://github.com/gradle/gradle 0 0 gradle.org https://github.com/alkemist/gradle.tmbundle Gradle visual-basic.net Visual Basic .NET 2001 32 pl https://docs.microsoft.com/dotnet/visual-basic/ 4 93 3 24845 3724 true 4 jsil-compiler mal pygments roslyn-compiler pl 285 322 935363 3 "author name avatar url language languageColor stars forks currentPeriodStars description\nfrk1 hazedumper https://github.com/frk1.png https://github.com/frk1/hazedumper ""Visual Basic"" #945db7 422 239 15 ""up to date csgo offsets and hazedumper config""\nmymmsc books https://github.com/mymmsc.png https://github.com/mymmsc/books ""Visual Basic"" #945db7 926 481 31 常用书籍" visual basic or vbnet or vb .net or vb.net text vb text/x-vb source.vbnet programming false 4 vb.net VisualBasic.NET 7 2002 android linux solaris unix microsoft-small-basic visual-basic f-sharp csharp linq vba "Visual Basic .NET (VB.NET) is a multi-paradigm, object-oriented programming language, implemented on the .NET Framework. Microsoft launched VB.NET in 2002 as the successor to its original Visual Basic language. Although the "".NET"" portion of the name was dropped in 2005, this article uses ""Visual Basic [.NET]"" to refer to all Visual Basic languages released since 2002, in order to distinguish between them and the classic Visual Basic. Along with Visual C#, it is one of the two main languages targeting the .NET framework. Microsoft's integrated development environment (IDE) for developing in Visual Basic .NET language is Visual Studio. Most Visual Studio editions are commercial; the only exceptions are Visual Studio Express and Visual Studio Community, which are freeware. In addition, the .NET Framework SDK includes a freeware command-line compiler called vbc.exe. Mono also includes a command-line VB.NET compiler." 2003 894 1207 1867 208996 Microsoft vb vb vbhtml vb 5691 3447 224 VB vb vbproj false https://learn.microsoft.com/en-us/dotnet/visual-basic/ text https://www.nuget.org/ "Imports System.Console Module Program Sub Main() Dim rows As Integer ' Input validation. Do Until Integer.TryParse(ReadLine(""Enter a value for how many rows to be displayed: "" & vbcrlf), rows) AndAlso rows >= 1 WriteLine(""Allowed range is 1 and {0}"", Integer.MaxValue) Loop ' Output of Floyd's Triangle Dim current As Integer = 1 Dim row As Integer Dim column As Integer For row = 1 To rows For column = 1 To row Write(""{0,-2} "", current) current += 1 Next WriteLine() Next End Sub '''
''' Like Console.ReadLine but takes a prompt string. '''
Function ReadLine(Optional prompt As String = Nothing) As String If prompt IsNot Nothing Then Write(prompt) End If Return Console.ReadLine() End Function End Module" "Module Module1 Sub Main() Console.Out.WriteLine(""Hello, I am a little sample application to test GitHub's Linguist module."") Console.Out.WriteLine(""I also include a Razor MVC file just to prove it handles cshtml files now."") End Sub End Module " "System.WindowsApplication1.Forms.Form2.text = "" MainForm """ AddHandler AddressOf Alias And AndAlso As Boolean ByRef Byte ByVal Call Case Catch CBool CByte CChar CDate CDbl CDec Char CInt Class Class CLng CObj Const Continue CSByte CShort CSng CStr CType CUInt CULng CUShort Date Decimal Declare Default Delegate Dim DirectCast Do Double Each Else ElseIf End End EndIf Enum Erase Error Event Exit False Finally For For Friend Function Get GetType GetXMLNamespace Global GoSub GoTo Handles If Implements Implements Imports In Inherits Integer Interface Is IsNot Let Lib Like Long Loop Me Mod Module Module MustInherit MustOverride MyBase MyClass Namespace Narrowing New New Operator Next Not Nothing NotInheritable NotOverridable Object Of On Operator Option Optional Or OrElse Out Overloads Overridable Overrides ParamArray Partial Private Property Protected Public RaiseEvent ReadOnly ReDim REM RemoveHandler Resume Return SByte Select Set Shadows Shared Short Single Static Step Stop String Structure Structure Sub SyncLock Then Throw To True Try TryCast TypeOf UInteger ULong UShort Using Variant Wend When While Widening With WithEvents WriteOnly Xor #Const #Else #ElseIf #End #If = & &= * *= / /= \ \= ^ ^= + += - -= >> >>= << <<= ' True False true true true true true true false https://en.wikipedia.org/wiki/Visual_Basic_.NET 0 0 https://hopl.info/showlanguage.prx?exp=3724 Visual Basic .NET Visual Basic .NET https://github.com/peters-ben-0007/VBDotNetSyntax Visual Basic visual basic.NET developer ini Ini 1987 29 dataNotation 116 94 3 24842 true 118 ace aheui asdf astroml atomspace bazel blitzmax ceylon charcoal chatterbot cir clash cloc codeql common-workflow-language conan-pm couchdb crmsh cryptol crystal dlvm docopt duro ecl ecr eiffel emscripten erlang f-prime flow9 flua gap gogs-editor gwion haxe hhvm homebrew-pm hook ibis impala infusion-framework inko invokator java jemplate jinja k-framework kumir ladybird latte leo-editor linux mai manim maskjs mathics matplotlib microblocks minidsdb minizinc mongodb moya myia ncl nestedtext netbeans-editor nim nimskull nit nltk nodejs numba nushell oil opencv openverse pan particles pgbouncer php plaid-programming-language polyglot-compiler pony pov-ray-sdl pycket pygments python pytorch r4 rascal revolution-programming-language rholang rita rocksdb saltstack scipy sdms sourcepawn spatial speedie spiderbasic sporth sqlalchemy surrealdb swift taichi tao3d tensorflow testml tornado twtxt wiredtiger wonkey xgboost-model xgboost xl-lang xlwings-editor xtext dataNotation 1 1 .coveragerc .flake8 .pylintrc buildozer.spec pylintrc 13 0 dosini ini properties text/x-properties source.ini data false 26 2005 2013 6 6 configs.py 2001 xml linux unix php unicode c json yaml "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." 2005 546 74 437 1908172 Microsoft ini cfg dof lektorproject prefs pro properties url ini cfg inf .editorconfig service socket device mount automount swap target path timer slice scope https://cheatsheets.zip/ini true 2950 0 36 buildozer.spec editorconfig ini lektorproject prefs text https://github.com/afucher/yaip ini United States "; last modified 1 April 2001 by John Doe [owner] name = John Doe organization = Acme Widgets Inc. [database] ; use IP address in case network name resolution is not working server = 192.0.2.62 port = 143 file = ""payroll.dat""" title=Mindstorms isbn=0465046290 author=Seymour Papert pubmonth=198001 subject=children computers powerful ideas LOGO education url=http://www.papert.org/ INI "GetPrivateProfileString(""owner"", ""name"", ... , ""c:\\programs\\oldprogram\\dbsettings.ini"");" ; true false true true true false true true https://en.wikipedia.org/wiki/INI_file 0 0 INI https://github.com/textmate/ini.tmbundle INI org Org Mode 2003 Carsten Dominik 36 textMarkup https://orgmode.org/ https://orgmode.org/worg/org-syntax.html 0 https://orgmode.org/Changes.html 95 4 6 24832 true 1 bike https://git.savannah.gnu.org/git/emacs/org-mode.git textMarkup 1 1 18 true 0 text none prose false o/Org-mode.org 2008 2024 28240 895 299 108 261523 2007 2003 emacs-editor html latex markdown restructuredtext textile git mediawiki pandoc-app vim sublime-editor "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." 2009 127 93 447 24317457 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. 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. https://list.orgmode.org/ 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. org org org lisp make xml tex perl html https://orgmode.org/orgcard.pdf true 24551 0 44 scroll https://web.libera.chat/#org-mode 1 false https://orgmode.org/manual/ https://lists.gnu.org/mailman/listinfo/emacs-orgmode https://orgmode.org/worg/org-faq.html text 4476 The Netherlands and France https://orgmode.org/org.html#Document-structure "#+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 #+STARTUP: align fold nodlcheck hidestars oddeven lognotestate #+SEQ_TODO: TODO(t) INPROGRESS(i) WAITING(w@) | DONE(d) CANCELED(c@) #+TAGS: Write(w) Update(u) Fix(f) Check(c) #+TITLE: org-ruby #+AUTHOR: Brian Dewey #+EMAIL: bdewey@gmail.com #+LANGUAGE: en #+PRIORITIES: A C B #+CATEGORY: worg {Back to Worg's index} * Motivation The dominant simple plain-text markup languages for the web are Textile and Markdown. A factor for the popularity of those markup formats is the widespread availability of simple, free packages for converting the formats to HTML. For example, the world of Ruby-powered websites has settled on RedCloth for converting Textile to HTML. The default way to convert org-mode files to HTML is the powerful publishing functionality provided by =emacs=. However, =emacs= does not easiliy integrate into many existing website frameworks. =Org-ruby= tries to make it easier to use org-mode files in both dyanmic and static website generation tools written in Ruby. =Org-ruby= is a simple Ruby gem to convert org-mode files to HTML. * Using Org-ruby =Org-ruby= follows the same model as other Ruby markup libraries. You install the gem: #+BEGIN_EXAMPLE sudo gem install org-ruby #+END_EXAMPLE Then, to convert an org-file to HTML in your Ruby code: #+BEGIN_EXAMPLE require 'rubygems' require 'org-ruby' data = IO.read(filename) puts Orgmode::Parser.new(data).to_html #+END_EXAMPLE * Walkthrough: Using org-ruby with Webby Here is an example of how to integrate =org-ruby= into Webby, a static website generation tool written in Ruby. Webby follows a similar pattern to other static site generation tools (like nanoc, Jekyll, and webgen): - You author website content in text with simple markup - Each page is fed through one or more /filters/ to produce HTML - The HTML is mixed in with layouts to produce the final pages For a Webby site, a the source for a page may look like this: #+BEGIN_EXAMPLE --- title: Special Directories created_at: 2009-12-17 status: Complete filter: - erb - maruku tags: - powershell --- <%= @page.title %> ================== Special Directories are a set of directories, each of which has a function that will navigate you to the appropriate directory using the push-location cmdlet. For example, the function `home` might navigate to `c:\users\bdewey.` Install ------- Copy the module to somewhere in `ENV:PSModulePath`. Then, InstallModule SpecialDirectories #+END_EXAMPLE In the above example, the text is written in Markdown. At the top of the file, metadata informs Webby to pass the text through two /filters/ to produce HTML. The first filter, =erb=, handles embedded Ruby. In this case, it will replace ~<%= @page.title %>~ with the page title (=Special Directories=). The second filter uses Maruku to translate Markdown into HTML. You can use the exact same pattern to include org-mode files in a Webby site. For this walkthrough, I assume you already have Webby installed, and that you've already created a site. 1. Make sure you have =org-ruby= installed: =sudo gem install org-ruby=. 2. You need to register a new Webby filter to handle org-mode content. Webby makes this easy. In the =lib/= folder of your site, create a file =orgmode.rb=: #+BEGIN_EXAMPLE require 'org-ruby' Webby::Filters.register :org do |input| Orgmode::Parser.new(input).to_html end #+END_EXAMPLE This code creates a new filter, =org=, that will use the =org-ruby= parser to translate org-mode input into HTML. 3. Create your content. For example: #+BEGIN_EXAMPLE --- title: Orgmode Parser created_at: 2009-12-21 status: Under development filter: - erb - org tags: - orgmode - ruby --- <%= @page.title %> Status: <%= @page.status %> * Description Helpful Ruby routines for parsing orgmode files. The most significant thing this library does today is convert orgmode files to textile. Currently, you cannot do much to customize the conversion. The supplied textile conversion is optimized for extracting ""content"" from the orgfile as opposed to ""metadata."" * History ** 2009-12-29: Version 0.4 - The first thing output in HTML gets the class ""title"" - HTML output is now indented - Proper support for multi-paragraph list items. See? This paragraph is part of the last bullet. - Fixed bugs: - ""rake spec"" wouldn't work on Linux. Needed ""require 'rubygems'"". #+END_EXAMPLE This file will go through the =erb= and =org= filters; as defined in the previous step, the =org= filter will use =org-ruby= to generate HTML. That's all there is to it! " Hello World https://www.reddit.com/r/orgmode/ https://riju.codes/org Hello, world! Org-mode https://git.savannah.gnu.org/git/emacs/org-mode.git true https://en.wikipedia.org/wiki/Org-mode 0 0 orgmode.org Org Org make Make 1976 Stuart Feldman 35 pl application 499 96 5 24823 768 true 501 abcl-lang abs ace acorn-lang ad-hoc aheui ail aith ale alpaca alumina ana apache-hbase aplette aretext ark-lang arrow-format asdf astatine astroml atprotocol attoparsec austral avi-synth awl bamboo bash battlestar bazel beef berkeleydb berry bio blazex blender-app blitzmax blox bpkg-pm broccoli-1 bucklescript bython c3 candor candy cane capn-proto caramel carbon carth catala ceu ceylon chapel checked-c chibicc chicken chisel chrysalisp ciel cir cito cityhash-hash-function clash clay click clike cloc cmake coconut codeql cognate comby common-workflow-language commonmark coq cosh couchdb cperl crema crmsh cryptol crystal cspydr css-doodle curv cwerg cytosol dafny dasm datafun ddp dedukti dern dex dexvis dgraph differential-datalog djot dlvm dragonbasic duro ec ecl ecr edgedb eff egison eiffel ejs elena elfe elixir elpi elvish elymas emberscript emscripten encore enso erlang euphoria fact-lang factor felix femtolisp fennel ferret ffmpeg filebench-wml firrtl fish flame-ir flatbuffers flatline fleck flex flow flow9 flua forest-lang fork-lang frank-lang frege fstar fun funl futhark g-portugol gap generate-ninja gentee gerbil gforth ghc git gleam go graph-it gravity groff gwion hacspec hakaru hal-format halide hamler hare harlan hashlink haste haxe hazel hcl hera hhvm highlightjs hina hobbes homa horse64 htsql huginn hush huwcode icarus idio idris impala incipit ink-lang inko intuitionistic invokator iode iterm2 ixml j jal-compiler janet java jayfor jcof jeeves jelly jemplate jflex jinja jison jonprl jq json-schema jsonnet jsparagus juicy julia juvix k-framework kakoune-editor kalyn kamby katex kefir kitten ko kona ktyek kubernetes kuc kumir kuroko latino ldpl lem-editor lemon-lang leo-editor lever lift ligo lil linearml links-programming-language linux lispyscript litescript little lmdb lobster luajit luna-1 luna m3db magit mal manim manool mathics matplotlib menhir metalang99 mewmew mgmt michelson micro-cpp micro-editor microl micropython mimium minidsdb minilang minizinc mirth mlpolyr mlscript mobl-lang mochi moescript mongodb monkeyx monte moonscript mudlle mugo multiaddr mycroft myia mys mythryl ncl nesc nestedtext netbeans-editor never newclay newlisp nextflow ngnk ngs nianiolang nit nltk nodejs note noweb nqc numba nymph objectscript obsidian-lang oden odin oil olc onnx ooc opa opal opam-pm open-shading-language opencomal opencv openscad orca-pl orca org oxyl p-star pcre perl pgbouncer php pipelines pkgconfig plasma please-build pogoscript pointless poke polyglot-compiler pony popr postgresql potion pov-ray-sdl praat-script preforth prescheme project-mentat prometheus prql psyche purescript pycket pygments pyret-lang pyret pyth python pytorch qore quaint-lang quickjs quicklisp-pm quint racket ragel ramen rapidbatch rapira raptorjit reach reactjs reason recfiles redis redprl reforth reko-decompiler remix rescript retdec revolution-programming-language rholang ricscript riff rita robotframework rocksdb rosie roy ruby rust saltstack satysfi savi scallop scikit-learn scipy sentient seq setlx shen shill shml sile simit simple-binary-encoding simplictiy skip slash slony smali smallbasic smc smpl snowball-programming-language solid solidity sophie space spatial spiderbasic sporth sqlalchemy sqlite squire squirrel stacklang stencil stoneknifeforth streem subleq sugar surrealdb swi-prolog swift sympy t-lang taichi tamgu tao3d tensorflow terra testml textile tiledb tinyc-compiler tiscript tl toi tornado toy-lang tridash triton truck tuplemarkup twtxt txtzyme u ucg ucl ultralisp-pm uno urweb v v8 vale-assembly vcpkg-pm veryl virgil vlc volt vsxu vyper wart wasm wasmer wax wenyan wing winxed wiredtiger wisp woe wonkey wren wyvern xarray xgboost-model xgboost xl-lang xlwings-editor xodio xsv-app xtclang yara yasnippet yeti yggdrasil z-expressions zephir zl pl 152971 250693 BSDmakefile GNUmakefile Kbuild Makefile Makefile.am Makefile.boot Makefile.frag Makefile.in Makefile.inc Makefile.wat makefile makefile.sco mkfile 247622 13 "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""" bsdmake or make or mf make makefile cmake text/x-cmake source.makefile programming false m/Make.makefile 3 Makefile make.py c A makefile is a file containing a set of directives used with the make build automation tool. 2002 328 81 87 55976 Make — a program for maintaining computer programs Make — a program for maintaining computer programs Bell Labs Make — a program for maintaining computer programs mak d make makefile mk mkfile makefile mak mk Makefile makefile Makefile.* GNUmakefile true 1860 0 42 1 am Gnumakefile gnumakefile Makefile makefile mk https://tio.run/#make https://www.gnu.org/software/make/manual/make.html text 132 Makefile http://www.rosettacode.org/wiki/Category:Make make United States https://semanticscholar.org/paper/40cf2b47de20d0b930cd4b5184febe40bdc681c8 edit : main.o kbd.o command.o display.o \ insert.o search.o files.o utils.o cc -o edit main.o kbd.o command.o display.o \ insert.o search.o files.o utils.o main.o : main.c defs.h cc -c main.c kbd.o : kbd.c defs.h command.h cc -c kbd.c command.o : command.c defs.h command.h cc -c command.c display.o : display.c defs.h buffer.h cc -c display.c insert.o : insert.c defs.h buffer.h cc -c insert.c search.o : search.c defs.h buffer.h cc -c search.c files.o : files.c defs.h buffer.h command.h cc -c files.c utils.o : utils.c defs.h cc -c utils.c clean : rm edit main.o kbd.o command.o display.o \ insert.o search.o files.o utils.o "$(info ""Hello World"") all:" #!/usr/bin/make -f %: ls -l Makefile https://riju.codes/make ".PHONY: all all: @echo ""Hello, world!"" " edit: main.o kbd.o command.o display.o cc -o edit main.o kbd.o command.o display.o main.o: main.c defs.h cc -c main.c kbd.o: kbd.c defs.h command.h cc -c kbd.c command.o: command.c defs.h command.h cc -c command.c display.o: display.c defs.h cc -c display.c clean: rm edit main.o kbd.o command.o display.o Make # true true true true true https://en.wikipedia.org/wiki/Makefile 0 0 https://hopl.info/showlanguage.prx?exp=768 Makefile https://github.com/textmate/make.tmbundle Makefile brainfuck Brainfuck 1993 Urban Müller 28 esolang 8 97 5 24817 true 10 beef cloc cspydr ddp hyphy nit porffor pygments semicolon semicolon esolang 790 832 1631 0 text brainfuck text/x-brainfuck source.bf programming false b/Brainfuck.bf 4 2013 2017 5 2 brainf esoteric.py https://esolangpark.vercel.app/ide/brainfuck 1993 ascii c 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. 2001 1238 278 1468 4086 A nsfw esolang. A nsfw esolang. Sentience Politics A nsfw esolang. b bf bf bf b b bf b bf 6460 0 28 1 https://tio.run/#brainfuck https://gist.github.com/roachhd/dce54bec8ba55fb17d3a text https://github.com/antlr/grammars-v4/tree/master/esolang/brainfuck brainfuck Brainfuck https://repl.it/languages/brainfuck bf Switzerland Hello World in Brainfuck ++++++++++[>+++++++>++++++++++>+++<<<-]>++.>+.+++++++ ..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+. -[------->+<]>-.-[->+++++<]>++.+++++++..+++.[--->+<]>-----.---[->+++<]>.-[--->+<]>---.+++.------.--------. // Hello World ++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++. Brainfuck https://riju.codes/brainf ++++++++ [ >++++ [ >++ >+++ >+++ >+ <<<<- ] >+ >+ >- >>+ [<] <- ] >>. >---. +++++++..+++. >>. <-. <. +++.------.--------. >>+. >++. -,+[ Read first character and start outer character reading loop -[ Skip forward if character is 0 >>++++[>++++++++<-] Set up divisor (32) for division loop (MEMORY LAYOUT: dividend copy remainder divisor quotient zero zero) <+<-[ Set up dividend (x minus 1) and enter division loop >+>+>-[>>>] Increase copy and remainder / reduce divisor / Normal case: skip forward <[[>+<-]>>+>] Special case: move remainder back to divisor and increase quotient <<<<<- Decrement dividend ] End division loop ]>>>[-]+ End skip loop; zero former divisor and reuse space for a flag >--[-[<->+++[-]]]<[ Zero that flag unless quotient was 2 or 3; zero quotient; check flag ++++++++++++<[ If flag then set up divisor (13) for second division loop (MEMORY LAYOUT: zero copy dividend divisor remainder quotient zero zero) >-[>+>>] Reduce divisor; Normal case: increase remainder >[+[<+>-]>+>>] Special case: increase remainder / move it back to divisor / increase quotient <<<<<- Decrease dividend ] End division loop >>[<+>-] Add remainder back to divisor to get a useful 13 >[ Skip forward if quotient was 0 -[ Decrement quotient and skip forward if quotient was 1 -<<[-]>> Zero quotient and divisor if quotient was 2 ]<<[<<->>-]>> Zero divisor and subtract 13 from copy if quotient was 1 ]<<[<<+>>-] Zero divisor and add 13 to copy if quotient was 0 ] End outer skip loop (jump to here if ((character minus 1)/32) was not 2 or 3) <[-] Clear remainder from first division if second division was skipped <.[-] Output ROT13ed character from copy and clear it <-,+ Read next character ] End character reading loop Brainfuck https://github.com/andreabolognani/beef https://github.com/robbielynch/ibrainfuck https://en.wikipedia.org/wiki/Brainfuck 0 0 Brainfuck https://github.com/Drako/SublimeBrainfuck Brainfuck apl APL 1964 Kenneth E. Iverson 39 pl arrayLang 4 98 5 24816 18 true 11 april axio bqn cloc co-dfns futhark goal klong particles pygments u pl 87 95 416 0 apl aplx dyalog text apl text/apl source.apl programming false a/APL.apl 99 2016 2018 3 1 A Programming Language apl.py https://tryapl.org/ 1964 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 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. 2001 680 388 1557 1451 Harvard University apl dyalog apl apl aplf aplo apln aplc apli dyalog apl 3670 0 51 1 apl apla aplc aplf apli apln aplo dyalog dyapp mipage false https://xosnitc.github.io/apl-spec.html text apl https://repl.it/languages/apl http://www.rosettacode.org/wiki/Category:APL United States APL/J/K ⍝ Hello World in APL ⎕←\'Hello World\' ⎕←'Hello World' #!/usr/local/bin/apl --script NEWLINE ← ⎕UCS 10 HEADERS ← 'Content-Type: text/plain', NEWLINE HEADERS ⍝ ⎕←HEADERS ⍝ ⍕⎕TS )OFF APL https://riju.codes/apl 'Hello, world!' txt←'
This is emphasized text.
' ⎕←{⍵/⍨~{⍵∨≠\⍵}⍵∊'<>'}txt APL https://savannah.gnu.org/svn/?group=apl ⍝ ' true true true true false true https://github.com/Dyalog/dyalog-jupyter-kernel https://en.wikipedia.org/wiki/APL_(programming_language) 13 28 https://hopl.info/showlanguage.prx?exp=18 APL APL https://github.com/Alhadis/language-apl.git 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 APL 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 yacc Yacc 1975 Stephen C. Johnson 27 grammarLanguage compiler 70 99 1 1 24812 704 true 73 ad-hoc ana aplette bash beef blox boomerang-decompiler c3 carbon click cmake cognate cor cperl crema cryptol duro ec ecl eiffel fancy filebench-wml flex frege futhark gap gforth ghc haste hhvm hobbes invokator jflex jison jq jql kitlang koka latino lemon linux menhir mgmt mudlle ncl nesc never open-shading-language opencomal openscad orca parsers perl php poke postgresql potion prometheus purescript ramdascript recfiles reko-decompiler ricscript ruby shill slony solid sqlite streem t2b vlc vsxu yara grammarLanguage 10470 13674 11041 0 text source.yacc programming false 2 2007 2011 1 2 Yet Another Compiler-Compiler 1975 unix b c bison ocaml ratfor ada pascal java python ruby go common-lisp Yacc (Yet Another Compiler-Compiler) is a computer program for the Unix operating system. It is a Look Ahead Left-to-Right (LALR) parser generator, generating a parser, the part of a compiler that tries to make syntactic sense of the source code, specifically a LALR parser, based on an analytic grammar written in a notation similar to Backus–Naur Form (BNF). Yacc itself used to be available as the default parser generator on most Unix systems, though it has since been supplanted as the default by more recent, largely compatible, programs. 2001 229 358 347 34358 y yacc yy c 3087 17 33 1 false y yacc https://pubs.opengroup.org/onlinepubs/009604599/utilities/yacc.html text United States https://github.com/babyraging/yash "%{ /* * Test program: Advanced Calculator * by Zhao Cheng 5/20/2012 */ %} %union { double val; /* For returning numbers. */ symrec *tptr; /* For returning symbol-table pointers. */ } %token NUMBER %token VAR FNCT %right '=' %left '+' '-' %left '*' '/' %right '^' %left NEG %type expression %{ #include #include #include #include #include ""calc.h"" /* Contains definition of `symrec'. */ %} %% statement : /* empty */ { exit(0); } | expression { printf(""= %f\n"", $1); } ; expression : NUMBER { $$ = $1; } | VAR { $$ = $1->value.var; } | VAR '=' expression { $$ = $3; $1->value.var = $3; } | FNCT '(' expression ')' { $$ = (*($1->value.fnctptr))($3); } | expression '*' expression { $$ = $1 * $3; } | expression '/' expression { $$ = $1 / $3; } | expression '+' expression { $$ = $1 + $3; } | expression '-' expression { $$ = $1 - $3; } | expression '^' expression { $$ = pow($1, $3); } | '-' expression %prec NEG { $$ = -$2; } | '(' expression ')' { $$ = $2; } ; %% struct init { char const *fname; double (*fnct) (double); }; struct init const arith_fncts[] = { ""sin"" , sin , ""asin"" , asin , ""cos"" , cos , ""acos"" , acos , ""tan"" , tan , ""atan"" , atan , ""ceil"" , ceil , ""floor"" , floor , ""abs"" , fabs , ""ln"" , log , ""log"" , log10 , ""lg"" , log2 , ""exp"" , exp , ""sqrt"" , sqrt , 0 , 0 }; /* The symbol table: a chain of `struct symrec'. */ symrec *sym_table; /* Put arithmetic functions in table. */ void init_table (void) { int i; symrec *ptr; for (i = 0; arith_fncts[i].fname != 0; i++) { ptr = putsym (arith_fncts[i].fname, FNCT); ptr->value.fnctptr = arith_fncts[i].fnct; } } int main() { init_table(); while (yyparse() == 0) ; return 0; } void yyerror(const char *msg) { fprintf(stderr, ""Error: %s\n"", msg); } symrec * putsym (char const *sym_name, int sym_type) { symrec *ptr; ptr = (symrec *) malloc (sizeof (symrec)); ptr->name = (char *) malloc (strlen (sym_name) + 1); strcpy (ptr->name,sym_name); ptr->type = sym_type; ptr->value.var = 0; /* Set value to 0 even if fctn. */ ptr->next = (struct symrec *)sym_table; sym_table = ptr; return ptr; } symrec * getsym (char const *sym_name) { symrec *ptr; for (ptr = sym_table; ptr != (symrec *) 0; ptr = (symrec *)ptr->next) if (strcmp (ptr->name,sym_name) == 0) return ptr; return 0; } " // /* */ true true true false https://en.wikipedia.org/wiki/Yacc 4 1 https://hopl.info/showlanguage.prx?exp=704 yacc Yacc https://github.com/textmate/bison.tmbundle year|publisher|title|authors|isbn13\n2007|PHI|Compiler Design Using FLEX and YACC|Das, Vinu V.|9788120332515\n2012|O’Reilly Media|Lex & Yacc|Doug Brown Doug and John R. Levine and Tony Mason and Tony Mason and Doug Brown|9781449385606\n2012-02-23|Wiley|Compiler Construction Using Java, JavaCC, and Yacc|Anthony J. Dos Reis|9781118112878\n2012|Wiley|Compiler Construction Using Java, JavaCC, and Yacc|Anthony J. Dos Reis|9781118112779 Yacc yacc year|title|doi|citations|influentialCitations|authors|paperId\n1985|Yacc in sasl — an exercise in functional programming|10.1002/spe.4380150807|20|0|S. Jones|5e6fedcd614749ea7e7e6dc764dee16d590c12f6 arm ARM 1985 Sophie Wilson and Steve Furber 24 assembly https://developer.arm.com/architectures/cpu-architecture 0 https://developer.arm.com/downloads/-/arm-compiler-for-embedded 100 2 24811 true 1 b3-ir assembly false Acorn RISC Machine 1985 x86-isa java-bytecode bbc-basic verilog c assembly-language java csharp perl python mmx javascript android unix ios freebsd linux "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." 2002 2538 1871 3920 60558 Acorn Computers S 123423 7695 26 2 https://developer.arm.com/documentation/ https://developer.arm.com/documentation/102870/latest/ text 3230 United Kingdom https://riju.codes/arm " .text .globl main main: mov r7, #4 mov r0, #1 ldr r1, =message mov r2, #14 swi 0 mov r7, #1 mov r0, #0 swi 0 .data message: .string ""Hello, world!\n"" " "; if (r0 == r1) CMP r0, r1 ITE EQ ; ARM: no code ... Thumb: IT instruction ; then r0 = r2; MOVEQ r0, r2 ; ARM: conditional; Thumb: condition via ITE 'T' (then) ; else r0 = r3; MOVNE r0, r3 ; ARM: conditional; Thumb: condition via ITE 'E' (else) ; recall that the Thumb MOV instruction has no bits to encode ""EQ"" or ""NE""" https://gcc.gnu.org/git.html ; true true false https://github.com/DeepHorizons/iarm https://en.wikipedia.org/wiki/ARM_architecture 52 32 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 arm architecture developer arm 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 assembly-language Assembly language 1960 17 assembly 103 101 2 24807 true 103 ace arrow-format bash battlestar bazel beef berkeleydb binaryen bio blitzmax boomerang-decompiler cir cloc cmake co2 cspydr cwerg dasm dragonbasic ec ecl eiffel elena emscripten erlang factor ffmpeg flow9 fstar gap gforth ghc go gradle halide hare hhvm hpp j jal-compiler janet java juicy julia kefir ko kubernetes kuin l2 lambda-zero linux lobster lwjgl m3db mal masm michelson micro-cpp micropython minilang mongodb mudlle nim nimskull nodejs odin oil ooc opencv oxyl pawn-scripting-language pawn php postgresql pov-ray-sdl pygments python pytorch qore r3 r4 racket raptorjit react-native reko-decompiler rocksdb ruby rust stoneknifeforth swift tao3d tbox-lib tinyc-compiler ugbasic v v8 virgil vlc volt wa wiredtiger wonkey zig assembly 33301 47629 109158 asm or nasm assembly_x86 source.assembly programming false assembly 8 1949 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 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. 2001 2352 3074 2431 1368 asm a51 i inc nas nasm 26543 1329 22 a51 asm nasm S s https://docs.oracle.com/cd/E19253-01/817-5477/817-5477.pdf Assembly infiniteLoop: jmp main main: jmp infiniteLoop https://reddit.com/r/asm "include \masm32\include\masm32rt.inc ; use the Masm32 library .code demomain: REPEAT 20 switch rv(nrandom, 9) ; generate a number between 0 and 8 mov ecx, 7 case 0 print ""case 0"" case ecx ; in contrast to most other programming languages, print ""case 7"" ; the Masm32 switch allows ""variable cases"" case 1 .. 3 .if eax==1 print ""case 1"" .elseif eax==2 print ""case 2"" .else print ""cases 1 to 3: other"" .endif case 4, 6, 8 print ""cases 4, 6 or 8"" default mov ebx, 19 ; print 20 stars .Repeat print ""*"" dec ebx .Until Sign? ; loop until the sign flag is set endsw print chr$(13, 10) ENDM exit end demomain" Assembly https://en.wikipedia.org/wiki/Assembly_language 0 0 assembly-language Assembly Assembly assembly language developer wordpress WordPress 2003 Matt Mullenweg and Mike Little 20 application https://wordpress.org 0 102 0 1 24788 false 2 jekyll scroll application false 487287 1319 2003 2003 php mysql html css ftp android ios WordPress is a free and open-source content management system (CMS) based on PHP and MySQL. To function, WordPress has to be installed on a web server, which would either be part of an Internet hosting service or a network host in its own right. An example of the first scenario may be a service like WordPress.com, for example, and the second case could be a computer running the software package WordPress.org. A local computer may be used for single-user testing and learning purposes. Features include a plugin architecture and a template system. WordPress was used by more than 27.5% of the top 10 million websites as of February 2017. WordPress is reportedly the most popular website management or blogging system in use on the Web, supporting more than 60 million websites. WordPress has also been used for other application domains such as pervasive display systems (PDS). WordPress was released on May 27, 2003, by its founders, Matt Mullenweg and Mike Little, as a fork of b2/cafelog. WordPress is released under the GPLv2 (or later) license. 2004 2967 2028 4101 605856 php https://cheatsheets.zip/wordpress true 1573605 14952 22 2 false text 6687 https://www.reddit.com/r/Wordpress/ https://twitter.com/wordpress https://www.youtube.com/watch?v=swhMGL4hI7E https://www.meetup.com/topics/wordpress https://en.wikipedia.org/wiki/WordPress 3 0 wordpress.org wordpress developer wordpress title|year|author|goodreadsId|rating|ratings|reviews\nWordPress For Dummies|2007|Lisa Sabin-Wilson|879967|3.66|546|62\nWordPress Web Design for Dummies|2011|Lisa Sabin-Wilson|14942047|3.59|107|11\nWordPress All-In-One for Dummies|2011|Lisa Sabin-Wilson|14999756|3.81|124|9 ecr Embedded Crystal 2016 23 template https://manas.tech 4 1.12.1 103 2 20 24773 true 4 cloc crystal ecr pegasus https://github.com/crystal-lang/crystal/ template 287 0 HTML ecr text htmlmixed text/html text.html.ecr markup 2012 2024 422 1611 19260 1860 false 320 2013 2018 1 47 2012 2025 16074 637 2467 61 520775 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. 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. Manas Technology Solutions 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. ecr crystal ecr yaml markdown html javascript powershell bourne-shell css c svg make xml python json z-shell bash cpp nix ini true 24932 0 45 true 1 true ecr text Argentina https://crystal-lang.org/api/0.22.0/ECR.html # greeting.ecr <%- if @name -%> Greeting, <%= @name %>! <%- else -%> Greeting! <%- end -%> Greeting.new(nil).to_s #=> Greeting! <% if @name %> Greeting, <%= @name %>! <% else %> Greeting! <% end %> https://github.com/crystal-lang/crystal/ # true true false 0 0 manas.tech https://github.com/atom-crystal/language-crystal HTML+ECR opencl OpenCL 2009 28 pl https://www.khronos.org/opencl 10 https://opencl.org/blog/ https://www.khronos.org/opencl/ 104 2 24755 true 10 basis-universal-format charcoal cir emscripten ffmpeg futhark hhvm hyphy lwjgl opencv pl 0 0 C c_cpp clike text/x-csrc source.c programming false 359 2005 2018 2 23 4546 37 2009 opengl android freebsd linux ia-32 cuda c python java llvmir mathematica javascript arm x86-isa ptx metal sequencel 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. 2008 702 586 1164 17861917 Khronos Group cl opencl true 3731 266 32 cl true https://www.khronos.org/opencl/ text /* Old-style comment. */ // New-style comment. typedef float foo_t; #ifndef ZERO #define ZERO (0.0) #endif #define FOO(x) ((x) + \ ZERO) __kernel void foo(__global const foo_t * x, __local foo_t y, const uint n) { barrier(CLK_LOCAL_MEM_FENCE); if (n > 42) { *x += y; } } // This kernel computes FFT of length 1024. The 1024 length FFT is decomposed into // calls to a radix 16 function, another radix 16 function and then a radix 4 function __kernel void fft1D_1024 (__global float2 *in, __global float2 *out, __local float *sMemx, __local float *sMemy) { int tid = get_local_id(0); int blockIdx = get_group_id(0) * 1024 + tid; float2 data[16]; // starting index of data to/from global memory in = in + blockIdx; out = out + blockIdx; globalLoads(data, in, 64); // coalesced global reads fftRadix16Pass(data); // in-place radix-16 pass twiddleFactorMul(data, tid, 1024, 0); // local shuffle using local memory localShuffle(data, sMemx, sMemy, tid, (((tid & 15) * 65) + (tid >> 4))); fftRadix16Pass(data); // in-place radix-16 pass twiddleFactorMul(data, tid, 64, 4); // twiddle factor multiplication localShuffle(data, sMemx, sMemy, tid, (((tid >> 4) * 64) + (tid & 15))); // four radix-4 function calls fftRadix4Pass(data); // radix-4 function number 1 fftRadix4Pass(data + 4); // radix-4 function number 2 fftRadix4Pass(data + 8); // radix-4 function number 3 fftRadix4Pass(data + 12); // radix-4 function number 4 // coalesced global writes globalStores(data, out, 64); } https://www.meetup.com/topics/opencl // /* */ true true true false https://en.wikipedia.org/wiki/OpenCL 25 46 OpenCL https://github.com/textmate/c.tmbundle 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 OpenCL opencl engineer "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" 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 scratch Scratch 2002 John Maloney and Leo Burd and Yasmin B. Kafai and Natalie Rusk and Brian Silverman and Mitchel Resnick 26 visual https://scratch.mit.edu/ 0 3.0 105 0 24744 true 3 flowgorithm microblocks pickcode visual false scratch.png 6590 47 16 2002 squeak actionscript linux logo smalltalk hypercard starlogo etoys snap android python java basic arduino javascript blockly kodu-game-lab microsoft-small-basic 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. 2007 1368 328 1660 9236158 MIT scratch sb sprite sb2 sprite2 scratch sb sprite sb2 sprite2 true 16942 0 36 6 3 true https://scratch.mit.edu/developers https://scratch.mit.edu/faq text 7665 https://scratch.mit.edu/annual-report http://www.rosettacode.org/wiki/Category:Scratch United States Scratch https://reddit.com/r/scratch https://www.meetup.com/topics/scratch https://en.wikipedia.org/wiki/Scratch_(programming_language) 51 45 Scratch scratch.mit.edu 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 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 latex LaTeX 1985 Leslie Lamport 28 textMarkup http://latex-project.org/ 0 106 3 24740 2157 true 9 asciimath desmos eqn frundis knitr mathjson sile sweave typst textMarkup false l/LaTeX.tex 1998 1980 tex pdf xml css html xetex solaris freebsd linux postscript lyx-editor perl unix bibtex 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). 2001 1540 2605 1914 18195 https://www.latex-project.org/about/team/ tex https://cheatsheets.zip/latex true 7721 0 29 1 https://www.latex-project.org/help/documentation/ https://devdocs.io/latex/ text 5960 http://www.rosettacode.org/wiki/Category:LaTeX United States % Hello World! in LaTeX \documentclass{article} \begin{document} Hello World! \end{document} \documentclass{article} \begin{document} Hello World \end{document} \documentclass{article} \usepackage{amsmath} \title{\LaTeX} \begin{document} \maketitle \LaTeX{} is a document preparation system for the \TeX{} typesetting program. It offers programmable desktop publishing features and extensive facilities for automating most aspects of typesetting and desktop publishing, including numbering and cross-referencing, tables and figures, page layout, bibliographies, and much more. \LaTeX{} was originally written in 1984 by Leslie Lamport and has become the dominant method for using \TeX; few people write in plain \TeX{} anymore. The current version is \LaTeXe. % This is a comment, not shown in final output. % The following shows typesetting power of LaTeX: \begin{align} E_0 &= mc^2 \\ E &= \frac{mc^2}{\sqrt{1-\frac{v^2}{c^2}}} \end{align} \end{document} LaTeX https://github.com/efoerster/texlab % false true true false false https://en.wikipedia.org/wiki/LaTeX 8 5 https://hopl.info/showlanguage.prx?exp=2157 latex-project.org 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 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 c3 C3 2019 Christoffer Lernö 109 pl http://www.c3-lang.org/ 0 https://c3.handmade.network/blog 107 1 12 24726 true 1 c2 https://github.com/c3lang/c3c pl 2019 2025 2019 44 271 4062 123 false 2019 2025 2896 161 1598 17 224803 2019 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. 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. The C3 Language Project 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. c3 c3i c markdown json yaml python yacc cmake cpp lex bourne-shell dockerfile make true 5038 0 130 c2 c 1 false https://rosettacode.org/wiki/Category:C3 Sweden https://news.ycombinator.com/item?id=32005678 module stack {Type}; // Above: the parameterized type is applied to the entire module. struct Stack { usize capacity; usize size; Type* elems; } // The type methods offers dot syntax calls, // so this function can either be called // Stack.push(&my_stack, ...) or // my_stack.push(...) fn void Stack.push(Stack* this, Type element) { if (this.capacity == this.size) { this.capacity *= 2; this.elems = realloc(this.elems, $sizeof(Type) * this.capacity); } this.elems[this.size++] = element; } fn Type Stack.pop(Stack* this) { assert(this.size > 0); return this.elems[--this.size]; } fn bool Stack.empty(Stack* this) { return !this.size; } https://twitter.com/C3Lang https://github.com/c3lang/c3c // /* */ true false false true true true true false true true true true true false false false true true true false true true false true false false true true true true true true false false true false false false true false true true true true true true true true true true true false true false true true true true false true true true true false true false true false true false true true true true true true false true false false false true true true true 0 0 c3-lang.org slim Slim 2010 Andy Stone 25 template https://slim-template.github.io 5 v5.2.1 108 3 6 24718 true 5 ace cloc haml pygments slim https://github.com/slim-template/slim template 176 206 305 0 text slim text/x-slim text.slim markup 2010 2024 2010 124 500 5292 16 false s/Slim.slim 109 2010 2017 1 24 webmisc.py 2010 2025 2022 128 127 3 12727 2010 A lightweight templating engine A lightweight templating engine https://github.com/slim-template A lightweight templating engine slim slim slim ruby slim markdown yaml erb javascript true 7122 0 32 1 true 5 true slim text United States https://web.archive.org/web/20150313184235/http://slim-lang.com/ "doctype html html head title Slim Examples meta name=""keywords"" content=""template language"" meta name=""author"" content=author javascript: alert('Slim supports embedded javascript!') body h1 Markup examples" doctype html head title Hello World body h1 Hello World "doctype html html head title Slim Examples meta name=""keywords"" content=""template language"" meta name=""author"" content=author javascript: alert('Slim supports embedded javascript!') body h1 Markup examples #content p This example shows you how a basic Slim file looks like. == yield - unless items.empty? table - for item in items do tr td.name = item.name td.price = item.price - else p | No items found. Please add some inventory. Thank you! div id=""footer"" = render 'footer' | Copyright © #{year} #{author}" Slim Slim https://github.com/slim-template/slim 0 0 slim-lang.com Slim https://github.com/slim-template/ruby-slim.tmbundle 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 Slim red Red 2011 Nenad Rakocevic 39 pl http://www.red-lang.org/ 0 https://www.red-lang.org/ v0.6.5 109 4 12 24717 true 1 particles https://github.com/red/red pl 92 98 453 0 red/system text source.red programming 2011 2024 2011 209 416 5479 517 false r/Red.red 34 2014 2015 2 3 rebol.py 2011 2025 16017 116 672 43 302457 2010 2011 linux scala lua x86-isa arm freebsd android "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." 2012 64 23 105 35733875 https://github.com/red red reds red reds red red reds red reds red r java markdown xml yaml c html bourne-shell css dockerfile visual-basic csv true 7385 0 https://exercism.org/tracks/red 55 1 false 0 true https://tio.run/#red https://www.red-lang.org/p/documentation.html https://www.red-lang.org/2015/12/answers-to-community-questions.html text 554 http://www.rosettacode.org/wiki/Category:Red "Red [Needs: 'View] view [text ""Hello World""]" "Red/System [ Title: ""Red/System example file"" Purpose: ""Just some code for testing Pygments colorizer"" Language: http://www.red-lang.org/ ] #include %../common/FPU-configuration.reds ; C types #define time! long! #define clock! long! date!: alias struct! [ second [integer!] ; 0-61 (60?) minute [integer!] ; 0-59 hour [integer!] ; 0-23 day [integer!] ; 1-31 month [integer!] ; 0-11 year [integer!] ; Since 1900 weekday [integer!] ; 0-6 since Sunday yearday [integer!] ; 0-365 daylight-saving-time? [integer!] ; Negative: unknown ] #either OS = 'Windows [ #define clocks-per-second 1000 ][ ; CLOCKS_PER_SEC value for Syllable, Linux (XSI-conformant systems) ; TODO: check for other systems #define clocks-per-second 1000'000 ] #import [LIBC-file cdecl [ ; Error handling form-error: ""strerror"" [ ; Return error description. code [integer!] return: [c-string!] ] print-error: ""perror"" [ ; Print error to standard error output. string [c-string!] ] ; Memory management make: ""calloc"" [ ; Allocate zero-filled memory. chunks [size!] size [size!] return: [binary!] ] resize: ""realloc"" [ ; Resize memory allocation. memory [binary!] size [size!] return: [binary!] ] ] JVM!: alias struct! [ reserved0 [int-ptr!] reserved1 [int-ptr!] reserved2 [int-ptr!] DestroyJavaVM [function! [[JNICALL] vm [JVM-ptr!] return: [jint!]]] AttachCurrentThread [function! [[JNICALL] vm [JVM-ptr!] penv [struct! [p [int-ptr!]]] args [byte-ptr!] return: [jint!]]] DetachCurrentThread [function! [[JNICALL] vm [JVM-ptr!] return: [jint!]]] GetEnv [function! [[JNICALL] vm [JVM-ptr!] penv [struct! [p [int-ptr!]]] version [integer!] return: [jint!]]] AttachCurrentThreadAsDaemon [function! [[JNICALL] vm [JVM-ptr!] penv [struct! [p [int-ptr!]]] args [byte-ptr!] return: [jint!]]] ] ;just some datatypes for testing: #some-hash 10-1-2013 quit ;binary: #{00FF0000} #{00FF0000 FF000000} #{00FF0000 FF000000} ;with tab instead of space 2#{00001111} 64#{/wAAAA==} 64#{/wAAA A==} ;with space inside 64#{/wAAA A==} ;with tab inside ;string with char {bla ^(ff) foo} {bla ^(( foo} ;some numbers: 12 1'000 1.2 FF00FF00h ;some tests of hexa number notation with not common ending [ff00h ff00h] ff00h{} FFh""foo"" 00h(1 + 2) (AEh) ;normal words: foo char ;get-word :foo ;lit-word: 'foo 'foo to-integer foo foo/(a + 1)/b call/output reform ['which interpreter] path: copy """" version-1.1: 00010001h #if type = 'exe [ push system/stack/frame ;-- save previous frame pointer system/stack/frame: system/stack/top ;-- @@ reposition frame pointer just after the catch flag ] push CATCH_ALL ;-- exceptions root barrier push 0 ;-- keep stack aligned on 64-bit" Red https://riju.codes/red "Red [Title: ""Main""] print ""Hello, world!"" " https://twitter.com/red_lang "Red/System [Title: ""A factorial script""] factorial: func [ x [integer!] ; This is compulsory in Red/System return: [integer!] ; This is compulsory in Red/System ][ either x = 0 [1][x * factorial x - 1] ]" Red https://github.com/bitbegin/redlangserver https://github.com/red/red ; """" true true false true https://en.wikipedia.org/wiki/Red_(programming_language) 0 0 Red red-lang.org Red https://github.com/Oldes/Sublime-Red Red j J 1990 Kenneth E. Iverson and Roger Hui 46 pl arrayLang http://www.jsoftware.com 0 9.5.1 110 5 10 24716 1558 true 4 goal jelly u uiua https://github.com/jsoftware/jsource pl 124 151 468 0 jconsole text source.j programming 2016 2024 2016 41 90 650 140 false j/J.ijs 43 2014 2018 2 4 j.py 2016 2025 5704 12 1232 110 453396 1996 1990 linux apl fp fl numpy supercollider ascii unix sql c unicode k q "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." 2002 561 196 498 73227 Jsoftware Inc ijs ijs ijs c assembly-language bourne-shell make xml markdown yaml cpp idl html true 3959 0 60 2 false 9 true false https://tio.run/#j https://www.jsoftware.com/help/learning/contents.htm text 417 http://www.rosettacode.org/wiki/Category:J United States APL/J/K https://aplwiki.com/wiki/Jsoftware NB. Hello World in J 'Hello World' 1!:2(2) #!/opt/local/bin/jc echo 'Hello World' exit '' #!/bin/jconsole echo 'Hello, GitHub!' exit '' J https://riju.codes/j echo 'Hello, world!' 3 |. 1 0 1 1 0 0 1 1 1 1 1 NB. rotate 1 0 0 1 1 1 1 1 1 0 1 J https://www.youtube.com/watch?v=DJyQnlVf95E https://github.com/jsoftware/jsource NB. echo ' true true true true true false true https://github.com/martin-saurer/jkernel https://en.wikipedia.org/wiki/J_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=1558 J jsoftware.com J https://github.com/tikkanz/JSyntax year|publisher|title|authors|isbn13\n|Firewall|Programming In C [Paperback] [Jan 01, 2011] DIXIT J B| J. B. Dixit|9789380298399 J sqlite SQLite 2000 Dwayne Richard Hipp 38 queryLanguage https://sqlite.org 0 https://www.sqlite.org/news.html https://www.sqlite.org/changes.html https://sqlite.org/download.html 3.46.0 111 1 16 24707 true 1 project-mentat https://github.com/sqlite/sqlite queryLanguage false 2000 2025 33352 37 2215 446 1659886 https://sqlite.org/fiddle/index.html 2002 2000 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 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. 2003 569 624 1414 244884 Hipp, Wyrick & Company, Inc c tcl java javascript markdown bourne-shell html make m4 yacc csharp css sql cpp yaml nemerle true true 5647 561 https://exercism.org/tracks/sqlite 178 1 false 3 true https://tio.run/#sqlite https://www.sqlite.org/docs.html https://www.sqlite.org/faq.html text https://github.com/antlr/grammars-v4/tree/master/sql/sqlite United States https://www.vldb.org/pvldb/vol15/p3535-gaffney.pdf https://reddit.com/r/sqlite https://riju.codes/sqlite SELECT 'Hello, world!'; https://www.youtube.com/watch?v=kjdxiG17hGM 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 https://github.com/sqlite/sqlite false false https://en.wikipedia.org/wiki/SQLite 11 0 sqlite.org 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 sqlite developer 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 saltstack SaltStack 2011 Thomas S Hatch 20 pl https://repo.saltstack.com/ 4 112 1 27 24705 true 4 cloc pygments racket saltstack https://github.com/saltstack/salt pl 1413 1680 4398 0 saltstate or salt yaml yaml text/x-yaml source.yaml.salt programming 2011 2024 2011 532 5471 14029 2778 false 25 2013 2015 6 6 2011 2025 174123 4107 4818 562 1762860 https://github.com/saltstack sls python restructuredtext markdown yaml saltstack bourne-shell xml powershell html javascript json diff svg css bash csharp make sql xslt ini dockerfile z-shell tex toml cython c d true 34751 0 48 1 true sls text United States base: '*': - packages - coffeestats https://github.com/saltstack/salt 1 0 repo.saltstack.com SaltStack https://github.com/saltstack/atom-salt year|publisher|title|authors|isbn13\n2016|Packt Publishing|Mastering SaltStack - Second Edition|Hall, Joseph|9781786467027 SaltStack http HTTP 1989 Tim Berners-Lee 22 protocol 0 113 2 24701 true 1 mosaic protocol 0 0 text http message/http source.httpspec data false h/HTTP.py 3 2014 2015 1 textfmts.py 1999 ftp smtp tls tcp udp url html css ascii gzip rest isbn 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. 2001 6702 1996 4080 13443 W3C http py 33780 771996 22 1 https://www.w3.org/Protocols/rfc2616/rfc2616.html na 4663 https://github.com/antlr/grammars-v4/tree/master/http http United States import http.server import socketserver from http import HTTPStatus class Handler(http.server.SimpleHTTPRequestHandler): def do_GET(self): self.send_response(HTTPStatus.OK) self.end_headers() self.wfile.write(b'Hello World') httpd = socketserver.TCPServer(('', 8000), Handler) httpd.serve_forever() HTTP "HTTP/1.1 200 OK Date: Mon, 23 May 2005 22:38:34 GMT Content-Type: text/html; charset=UTF-8 Content-Encoding: UTF-8 Content-Length: 138 Last-Modified: Wed, 08 Jan 2003 23:11:55 GMT Server: Apache/1.3.3.7 (Unix) (Red-Hat/Linux) ETag: ""3f80f-1b6-3e1cb03b"" Accept-Ranges: bytes Connection: close An Example Page Hello World, this is a very simple HTML document. " HTTP https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol 12 2 https://github.com/samsalisbury/Sublime-HTTP 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 HTTP http developer 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 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 bazel Bazel 2015 Han-Wen Nienhuys 17 application https://bazel.build/ 23 8.0.0-pre.20240516.1 114 0 34 24697 false 23 asterius-compiler bazel capn-proto carbon cir claro cloc closure-templates flatbuffers hhvm jflex jsonnet mongodb nodejs olc opencomal please-build pytorch starlark tensorflow v8 xla yara https://github.com/bazelbuild/bazel application 2014 2024 2015 607 4000 22782 2004 false 2015 2025 45517 1466 8316 963 538906 2016 2019 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. 96 19 50918393 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. 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. Google 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. java bazel bourne-shell markdown starlark cpp protobuf python yaml html svg xml c gradle vtl-lang bash make ada csharp css diff powershell javascript pascal json restructuredtext ini objective-c assembly-language cmake perl sas m4 objective-cpp true 36750 0 52 1 true 8 true BUILD United States https://twitter.com/bazelbuild https://github.com/bazelbuild/bazel https://en.wikipedia.org/wiki/Bazel_(software) 0 0 bazel.build fish fish 2005 Axel Liljencrantz and Thorsten Ball 41 pl http://fishshell.com/ 0 https://fishshell.com/blog/index.html https://fishshell.com/docs/current/relnotes.html 3.7.1 115 4 17 24694 true 0 https://github.com/fish-shell/fish-shell pl 0 0 Shell fish text source.fish programming 2012 2024 2005 284 1881 25228 443 false f/Fish.fish 16 2008 2014 3 2 friendly interactive shell shell.py 2005 2025 20231 1144 1978 81 220417 2010 2017 bash z-shell "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." 2005 62 38 226 1889847 https://github.com/fish-shell fish fish fish load rust restructuredtext python bourne-shell dockerfile cmake yaml html markdown css javascript xml make cpp c objective-c toml true 32547 1 63 2 false 3 true fish https://tio.run/#fish https://fishshell.com/docs/2.3/index.html https://fishshell.com/docs/current/faq.html text 1563 http://www.rosettacode.org/wiki/Category:Fish Various "#!/usr/bin/env fish echo ""Hello World"" " " function eval -S -d ""Evaluate parameters as a command"" # If we are in an interactive shell, eval should enable full # job control since it should behave like the real code was # executed. If we don't do this, commands that expect to be # used interactively, like less, wont work using eval. set -l mode if status --is-interactive-job-control set mode interactive else if status --is-full-job-control set mode full else set mode none end end if status --is-interactive status --job-control full end echo ""begin; $argv ;end eval2_inner <&3 3<&-"" | . 3<&0 set -l res $status status --job-control $mode return $res end " Fish https://riju.codes/fish "echo ""Hello, world!"" " string replace --regex '.*?\.(.*)' '$1' a.b.c #b.c string replace --regex '.*\.(.*)' '$1' a.b.c #c string replace --regex '(.*)\..*' '$1' a.b.c #a.b string replace --regex '(.*?)\..*' '$1' a.b.c #a Fish https://github.com/fish-shell/fish-shell # echo """" true true true false true https://en.wikipedia.org/wiki/Friendly_interactive_shell 1 6 fishshell.com https://github.com/l15n/fish-tmbundle year|publisher|title|authors|isbn13\n1990|HarperPerennial|When Do Fish Sleep? and Other Imponderables of Everyday Life|David Feldman|9780060920111 fish fish developer 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 lean Lean 2015 Leonardo de Moura 35 pl mathematics http://leanprover.github.io/ 4 v3.4.2 116 2 15 24690 true 6 cloc coq koka lean metamath pygments https://github.com/leanprover/lean pl 233 265 1807 0 text source.lean programming 2013 2024 2013 117 216 2145 58 false l/Lean 17 2015 2016 2 3 theorem.py 2013 2023 13762 51 2908 56 229708 https://live.lean-lang.org/ Microsoft lean hlean lean lean cpp cmake bourne-shell markdown python c yaml toml tex perl html bash lua lex true 3046 0 56 coq metamath 1 true 3 true hlean lean https://tio.run/#lean https://leanprover.github.io/documentation/ text 8525 United States "#print ""Hello World""" /- Copyright (c) 2014 Microsoft Corporation. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Module: algebra.binary Authors: Leonardo de Moura, Jeremy Avigad General properties of binary operations. -/ import logic.eq open eq.ops namespace binary section variable {A : Type} variables (op₁ : A → A → A) (inv : A → A) (one : A) local notation a * b := op₁ a b local notation a ⁻¹ := inv a local notation 1 := one definition commutative := ∀a b, a * b = b * a definition associative := ∀a b c, (a * b) * c = a * (b * c) definition left_identity := ∀a, 1 * a = a definition right_identity := ∀a, a * 1 = a definition left_inverse := ∀a, a⁻¹ * a = 1 definition right_inverse := ∀a, a * a⁻¹ = 1 definition left_cancelative := ∀a b c, a * b = a * c → b = c definition right_cancelative := ∀a b c, a * b = c * b → a = c definition inv_op_cancel_left := ∀a b, a⁻¹ * (a * b) = b definition op_inv_cancel_left := ∀a b, a * (a⁻¹ * b) = b definition inv_op_cancel_right := ∀a b, a * b⁻¹ * b = a definition op_inv_cancel_right := ∀a b, a * b * b⁻¹ = a variable (op₂ : A → A → A) local notation a + b := op₂ a b definition left_distributive := ∀a b c, a * (b + c) = a * b + a * c definition right_distributive := ∀a b c, (a + b) * c = a * c + b * c end context variable {A : Type} variable {f : A → A → A} variable H_comm : commutative f variable H_assoc : associative f infixl `*` := f theorem left_comm : ∀a b c, a*(b*c) = b*(a*c) := take a b c, calc a*(b*c) = (a*b)*c : H_assoc ... = (b*a)*c : H_comm ... = b*(a*c) : H_assoc theorem right_comm : ∀a b c, (a*b)*c = (a*c)*b := take a b c, calc (a*b)*c = a*(b*c) : H_assoc ... = a*(c*b) : H_comm ... = (a*c)*b : H_assoc end context variable {A : Type} variable {f : A → A → A} variable H_assoc : associative f infixl `*` := f theorem assoc4helper (a b c d) : (a*b)*(c*d) = a*((b*c)*d) := calc (a*b)*(c*d) = a*(b*(c*d)) : H_assoc ... = a*((b*c)*d) : H_assoc end end binary Lean Lean https://github.com/leanprover/lean #print """" true true true true true 4 10 leanprover.github.io Lean https://github.com/leanprover/Lean.tmbundle 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 Lean 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 arduino Arduino Programming Language 2005 Massimo Banzi and David Cuartielles and Tom Igoe and Gianluca Martino and David Mellis 27 pl https://www.arduino.cc 0 https://blog.arduino.cc/ https://www.arduino.cc/en/software/ReleaseNotes 117 2 24686 true 0 pl 16079 20461 false a/Arduino.ino c_like.py 2003 atmel-avr x86-isa c processing basic-stamp arm java linux ia-32 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. 2006 2640 748 2471 5389424 The Arduino Programming Language is mostly C++ with The Arduino Programming Language is mostly C++ with Arduino The Arduino Programming Language is mostly C++ with ino ino https://github.com/liffiton/Arduino-Cheat-Sheet 527398 598 34 cpp 5 https://docs.arduino.cc/ Italy "void setup() { Serial.begin(9600); Serial.println(""Hello World""); } void loop() { }" Arduino https://www.reddit.com/r/arduino #define LED_PIN 13 // Pin number attached to LED. void setup() { pinMode(LED_PIN, OUTPUT); // Configure pin 13 to be a digital output. } void loop() { digitalWrite(LED_PIN, HIGH); // Turn on the LED. delay(1000); // Wait 1 second (1000 milliseconds). digitalWrite(LED_PIN, LOW); // Turn off the LED. delay(1000); // Wait 1 second. } Arduino Serial.println """" false true true https://en.wikipedia.org/wiki/Arduino 265 28 Arduino "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|Gö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" arduino developer 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 mojo Mojo 2022 Chris Lattner 24 pl https://www.modular.com/mojo 1 https://docs.modular.com/mojo/changelog.html 118 1 7 24673 true 1 cloc https://github.com/modularml/mojo pl 2023 2024 264 2554 22444 658 false 2023 2025 6160 229 870 30 205067 https://docs.modular.com/mojo/playground Mojo combines the usability of Python with the performance of C, unlocking unparalleled programmability of AI hardware and extensibility of AI models. Mojo combines the usability of Python with the performance of C, unlocking unparalleled programmability of AI hardware and extensibility of AI models. Modular Inc Mojo combines the usability of Python with the performance of C, unlocking unparalleled programmability of AI hardware and extensibility of AI models. mojo markdown jupyter-notebook yaml python bourne-shell cmake dockerfile false 30337 0 41 python c mlir zig swift llvmir python 1 false mojom https://docs.modular.com/mojo/ United States def softmax(lst): norm = np.exp(lst - np.max(lst)) return norm / norm.sum() struct NDArray: def max(self) -> NDArray: return self.pmap(SIMD.max) struct SIMD[type: DType, width: Int]: def max(self, rhs: Self) -> Self: return (self >= rhs).select(self, rhs) https://www.discord.gg/modular https://github.com/modularml/mojo # true 0 0 linux Linux 1991 Linus Torvalds 24 os https://www.kernel.org/ 0 https://www.kernel.org/category/site-news.html https://www.kernel.org/ 6.6 119 0 35 24671 false 0 https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git/ os false 979264 2235 Linux Kernel Organization, Inc 2005 2025 1336722 38415 87910 3271 40084248 1991 c assembly-language arc-isa arm hexagon mips nios powerpc risc-v sparc x86-isa android unix freebsd make 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 nano-editor emacs-editor mariadb mysql python ios opengl lisp "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." 2001 5655 17688 13108 6097297 c yaml restructuredtext make assembly-language bourne-shell json python svg perl bash rust clojure xml awk csv yacc lex cpp cmake xslt css umka html ini xsd gherkin tex m4 matlab vim-script ruby vtl-lang sed toml true 3267425 32007 63 1 false 6 true https://www.kernel.org/category/faq.html 882 Finland https://www.reddit.com/r/linux/ https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git/ https://www.meetup.com/topics/linux https://en.wikipedia.org/wiki/Linux 2 0 linux 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 maple Maple 1982 30 pl http://www.maplesoft.com/products/maple/ 0 https://faq.maplesoft.com/ https://www.maplesoft.com/download/ 120 2 24670 909 true 0 pl false 1982 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 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. 2002 231 421 776 79099 Cybernet Systems Co. Ltd 53310 511 32 https://www.maplesoft.com/documentation_center/ text 6311 http://www.rosettacode.org/wiki/Category:Maple https://www.maplesoft.com/applications/ Canada Maple "# Hello World in Maple >> printf(""Hello World!""); " https://twitter.com/maplesoft eqn:= f(x)-3*Int((x*y+x^2*y^2)*f(y), y=-1..1) = h(x): intsolve(eqn,f(x)); # printf false true true true false https://en.wikipedia.org/wiki/Maple_(software) 28 15 https://hopl.info/showlanguage.prx?exp=909 Maple 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 maple 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 jquery JQuery 2006 John Resig 24 library https://jquery.com 0 4.0.0-pre 121 1 10 24661 true 0 https://github.com/jquery/jquery library 2009 2024 3185 20617 59065 86 false 463942 670 2006 2025 8317 347 346 36 71109 2005 2006 javascript html visual-studio-editor css json xml "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." 2006 886 892 1344 7672626 https://jquery.org/team/ javascript html markdown yaml json php css xml bourne-shell svg https://cheatsheets.zip/jquery true 1675105 24780 34 1 false 4 true text Various https://www.reddit.com/r/jquery/ https://twitter.com/jquery $.ajax({ type: 'POST', url: '/process/submit.php', data: { name : 'John', location : 'Boston', }, }).done(function(msg) { alert('Data Saved: ' + msg); }).fail(function(xmlHttpRequest, statusText, errorThrown) { alert( 'Your form submission failed.\n\n' + 'XML Http Request: ' + JSON.stringify(xmlHttpRequest) + ',\nStatus Text: ' + statusText + ',\nError Thrown: ' + errorThrown); }); https://www.youtube.com/watch?v=xDfdTOgQsHo https://github.com/jquery/jquery https://www.meetup.com/topics/jquery https://en.wikipedia.org/wiki/JQuery 2 0 jquery.com jquery developer jquery 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 starlark starlark 2018 Laurent Le Brun 25 pl 22 122 2 5 24657 true 22 asterius-compiler bazel capn-proto carbon cir claro cloc closure-templates codeql flatbuffers jflex jsonnet kubernetes mongodb nodejs pcre pytorch tensorflow v8 wiredtiger xla yara https://github.com/bazelbuild/starlark pl 562 1141 BUCK BUILD BUILD.bazel Tiltfile WORKSPACE 3423 bazel or bzl python python text/x-python source.python programming 2018 2024 2018 58 158 2392 87 false s/Starlark.star 2018 2025 121 31 62 1 6190 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 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 https://github.com/bazelbuild 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 bzl star star markdown python bazel yaml bourne-shell true 2898 0 35 1 false bazel bzl United States https://bazel.build/contribute/policy "# Define a number number = 18 # Define a dictionary people = { ""Alice"": 22, ""Bob"": 40, ""Charlie"": 55, ""Dave"": 14, } names = "", "".join(people.keys()) # Alice, Bob, Charlie, Dave # Define a function def greet(name): """"""Return a greeting."""""" return ""Hello {}!"".format(name) greeting = greet(names) above30 = [name for name, age in people.items() if age >= 30] print(""{} people are above 30."".format(len(above30))) def fizz_buzz(n): """"""Print Fizz Buzz numbers from 1 to n."""""" for i in range(1, n + 1): s = """" if i % 3 == 0: s += ""Fizz"" if i % 5 == 0: s += ""Buzz"" print(s if s else i) fizz_buzz(20)" "print(""Hello World"") " Starlark https://github.com/bazelbuild/starlark # print """" true true true false true 0 0 Starlark Starlark mediawiki MediaWiki 2002 27 wikiMarkup https://en.wikipedia.org/wiki/MediaWiki#Markup https://www.mediawiki.org/wiki/Specs/wikitext/1.0.0 0 123 4 24647 true 2 texti wikitax wikiMarkup 10 0 false 70 2006 2018 2 8 wiki markup 2002 php linux freebsd solaris wordpress perl mysql rails javascript html python xml json latex ocaml jquery lua mariadb postgresql sqlite 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. 2003 610 6149 2948 323710 The syntax and keywords used by the MediaWiki software to format a page. The syntax and keywords used by the MediaWiki software to format a page. Wikimedia Foundation, Inc The syntax and keywords used by the MediaWiki software to format a page. mediawiki wiki true 7133 69 27 https://www.mediawiki.org/wiki/Documentation https://en.wikipedia.org/wiki/Help:Wikitext text 9998 United States https://doc.wikimedia.org/mediawiki-core/master/php/classParser.html = Heading 1 = Indentation as used on talk pages: :Each colon at the start of a line ::causes the line to be indented by three more character positions. :::(The indentation persists * Item1 * Item2 * Item3 * Item4 ** Sub-item 4 a) *** Sub-item 4 a) 1. **** Sub-item 4 a) 1. i) **** Sub-item 4 a) 1. ii) ** Sub-item 4 b) === Ordered Lists === * Item5 # Item1 # Item2 # Item3 # Item4 ## Sub-item 1 ### Sub-sub-item #### Sub-sub-sub-item ## Sub-item 2 # Item5 = Overview = The 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. = Getting Started = The feature can be installed from the Eclipse update site by selecting '''Linux Tools''' > '''GDB Tracepoint Analysis'''. The 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. = GDB Trace Perspective = To open the perspective, select '''Window''' > '''Open Perspective''' > '''Other...''' > '''GDB Trace'''. The perspective includes the following views by default: * '''Project Explorer''': This view shows the projects in the workspace and is used to create and manage Tracing projects. * '''Debug''': This view shows the running C/C++ Postmortem Debugger instances and displays the thread and stack trace associated with a tracepoint. * '''Trace Control''': This view shows the status of the debugger and allows navigation of trace records. * '''Console''': This view displays console output of the C/C++ Postmortem Debugger. The editor area contains the '''Events''' and '''C/C++''' editors when a GDB Trace is opened. [[Image:images/GDBTracePerspective.png]] = Collecting Tracepoint Data = Collecting 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. = Importing Tracepoint Data = Some 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. == Creating a Tracing Project == In 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'''. == Importing a GDB Trace == In 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'''. Alternatively, the trace can be drag & dropped to the '''Traces''' folder from any external file manager. == Selecting the GDB Trace Type == Right-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. The trace will be updated with the GDB icon [[Image:images/gdb_icon16.png]]. == Selecting the Trace Executable == The executable file that created the tracepoint data must be identified so that the C/C++ Postmortem Debugger can be launched properly. Right-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'''. The selected file must be recognized by GDB as an executable. = Visualizing Tracepoint Data = == Opening a GDB Trace == In the '''Traces''' folder, double-click the GDB trace or right-click it and select '''Open''' from the context menu. The tracepoint data will be opened in an Events editor, and a C/C++ Postmortem Debugger instance will be launched. If available in the workspace, the source code corresponding to the first trace record will also be opened in a C/C++ editor. At 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. == Viewing Trace Data == In 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. Searching and filtering can be done on any column by entering a regular expression in the column header. == Navigating the GDB Trace == Trace 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. The 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. = References = * [http://wiki.eclipse.org/index.php/Linux_Tools_Project/LTTng2/User_Guide LTTng User Guide] * [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?] = Updating This Document = This 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] https://riju.codes/mediawiki Hello, world! "
A dialogue
""Take some more tea,"" the March Hare said to Alice, very earnestly. ""I've had nothing yet,"" Alice replied in an offended tone: ""so I can't take more."" ""You mean you can't take less,"" said the Hatter: ""it's very easy to take more than nothing.""" https://en.wikipedia.org/wiki/MediaWiki 2 0 https://github.com/textmate/mediawiki.tmbundle 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 MediaWiki mediawiki developer mediawiki redis Redis 2009 Salvatore Sanfilippo 26 application https://redis.io/ 0 7.2.5 124 1 20 24642 false 0 https://github.com/antirez/redis application 2009 2024 2009 2545 23614 65816 2511 false 2009 2025 19416 913 1638 143 475085 2010 2009 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 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. 2009 707 140 577 24956915 Redis Ltd c json tcl bourne-shell markdown lua yaml make ruby xml python cpp html cmake m4 css bash javascript xslt svg https://cheatsheets.zip/redis true 200227 591 243 1 false 7 true text https://github.com/antlr/grammars-v4/tree/master/redis redis United States https://riju.codes/redis "ECHO ""Hello, world!"" " https://twitter.com/redisfeed Redis 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 https://github.com/antirez/redis true https://github.com/supercoderz/redis_kernel https://en.wikipedia.org/wiki/Redis 0 0 redis.io redis robotframework RobotFramework 2013 21 pl http://robotframework.org/ 3 v6.1.1 125 1 12 24641 true 3 ace cloc robotframework https://github.com/robotframework/robotframework pl 447 515 7602 0 text text.robot programming 2014 2024 2013 481 2297 9459 329 false 83 2012 2016 3 7 robotframework.py 2013 2025 15032 237 2494 162 352282 2007 Robot Framework ry robot robot resource robotframework python restructuredtext javascript xml json yaml html css xsd svg make true 16789 0 34 true 6 true robot https://robotframework.org/robotframework/ text Finland "*** Settings *** Documentation Example test case using the gherkin syntax. ... ... This test has a workflow similar to the keyword-driven ... examples. The difference is that the keywords use higher ... abstraction level and their arguments are embedded into ... the keyword names. ... ... This kind of _gherkin_ syntax has been made popular by ... [http://cukes.info|Cucumber]. It works well especially when ... tests act as examples that need to be easily understood also ... by the business people. Library CalculatorLibrary *** Test Cases *** Addition Given calculator has been cleared When user types ""1 + 1"" and user pushes equals Then result is ""2"" *** Keywords *** Calculator has been cleared Push button C User types ""${expression}"" Push buttons ${expression} User pushes equals Push button = Result is ""${result}"" Result should be ${result} " RobotFramework https://github.com/robotframework/robotframework 0 0 robotframework.org RobotFramework https://github.com/shellderp/sublime-robot-plugin RobotFramework flow Flow 2014 Avik Chaudhuri 24 pl https://flow.org/ 0 v0.236.0 126 1 18 24641 true 1 civet https://github.com/facebook/flow pl 2014 2024 2014 391 1852 22082 1207 false 2014 2025 21849 1043 15276 149 1228364 https://flow.org/try/ 2002 Javascript with static type checking. Javascript with static type checking. Facebook Javascript with static type checking. javascript json ocaml expect bourne-shell diff markdown c css make cpp dockerfile svg jsx yaml bash powershell python true 28683 0 43 1 false 0 true https://flow.org/en/docs/ United States "// @flow function square(n: number): number { return n * n; } square(""2""); // Error!" https://twitter.com/flowtype https://github.com/facebook/flow // true true false 14 25 flow.org "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" 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 sed sed 1974 Lee E. McMahon 29 pl 24 127 4 24638 782 true 24 arrow-format bash boomerang-decompiler eiffel erlang gforth groff hhvm java koka kubernetes latino linux ncl ngs nodejs opam-pm poke postgresql pygments recfiles rholang ruby tao3d pl 998 1075 322 0 gsed minised sed ssed text source.sed programming false s/Sed.sed 31 2018 2018 1 1 textedit.py 1974 c chomski perl awk unix regex grep vi vim "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." 2001 329 486 750 27163 Bell Labs sed sed sed [gs]sed https://cheatsheets.zip/sed 1865 0 30 1 sed https://tio.run/#sed https://www.gnu.org/software/sed/manual/sed.html text sed http://www.rosettacode.org/wiki/Category:Sed sed United States #!/usr/bin/sed -f sed.sed c\ Hello World q "# Towers of Hanoi in sed. # # @(#)hanoi.sed 8.1 (Berkeley) 6/6/93 # $FreeBSD$ # # # Ex: # Run ""sed -f hanoi.sed"", and enter: # # :abcd: : : # # note -- TWO carriage returns were once required, this will output the # sequence of states involved in moving 4 rings, the largest called ""a"" and # the smallest called ""d"", from the first to the second of three towers, so # that the rings on any tower at any time are in descending order of size. # You can start with a different arrangement and a different number of rings, # say :ce:b:ax: and it will give the shortest procedure for moving them all # to the middle tower. The rules are: the names of the rings must all be # lower-case letters, they must be input within 3 fields (representing the # towers) and delimited by 4 colons, such that the letters within each field # are in alphabetical order (i.e. rings are in descending order of size). # # For the benefit of anyone who wants to figure out the script, an ""internal"" # line of the form # b:0abx:1a2b3 :2 :3x2 # has the following meaning: the material after the three markers :1, :2, # and :3 represents the three towers; in this case the current set-up is # "":ab : :x :"". The numbers after a, b and x in these fields indicate # that the next time it gets a chance, it will move a to tower 2, move b # to tower 3, and move x to tower 2. The string after :0 just keeps track # of the alphabetical order of the names of the rings. The b at the # beginning means that it is now dealing with ring b (either about to move # it, or re-evaluating where it should next be moved to). # # Although this version is ""limited"" to 26 rings because of the size of the # alphabet, one could write a script using the same idea in which the rings # were represented by arbitrary [strings][within][brackets], and in place of # the built-in line of the script giving the order of the letters of the # alphabet, it would accept from the user a line giving the ordering to be # assumed, e.g. [ucbvax][decvax][hplabs][foo][bar]. # # George Bergman # Math, UC Berkeley 94720 USA # cleaning, diagnostics s/ *//g /^$/d /[^a-z:]/{a\ Illegal characters: use only a-z and "":"". Try again. d } /^:[a-z]*:[a-z]*:[a-z]*:$/!{a\ Incorrect format: use\ \ : string1 : string2 : string3 :\ Try again. d } /$[a-z]$.*\1/{a\ Repeated letters not allowed. Try again. d } # initial formatting h s/[a-z]/ /g G s/^:$ *$:$ *$:$ *$:\n:$[a-z]*$:$[a-z]*$:$[a-z]*$:$/:1\4\2\3:2\5\1\3:3\6\1\2:0/ s/[a-z]/&2/g s/^/abcdefghijklmnopqrstuvwxyz/ :a s/^$.$.*\1.*/&\1/ s/.// /^[^:]/ba s/$[^0]*$$:0.*$/\2\1:/ s/^[^0]*0$.$/\1&/ :b # outputting current state without markers h s/.*:1/:/ s/[123]//gp g :c # establishing destinations /^$.$.*\1:1/td /^$.$.*:1[^:]*\11/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\31/ /^$.$.*:1[^:]*\12/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\33/ /^$.$.*:1[^:]*\13/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\32/ /^$.$.*:2[^:]*\11/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\33/ /^$.$.*:2[^:]*\12/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\32/ /^$.$.*:2[^:]*\13/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\31/ /^$.$.*:3[^:]*\11/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\32/ /^$.$.*:3[^:]*\12/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\31/ /^$.$.*:3[^:]*\13/s/^$.$$.*\1\([a-z]$.*\)\3./\3\2\33/ bc # iterate back to find smallest out-of-place ring :d s/^$.$$:0[^:]*\([^:]$\1.*:$[123]$[^:]*\1\)\4/\3\2\4/ td # move said ring (right, resp. left) s/^$.$$.*$\1$[23]$$.*:\3[^ ]*$ /\1\2 \4\1\3/ s/^$.$$.*:\([12]$[^ ]*\) $.*$\1\3/\1\2\1\3\4 / tb s/.*/Done! Try another, or end with ^D./p d " Sed https://riju.codes/sed s/.*/Hello, world!/ This is my dog, whose name is Frank. This is my fish, whose name is George. This is my goat, whose name is Adam. Sed true true true https://en.wikipedia.org/wiki/Sed 6 0 https://hopl.info/showlanguage.prx?exp=782 sed sed https://github.com/Alhadis/language-sed 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 sed antlr ANTLR 1992 Terence Parr 35 grammarLanguage http://www.antlr.org 0 128 2 24635 1825 true 6 lllpg megaparsec parsers parsers particles scroll grammarLanguage 2571 2866 1415 2 "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.""" text source.antlr programming false 31 2005 2018 5 parsers.py 1997 1989 java actionscript c csharp javascript objective-c perl python ruby standard-ml swift go groovy jython processing coco-r javacc peg 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. 2004 103 60 253 765588 University of San Francisco g4 true 3048 30 42 1 g g4 https://github.com/antlr/antlr4/blob/master/doc/index.md text https://github.com/antlr/grammars-v4/tree/master/antlr/antlr2 http://www.rosettacode.org/wiki/Category:ANTLR United States "/** Taken from ""The Definitive ANTLR 4 Reference"" by Terence Parr */ // Derived from http://json.org grammar JSON; json : value ; obj : '{' pair (',' pair)* '}' | '{' '}' ; pair : STRING ':' value ; arr : '[' value (',' value)* ']' | '[' ']' ; value : STRING | NUMBER | obj | arr | 'true' | 'false' | 'null' ; STRING : '""' (ESC | SAFECODEPOINT)* '""' ; fragment ESC : '\\' ([""\\/bfnrt] | UNICODE) ; fragment UNICODE : 'u' HEX HEX HEX HEX ; fragment HEX : [0-9a-fA-F] ; fragment SAFECODEPOINT : ~ [""\\\u0000-\u001F] ; NUMBER : '-'? INT ('.' [0-9] +)? EXP? ; fragment INT : '0' | [1-9] [0-9]* ; // no leading zeros fragment EXP : [Ee] [+\-]? INT ; // \- since - means ""range"" inside [...] WS : [ \t\n\r] + -> skip ;" ANTLR https://twitter.com/the_antlr_guy TextReader reader; // (...) Fill TextReader with character SumLexer lexer = new SumLexer(reader); SumParser parser = new SumParser(lexer); parser.expression(); // /* */ true false true true true true false https://en.wikipedia.org/wiki/ANTLR 1 1 https://hopl.info/showlanguage.prx?exp=1825 antlr.org ANTLR https://github.com/textmate/antlr.tmbundle year|publisher|title|authors|isbn13\n20130115|O'Reilly Media, Inc.|The Definitive ANTLR 4 Reference|Terence Parr|9781680505009 ANTLR antlr engineer antlr 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 standard-ml Standard ML 1990 33 pl http://sml-family.org 14 129 4 24622 true 15 dynamo-visual-language elpi fun invokator jonprl k-framework mal mlpolyr mlscript mlscript mythryl netbeans-editor pygments redprl urweb pl 2046 2390 392047 2 "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 ""好耶是女装""" sml text mllike text/x-ocaml source.ml programming false s/Standard ML.sml 51 2006 2015 5 6 standardml ml.py 2014 1997 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 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). 2002 301 185 411 100337 Bell Labs && Princeton University sml ml fun sig sml sml sig fun sml 1726 0 https://exercism.org/tracks/standardml 40 fun sig sml http://www.cs.cmu.edu/~rwh/isml/book.pdf text Standard ML mlton United States https://www.smlnj.org/sml.html "fun hello() = print(""Hello World\n""); hello() " signature LAZY_BASE = sig type 'a lazy exception Undefined val force: 'a lazy -> 'a val delay: (unit -> 'a) -> 'a lazy val undefined: 'a lazy end signature LAZY' = sig include LAZY_BASE val isUndefined: 'a lazy -> bool val inject : 'a -> 'a lazy val toString: ('a -> string) -> 'a lazy -> string val eq: ''a lazy * ''a lazy -> bool val eqBy: ('a * 'a -> bool) -> 'a lazy * 'a lazy -> bool val compare: ('a * 'a -> order) -> 'a lazy * 'a lazy -> order val map: ('a -> 'b) -> 'a lazy -> 'b lazy structure Ops: sig val ! : 'a lazy -> 'a (* force *) val ? : 'a -> 'a lazy (* inject *) end end Standard ML https://riju.codes/standardml "print ""Hello, world!\n""; " - haar [1, 2, 3, 4, ~4, ~3, ~2, ~1]; val it = [0,20,4,4,~1,~1,~1,~1] : int list Standard ML # print false true false true https://en.wikipedia.org/wiki/Standard_ML 0 0 Standard ML sml-family.org Standard ML https://github.com/textmate/standard-ml.tmbundle Standard ML jq jq 2012 Stephen Dolan 21 queryLanguage https://stedolan.github.io/jq/ 0 130 1 17 24617 true 2 dasel mdq https://github.com/stedolan/jq queryLanguage 36 39 60 text source.jq programming 2012 2024 2012 327 1541 29719 455 false 2012 2025 1821 228 338 8 86912 https://github.com/stedolan/jq/issues jq c yaml bourne-shell m4 markdown python cpp json svg yacc make lex css html javascript dockerfile bash true 34572 0 https://exercism.org/tracks/jq 38 1 false https://tio.run/#jq http://www.rosettacode.org/wiki/Category:Jq Unknown jq https://jqplay.org/ https://riju.codes/jq """Hello, world!"" " https://github.com/stedolan/jq 0 0 jq jq idl IDL 1977 David Stern 39 pl http://www.exelisvis.com/ProductsServices/IDL.aspx 23 131 3 24615 760 true 23 cloc cmake deno eiffel emscripten flex gradle halide hhvm idyll j json-ld kotlin ladybird mongodb nodejs opencv postgresql pygments python racket ruby tiscript pl 4557 5298 2337 0 text idl text/x-idl source.idl programming false i/IDL 62 2012 2017 4 2 Interactive Data Language idl.py 1977 gdl pv-wave fortran c unix smalltalk matlab numpy python perl-data-language perl 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). 2004 202 123 274 512587 L3Harris Geospatial Solutions, Inc pro dlm pro 1281 0 44 1 dlm idl pro https://www.l3harrisgeospatial.com/docs/using_idl_home.html text https://github.com/antlr/grammars-v4/tree/master/idl idl http://www.rosettacode.org/wiki/Category:IDL United States https://www.harrisgeospatial.com/Software-Technology/IDL "IDL> ; Hello World in IDL (Interactive Data Language) IDL> print, ""Hello World"" " "print, ""Hello World"" end " MODULE mg_analysis DESCRIPTION Tools for analysis VERSION 1.0 SOURCE mgalloy BUILD_DATE January 18, 2011 FUNCTION MG_ARRAY_EQUAL 2 2 KEYWORDS FUNCTION MG_TOTAL 1 1 IDL IDL print """" true true true true true true false true https://github.com/lstagner/idl_kernel https://en.wikipedia.org/wiki/IDL_(programming_language) 9 10 https://hopl.info/showlanguage.prx?exp=760 IDL IDL https://github.com/mgalloy/idl.tmbundle 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 IDL 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 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 fstar F* 2014 35 pl https://www.fstar-lang.org/ 0 0.9.7 132 1 20 24614 true 2 lowstar vale-assembly https://github.com/FStarLang/FStar pl 28 31 250 fstar text source.fstar programming 2014 2024 2014 80 231 2659 501 false f/FStar.fst 28 2015 2018 8 ml.py 2014 2025 43633 225 4694 781 1011086 2014 2016 linux f-sharp ocaml standard-ml ml c javascript 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. 2013 53 21 50 38420593 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. 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. Microsoft 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. fst fsti fst fst fsti fst ocaml make bourne-shell markdown f-sharp python c dockerfile json xml assembly-language nix yaml bash clojure coq svg haskell csv lisp true 4064 0 111 false 0 true http://www.fstar-lang.org/tutorial/ text Unknown "module Hello let main = FStar.IO.print_string ""Hello World\n""" FStar FStar 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 https://github.com/FStarLang/FStar FStar.IO.print_string true false true true true true true true true true true https://en.wikipedia.org/wiki/F*_(programming_language) 0 1 fstar-lang.org F* https://github.com/FStarLang/atom-fstar F* 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 v V 2019 Alexander Medvednikov 31 pl https://vlang.io/ https://vlang.io/ 0 0.4.6 133 3 26 24613 true 0 https://github.com/vlang/v pl 44 45 1382 vlang golang go text/x-go source.v programming 2019 2024 2019 488 2148 35595 909 false v/V.v volt 2019 2025 19459 923 9184 89 1050726 2019 v v v coq markdown c html yaml xml glsl json toml svg bourne-shell css dockerfile javascript objective-c make python awk cpp csharp typescript go sql ruby tcl assembly-language true 42964 0 https://exercism.org/tracks/v 60 1 true 0 true https://github.com/vlang/v/blob/master/doc/docs.md https://github.com/antlr/grammars-v4/tree/master/v "import json struct User { name string age int mut: is_registered bool } fn main() { s := '[{""name"":""Frodo"", ""age"":25}, {""name"":""Bobby"", ""age"":10}]' mut users := json.decode([]User, s) or { eprintln('Failed to parse json') return } for user in users { println('$user.name: $user.age') } println('') for i, mut user in users { println('$i) $user.name') if !user.can_register() { println('Cannot register $user.name, they are too young') continue } // `user` is declared as `mut` in the for loop, // modifying it will modify the array user.register() } // Let's encode users again just for fun println('') println(json.encode(users)) } fn (u User) can_register() bool { return u.age >= 16 } fn (mut u User) register() { u.is_registered = true }" "println(""Hello World"") " https://reddit.com/r/vlang https://riju.codes/v fn main() { println('Hello, world!') } https://twitter.com/v_language V https://www.youtube.com/watch?v=zqUE-57Bb1M https://github.com/vlang/v https://github.com/vlang/v // println """" true true true false true 0 0 vlang.io V V katex KaTeX 2013 Emily Eisenberg 22 textMarkup https://katex.org 0 0.16.10 134 1 15 24599 true 2 mathjax mathjson https://github.com/Khan/KaTeX textMarkup 2013 2024 2013 284 1159 18057 418 false 2013 2025 2383 190 702 86 364234 The fastest math typesetting library for the web. The fastest math typesetting library for the web. https://github.com/KaTeX The fastest math typesetting library for the web. javascript markdown yaml json svg html python css bourne-shell perl less dockerfile xml make tex true 21726 0 38 1 false 0 true text United States % \f is defined as #1f(#2) using the macro \f\relax{x} = \int_{-\infty}^\infty \f\hat\xi\,e^{2 \pi i \xi x} \,d\xi https://github.com/Khan/KaTeX % true true false 0 0 katex.org dhall Dhall 2017 23 dataNotation https://dhall-lang.org/ 7 v23.0.0 135 2 13 24596 true 7 cloc dhall lamdu-editor lamdu mal purescript unison https://github.com/dhall-lang/dhall-lang dataNotation 46 60 817 haskell haskell text/x-haskell source.haskell programming 2017 2024 2017 63 173 4185 147 false 2017 2025 1086 100 3704 4 58089 https://dhall-lang.org/ https://github.com/dhall-lang dhall dhall markdown nix haskell svg bourne-shell html diff json css python javascript yaml true 4806 0 38 true 23 true dhall Various "-- ./company.dhall let Prelude = https://prelude.dhall-lang.org/v19.0.0/package.dhall sha256:eb693342eb769f782174157eba9b5924cf8ac6793897fc36a31ccbd6f56dafe2 let companyName = ""Example Dot Com"" let User = { name : Text, account : Text, age : Natural } let users : List User = [ { name = ""John Doe"", account = ""john"", age = 23 } , { name = ""Jane Smith"", account = ""jane"", age = 29 } , { name = ""William Allen"", account = ""bill"", age = 41 } ] let toEmail = \(user : User) -> ""${user.account}@example.com"" let Bio = { name : Text, age : Natural } let toBio = \(user : User) -> user.(Bio) let companySize = Prelude.List.length User users let greetingPage = '' Welcome to ${companyName}! Welcome to our humble company of ${Natural/show companySize} people! '' in { emails = Prelude.List.map User Text toEmail users , bios = Prelude.List.map User Bio toBio users , greetingPage = greetingPage }" https://riju.codes/dhall "{ output = ""Hello, world!"" }" https://twitter.com/dhall_lang https://github.com/dhall-lang/dhall-lang -- true true false 0 0 dhall-lang.org Dhall Dhall fennel Fennel 2016 Calvin Rose 29 pl lisp https://fennel-lang.org/ 5 1.4.2 136 2 7 24591 true 5 cloc fennel funl mal pygments https://github.com/bakpakin/fennel pl 12 12 207 fennel text source.fnl programming 2016 2024 2016 52 123 2369 9 false f/Fennel.fnl lisp.py 2016 2025 2266 87 130 4 22408 2018 https://lists.sr.ht/%7Etechnomancy/fennel fnl fnl fnl fennel markdown lua yaml make diff bourne-shell true 2827 0 40 1 true 1 true fnl Various ;; Sample: read the state of the keyboard and move the player accordingly (local dirs {:up [0 -1] :down [0 1] :left [-1 0] :right [1 0]}) (each [key delta (pairs dirs)] (when (love.keyboard.isDown key) (let [[dx dy] delta [px py] player x (+ px (* dx player.speed dt)) y (+ py (* dy player.speed dt))] (: world :move player x y)))) "(print ""Hello World"") " Fennel Fennel https://github.com/bakpakin/fennel ; print """" true true true true true false true 0 0 fennel-lang.org Fennel Fennel stata Stata 1985 William Gould 34 pl https://www.stata.com/ 2 137 3 24578 true 3 cloc jal-compiler jsl pl 867 1032 8344 0 text source.stata programming false 44 2009 2015 7 3 stata.py 1994 1985 c linux ascii excel-app "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." 2005 319 246 370 1809002 StataCorp do ado doh ihlp mata matah sthlp do ado false 2816 0 45 1 ado DO do doh ihlp mata matah sthlp https://www.stata.com/features/documentation/ text http://www.rosettacode.org/wiki/Category:Stata https://www.stata.com/manuals/rssc.pdf Stata http://www.haghish.com/statistics/stata-blog/stata-programming/ssc_stata_package_list.php "/* Hello world in Stata */ .program hello 1. display ""Hello, World!"" 2. end .hello " local MAXDIM 800 Stata https://twitter.com/stata "program define fizzbuzz args x forvalues i = 1(1)`x' { if mod(`i',15) == 0 { display ""fizzbuzz"" } else if mod(`i',5) == 0 { display ""buzz"" } else if mod(`i',3) == 0 { display ""fizz"" } else { display `i' } } end" // /* */ true true true false https://github.com/kylebarron/stata_kernel https://en.wikipedia.org/wiki/Stata 21 5 Stata stata.com Stata https://github.com/pschumm/Stata.tmbundle 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 Stata 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 delphi Delphi 1995 Anders Hejlsberg 45 pl https://www.embarcadero.com/products/delphi 0 https://blogs.embarcadero.com/ https://edn.embarcadero.com/article/40775 https://www.embarcadero.com/products/delphi/starter/free-download 138 3 24562 1963 true 0 pl 213 240 false d/Delphi.pas 2368 24 Embarcadero Delphi pascal.py 9 2006 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 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. 2018 765 303 3 349208 Idera, Inc. pas pas dpr false 7084 181 50 1 false https://ml4ai.github.io/delphi/ https://www.embarcadero.com/events https://www.embarcadero.com/products/delphi/faq text http://www.rosettacode.org/wiki/Category:Delphi United States Delphi http://delphi.wikia.com/wiki/Delphi_File_Extensions // Hello World in Delphi Program Hello_World; {$APPTYPE CONSOLE} Begin WriteLn('Hello World'); End. program HelloWorld; {$APPTYPE CONSOLE} begin WriteLn('Hello World'); end. Delphi https://reddit.com/r/delphi procedure TForm1.ShowSomethingOnCreate; begin Label1.Text := 'Hello World!'; end; Delphi https://www.meetup.com/topics/delphi // { } WriteLn ' true true true true true false true https://en.wikipedia.org/wiki/Delphi_(programming_language) 88 3 https://hopl.info/showlanguage.prx?exp=1963 Delphi/Object Pascal Delphi 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 delphi engineer 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 abap ABAP 1983 47 pl http://scn.sap.com/community/abap 1 https://blogs.sap.com/tags/833755570260738661924709785639136/ https://help.sap.com/docs/BTP/4726775c8bfc483abb210252604515b2/e9b10e43016e423ab0efe91e668a6efc.html 139 3 24560 true 1 ace pl 387 450 4488 0 abap source.abap programming false a/ABAP.abap 42 2012 2018 1 4 Advanced Business Application Programming business.py 40 1983 objective-c cobol sql java unix solaris linux systemz eclipse-editor "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." 2003 439 181 1472 271832 SAP abap abap abap ABAP 2416 283 https://exercism.org/tracks/abap 1037 abap https://help.sap.com/doc/abapdocu_755_index_htm/7.55/en-US/index.htm https://blogs.sap.com/2020/04/21/abap-community-online-events/ text abap http://www.rosettacode.org/wiki/Category:ABAP ABAP REPORT ZHELLO_WORLD. START-OF-SELECTION. WRITE: 'Hello World'. "*/** * The MIT License (MIT) * Copyright (c) 2012 René van Mil * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * ""Software""), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED ""AS IS"", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ *----------------------------------------------------------------------* * CLASS CL_CSV_PARSER DEFINITION *----------------------------------------------------------------------* * *----------------------------------------------------------------------* class cl_csv_parser definition public inheriting from cl_object final create public . public section. *""* public components of class CL_CSV_PARSER *""* do not include other source files here!!! type-pools abap . methods constructor importing !delegate type ref to if_csv_parser_delegate !csvstring type string !separator type c !skip_first_line type abap_bool . methods parse raising cx_csv_parse_error . protected section. *""* protected components of class CL_CSV_PARSER *""* do not include other source files here!!! private section. *""* private components of class CL_CSV_PARSER *""* do not include other source files here!!! constants _textindicator type c value '""'. ""#EC NOTEXT data _delegate type ref to if_csv_parser_delegate . data _csvstring type string . data _separator type c . type-pools abap . data _skip_first_line type abap_bool . methods _lines returning value(returning) type stringtab . methods _parse_line importing !line type string returning value(returning) type stringtab raising cx_csv_parse_error . endclass. ""CL_CSV_PARSER DEFINITION *----------------------------------------------------------------------* * CLASS CL_CSV_PARSER IMPLEMENTATION *----------------------------------------------------------------------* * *----------------------------------------------------------------------* class cl_csv_parser implementation. * ---------------------------------------------------------------------------------------+ * | Instance Public Method CL_CSV_PARSER->CONSTRUCTOR * +-------------------------------------------------------------------------------------------------+ * | [--->] DELEGATE TYPE REF TO IF_CSV_PARSER_DELEGATE * | [--->] CSVSTRING TYPE STRING * | [--->] SEPARATOR TYPE C * | [--->] SKIP_FIRST_LINE TYPE ABAP_BOOL * +-------------------------------------------------------------------------------------- method constructor. super->constructor( ). _delegate = delegate. _csvstring = csvstring. _separator = separator. _skip_first_line = skip_first_line. endmethod. ""constructor * ---------------------------------------------------------------------------------------+ * | Instance Public Method CL_CSV_PARSER->PARSE * +-------------------------------------------------------------------------------------------------+ * | [!CX!] CX_CSV_PARSE_ERROR * +-------------------------------------------------------------------------------------- method parse. data msg type string. if _csvstring is initial. message e002(csv) into msg. raise exception type cx_csv_parse_error exporting message = msg. endif. "" Get the lines data is_first_line type abap_bool value abap_true. data lines type standard table of string. lines = _lines( ). field-symbols type string. loop at lines assigning . "" Should we skip the first line? if _skip_first_line = abap_true and is_first_line = abap_true. is_first_line = abap_false. continue. endif. "" Parse the line data values type standard table of string. values = _parse_line( ). "" Send values to delegate _delegate->values_found( values ). endloop. endmethod. ""parse * ---------------------------------------------------------------------------------------+ * | Instance Private Method CL_CSV_PARSER->_LINES * +-------------------------------------------------------------------------------------------------+ * | [<-()] RETURNING TYPE STRINGTAB * +-------------------------------------------------------------------------------------- method _lines. split _csvstring at cl_abap_char_utilities=>cr_lf into table returning. endmethod. ""_lines * ---------------------------------------------------------------------------------------+ * | Instance Private Method CL_CSV_PARSER->_PARSE_LINE * +-------------------------------------------------------------------------------------------------+ * | [--->] LINE TYPE STRING * | [<-()] RETURNING TYPE STRINGTAB * | [!CX!] CX_CSV_PARSE_ERROR * +-------------------------------------------------------------------------------------- method _parse_line. data msg type string. data csvvalue type string. data csvvalues type standard table of string. data char type c. data pos type i value 0. data len type i. len = strlen( line ). while pos < len. char = line+pos(1). if char <> _separator. if char = _textindicator. data text_ended type abap_bool. text_ended = abap_false. while text_ended = abap_false. pos = pos + 1. if pos < len. char = line+pos(1). if char = _textindicator. text_ended = abap_true. else. if char is initial. "" Space concatenate csvvalue ` ` into csvvalue. else. concatenate csvvalue char into csvvalue. endif. endif. else. "" Reached the end of the line while inside a text value "" This indicates an error in the CSV formatting text_ended = abap_true. message e003(csv) into msg. raise exception type cx_csv_parse_error exporting message = msg. endif. endwhile. "" Check if next character is a separator, otherwise the CSV formatting is incorrect data nextpos type i. nextpos = pos + 1. if nextpos < len and line+nextpos(1) <> _separator. message e003(csv) into msg. raise exception type cx_csv_parse_error exporting message = msg. endif. else. if char is initial. "" Space concatenate csvvalue ` ` into csvvalue. else. concatenate csvvalue char into csvvalue. endif. endif. else. append csvvalue to csvvalues. clear csvvalue. endif. pos = pos + 1. endwhile. append csvvalue to csvvalues. "" Don't forget the last value returning = csvvalues. endmethod. ""_parse_line endclass. ""CL_CSV_PARSER IMPLEMENTATION" ABAP "* First define structured type TYPES: BEGIN OF t_vbrk, VBELN TYPE VBRK-VBELN, ZUONR TYPE VBRK-ZUONR, END OF t_vbrk. * Now define internal table of our defined type t_vbrk DATA : gt_vbrk TYPE STANDARD TABLE OF t_vbrk, gt_vbrk_2 TYPE STANDARD TABLE OF t_vbrk. ""easy to define more tables * If needed, define structure (line of internal table) * Definition with type or with reference to internal table: DATA : gs_vbrk TYPE t_vbrk, gs_vbrk2 LIKE LINE OF gt_vbrk2. * You can also define table type if needed TYPES tt_vbrk TYPE STANDARD TABLE OF t_vbrk." ABAP 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 * ' true false true true true true true true true true true false true true true false https://en.wikipedia.org/wiki/ABAP 55 2 Abap ABAP ABAP https://github.com/pvl/abap.tmbundle 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 ABAP abap developer 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 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 z-shell Z shell 1990 Paul Falstad 34 pl http://www.zsh.org/ 21 140 2 24556 2642 true 21 crystal ecr git iterm2 jinx kalyn kubernetes lift mu mycroft oil opa opam-pm pomsky ruby rust saltstack score tibet vcpkg-pm wart pl false z-shell.png z/Z Shell.zsh zsh 1998 1990 c bourne-shell bash korn-shell tcp ftp The Z shell (Zsh) is a Unix shell that can be used as an interactive login shell and as a powerful command interpreter for shell scripting. Zsh is an extended Bourne shell with a large number of improvements, including some features of Bash, ksh, and tcsh. 2002 261 59 229 95928 Princeton University .ZSH true 1326 0 39 1 https://www.youtube.com/watch?v=MSPu-lYF-A8 zsh https://tio.run/#https://rootnroll.com/d/oh-my-zsh/ https://zsh.sourceforge.io/Doc/Release/Introduction.html text zsh zsh United States https://git.code.sf.net/p/zsh/code "#!/bin/zsh echo ""Hello World"" " https://riju.codes/zsh "echo ""Hello, world!"" " Z Shell # echo """" true true true https://en.wikipedia.org/wiki/Z_shell 0 0 https://hopl.info/showlanguage.prx?exp=2642 Z shell zsh.org sass Sass 2006 Hampton Lintorn-Catlin 30 stylesheetLanguage http://sass-lang.com/ 2 141 4 24543 true 2 ace txtzyme stylesheetLanguage 439 466 8972 0 sass sass text/x-sass source.sass markup false s/Sass.sass 158 2008 2017 1 39 syntactically awesome stylesheets css.py 2009 2006 ruby yaml haml less stylus css php c java go eclipse-editor emacs-editor visual-studio-editor vim visual-studio-code-editor "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." 2008 594 84 256 20770982 https://github.com/sass sass sass sass sass scss https://cheatsheets.zip/sass true 3241 0 32 1 sass https://sass-lang.com/documentation/ text sass Various "body::before content: ""Hello World"" " $blue: #3bbfce $margin: 16px .content-navigation border-color: $blue color: darken($blue, 9%) .border padding: $margin / 2 margin: $margin / 2 border-color: $blue Sass https://riju.codes/sass "body:before content: ""Hello, world!"" " https://twitter.com/sasscss .error, .badError { border: 1px #f00; background: #fdd; } .error.intrusion, .badError.intrusion { font-size: 1.3em; font-weight: bold; } .badError { border-width: 3px; } Sass """" true true true https://en.wikipedia.org/wiki/Sass_(stylesheet_language) 7 1 sass-lang.com Sass https://github.com/nathos/sass-textmate-bundle 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 Sass 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 actionscript ActionScript 1998 Gary Grossman 34 pl 6 142 3 24539 true 6 ace haxe jflex linearml monkeyx pygments pl 7197 8748 24615 0 actionscript 3 or actionscript3 or as3 actionscript source.actionscript.3 programming false a/ActionScript.as 973 2007 2016 2 9 actionscript.py 1999 javascript java haxe hypertalk hypercard ios android json opengl xml mxml 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. 2004 282 934 1221 519691 Macromedia as as as 1630 88 39 1 as https://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/index.html text http://www.rosettacode.org/wiki/Category:ActionScript "package { import flash.display.Sprite; import flash.text.TextField; public class actionscript extends Sprite { private var hello:TextField = new TextField(); public function actionscript(){ hello.text = ""Hello World""; addChild(hello); } } } " "package mypackage { public class Hello { /* Let's say hello! * This is just a test script for Linguist's Actionscript detection. */ public function sayHello():void { trace(""Hello, world""); } } } " ActionScript private function getNeighbours(_arg1:int, _arg2:int):Array{ var _local3:Array = -(((null - !NULL!) % ~(undefined))); var _local4:*; var _local5:*; var _local6:*; _local3 = new Array(); _local4 = 0; for (;//unresolved jump , _arg2 < 8;_local4++) { _local5 = (_arg1 + int(!NULL!)); _local6 = (_arg2 + int(!NULL!)); if (true){ _arg1 = (((//unresolved nextvalue or nextname << !NULL!) + !NULL!) << undefined); _arg1 = (!(!NULL!) ^ !NULL!); (!NULL! instanceof !NULL!); var _local1 = (((!NULL! as !NULL!) + !NULL!) == this); if (!(!NULL! == !NULL!)){ -((true << !NULL!)).push(Cell(cells[_local5][_local6])); } } if (!true){ (_local6 < 0); (_local6 < 0); (_local5 < 0); } } return (_local3); } ActionScript /* */ trace """" false true true true true true true true false true https://en.wikipedia.org/wiki/ActionScript 108 2 ActionScript ActionScript https://github.com/simongregory/actionscript3-tmbundle 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 ActionScript ActionScript developer 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 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 ejs EJS 2010 Tj Holowaychuk 19 template 11 1.0.0 143 2 8 24538 true 11 ace cloc codeql ejs exkited kotlin mathpix-markdown skulpt snowman-decompiler sqrl wyvern https://github.com/tj/ejs template 560 614 92857 0 ejs text.html.js markup 2010 2024 2010 139 512 4469 117 false 5 2011 2016 2 3 2010 2015 228 35 50 1 2304 https://apex.sh ejs ect ejst jst ejs javascript html markdown make json yaml css https://cheatsheets.zip/ejs true 6241 0 28 1 true 1 true ejs text United Kingdom <% if (user) { %>
<%= user.name %>
<% } %> "<% include parts/depend %>
<% if (user.primaryAccount == ""teacher"") { %> <% include teacher/sidebar %> <% include teacher/dashboard %> <% } else if (user.primaryAccount == ""student"") { %> <% include student/sidebar %> <% include student/dashboard %> <% } else { %>
There seems to be a problem
<% } %>
" https://github.com/tj/ejs 0 0 EJS https://github.com/gregory-m/ejs-tmbundle EJS postcss PostCSS 2013 Andrey Sitnik 27 textMarkup https://postcss.org/ 0 8.4.38 144 2 5 24528 true 0 https://github.com/postcss/postcss textMarkup 0 0 CSS text source.postcss markup 2013 2024 2013 514 1559 28357 19 false p/PostCSS.pcss 231 2013 2017 1 10 2013 2025 4161 451 105 12 22971 2015 https://github.com/postcss pcss postcss pcss typescript javascript markdown yaml json true 33687 0 35 1 false 8 true https://postcss.org/docs/ text Various "body::before { content: ""Hello World""; }" "@define-mixin size $size { width: $size; } $big: 100px; /* Main block */ .block { &_logo { background: inline(""./logo.png""); @mixin size $big; } }" https://twitter.com/postcss PostCSS https://github.com/postcss/postcss /* */ """" true true false true 0 0 postcss.org https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS PostCSS pandas Pandas 2008 Wes McKinney 23 library https://pandas.pydata.org 0 v2.2.2 145 1 19 24518 true 0 https://github.com/pandas-dev/pandas/ library 2010 2024 1114 17654 42838 3689 false 2009 2025 38829 3955 2622 370 865476 2017 python cython c matplotlib numpy scipy r scikit-learn "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." 2013 277 46 113 38833779 https://github.com/pandas-dev python restructuredtext html cython svg yaml csv markdown c json bourne-shell meson css xml dockerfile toml xslt jupyter-notebook bash https://cheatsheets.zip/pandas true 101162 341 42 1 false 2 true text Various https://twitter.com/pandas_dev ">>>import pandas as pd Series >>>s = pd.Series([1, 3, 5, np.nan, 6, 8]) DataFrame >>> import pandas as pd >>>df = pd.DataFrame(np.random.randn(6, 4), index=dates, columns=list(""ABCD"")) >>> df.head() >>>df.tail() Quick Statistics summary of data >>> df.describe() Indexing" https://github.com/pandas-dev/pandas/ true true true https://en.wikipedia.org/wiki/Pandas_(software) 3 0 pandas.pydata.org pandas engineer 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 verilog Verilog 1984 Phil Moorby and Prabhu Goel 49 hardwareDescriptionLanguage 0 146 5 24515 1062 true 0 hardwareDescriptionLanguage 2408 2985 48035 3 "author name avatar url language languageColor stars forks currentPeriodStars description\nSI-RISCV e200_opensource https://github.com/SI-RISCV.png https://github.com/SI-RISCV/e200_opensource Verilog #b2b7f8 899 409 57 ""The Ultra-Low Power RISC Core""\ncliffordwolf picorv32 https://github.com/cliffordwolf.png https://github.com/cliffordwolf/picorv32 Verilog #b2b7f8 966 254 29 ""PicoRV32 - A Size-Optimized RISC-V CPU""" verilog verilog text/x-verilog source.verilog programming false v/Verilog.v 16 2008 2015 13 3 hdl.py 50 1984 systemverilog c vhdl openvera property-specification-language Verilog, standardized as IEEE 1364, is a hardware description language (HDL) used to model electronic systems. It is most commonly used in the design and verification of digital circuits at the register-transfer level of abstraction. It is also used in the verification of analog circuits and mixed-signal circuits, as well as in the design of genetic circuits. 2002 497 515 738 63863 v v veo v v v 5176 246 137 2 https://verilogguide.readthedocs.io/en/latest/ text https://github.com/antlr/grammars-v4/tree/master/verilog/verilog verilog Verilog http://www.rosettacode.org/wiki/Category:Verilog iverilog United States "/* Hello World in Verilog. */ module main; initial begin $display(""Hello, World""); $finish ; end endmodule " "module main; initial begin $display(""Hello World""); $finish; end endmodule " `timescale 1ns / 1ps // Copyright (C) 2008 Schuyler Eldridge, Boston University // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see . module mux(opA,opB,sum,dsp_sel,out); input [3:0] opA,opB; input [4:0] sum; input [1:0] dsp_sel; output [3:0] out; reg cout; always @ (sum) begin if (sum[4] == 1) cout <= 4'b0001; else cout <= 4'b0000; end reg out; always @(dsp_sel,sum,cout,opB,opA) begin if (dsp_sel == 2'b00) out <= sum[3:0]; else if (dsp_sel == 2'b01) out <= cout; else if (dsp_sel == 2'b10) out <= opB; else if (dsp_sel == 2'b11) out <= opA; end endmodule verilog https://reddit.com/r/Verilog https://riju.codes/verilog "module main; initial begin $display(""Hello, world!""); end endmodule" "initial a = 0; initial b = a; initial begin #1; $display(""Value a=%d Value of b=%d"",a,b); end" Verilog always assign automatic begin case casex casez cell config deassign default defparam design disable edge else end endcase endconfig endfunction endgenerate endmodule endprimitive endspecify endtable endtask event for force forever fork function generate genvar if ifnone incdir include initial inout input instance join liblist library localparam macromodule module negedge noshowcancelled output parameter posedge primitive pulsestyle_ondetect pulsestyle_onevent reg release repeat scalared showcancelled signed specify specparam strength table task tri tri0 tri1 triand wand trior wor trireg unsigned use vectored wait while wire // /* */ $display """" true true true true true true true true true true true false true true true https://en.wikipedia.org/wiki/Verilog 34 18 https://hopl.info/showlanguage.prx?exp=1062 Verilog Verilog https://github.com/textmate/verilog.tmbundle year|publisher|title|authors|isbn13\n2016|McGraw Hill TAB|Programming FPGAs: Getting Started with Verilog|Monk, Simon|9781259643767\n2019|Pearson|Verilog Styles for Synthesis of Digital Systems|Smith, David R and Franzon, Paul D|9780201618600\n2007|CRC Press|Verilog HDL: Digital Design and Modeling|Cavanagh, Joseph|9781420051544\n1998|Springer|The Complete Verilog Book|Sagdeo, Vivek|9780792381884\n2005|Charles River Media|HDL Programming Fundamentals: VHDL and Verilog (DaVinci Engineering)|Botros, Nazeih M|9781584508557\n2007|Cambridge University Press|Designing Digital Computer Systems with Verilog|Lilja, David J. and Sapatnekar, Sachin S.|9780521045728\n20130418|Springer Nature|The Verilog PLI Handbook|Stuart Sutherland|9781461550174\n2016|McGraw Hill TAB|Programming FPGAs: Getting Started with Verilog|Monk, Simon|9781259643774\n2017|McGraw-Hill Education|Digital System Design with FPGA: Implementation Using Verilog and VHDL|Unsalan, Cem and Tar, Bora|9781259837913\n1996|Prentice Hall PTR|Verilog HDL|Palnitkar, Samir|9780134516752\n2019|Wiley|Digital Logic: With an Introduction to Verilog and FPGA-Based Design|Rafiquzzaman, M. and McNinch, Steven A.|9781119621546\n2019|Wiley|Digital Logic: With an Introduction to Verilog and FPGA-Based Design|Rafiquzzaman, M. and McNinch, Steven A.|9781119621638\n1998|Pearson College Div|Verilog Digital Computer Design: Algorithms into Hardware|Arnold, Mark Gordon|9780136392538\n1999|Star Galaxy Pub|A Verilog HDL Primer, Second Edition|Bhasker, J.|9780965039178\n2002|Springer|The Verilog PLI Handbook: A User’s Guide and Comprehensive Reference on the Verilog Programming Language Interface (The Springer International Series in Engineering and Computer Science (666))|Sutherland, Stuart|9780792376583\n1999|Springer|Principles of Verilog PLI|Mittra, Swapnajit|9780792384779\n1999|Springer|The Verilog PLI Handbook: A User's Guide and Comprehensive Reference on the Verilog Programming Language Interface|Sutherland, Stuart|9780792384892\n2013-04-18T00:00:01Z|Springer|The Verilog PLI Handbook: A User’s Guide and Comprehensive Reference on the Verilog Programming Language Interface (The Springer International Series in Engineering and Computer Science (666))|Sutherland, Stuart|9781475783711\n2012|Springer|The Verilog PLI Handbook: A User’s Guide and Comprehensive Reference on the Verilog Programming Language Interface|Sutherland, Stuart|9781461372790\n2015|LAP LAMBERT Academic Publishing|Dual Core RISC Processor with configurable hardware using VERILOG|Kumar, Nishant and Aggrawal, Ekta|9783659417887\n2014|GRIN Publishing|Verilog Design of a Pedestrian Crossing: Verilog Programming|Gondhalekar, Ninad|9783656845027\n2012|LAP LAMBERT Academic Publishing|A HDL & Verilog Code: Simulated Output|Sudhan, Manu and S., Manjunatha|9783848423248\n2011-10-08T00:00:01Z|Springer|The Verilog PLI Handbook: A User's Guide and Comprehensive Reference on the Verilog Programming Language Interface|Sutherland, Stuart|9781461550181\n2021|Cengage Learning|HDL Programming Fundamentals: VHDL and Verilog (Davinci Engineering)|Botros|9788131502013\n1999|Pearson Education|Verilog Designer's Library|Bob Zeidman|9780132441582\n20060418|Springer Nature|The Verilog PLI Handbook|Stuart Sutherland|9780306476655\n20121206|Springer Nature|Principles of Verilog PLI|Swapnajit Mittra|9781461551614\n2011-09-20|Wiley|FPGA Prototyping by Verilog Examples|Pong P. Chu|9781118210611\n03/2015|Mercury Learning and Information|HDL with Digital Design VHDL and Verilog|Nazeih Botros|9781942270287\n2021-12-10|Wiley|Digital VLSI Design and Simulation with Verilog|Suman Lata Tripathi and Sobhit Saxena and Sanjeet K. Sinha and Govind S. Patel|9781119778066\n2005|McGraw-Hill Professional Publishing|Verilog Digital System Design: RT Level Synthesis, Testbench and Verification|Zainalabedin Navabi|9780071445658 Verilog verilog developer year|title|doi|citations|influentialCitations|authors|paperId\n2003|Verilog HDL|10.1201/9781315219547|60|7|S. Palnitkar|12b01362e0f2c133a8620d6d6746a839f4b02982\n2003|Verilog HDL, powered by PLI: a suitable framework for describing and modeling asynchronous circuits at all levels of abstraction|10.1145/775832.775917|50|1|Arash Saifhashemi and H. Pedram|f06f4e9b01a446ad3ecd785751bb1f0bc727f050\n1999|The Verilog PLI Handbook|10.1007/b116513|37|4|S. Sutherland|00dce6a5797c44dba1313774a1b9d61a388a355c\n1996|The Verilog Procedural Interface for the Verilog Hardware Description Language|10.1109/IVC.1996.496013|26|2|C. Dawson and S. Pattanam and D. Roberts|78033ca1ee054dedc610e22cdb0550a0ee4a11f2\n2000|An animatable operational semantics of the Verilog hardware description language|10.1109/ICFEM.2000.873820|25|0|Jonathan P. Bowen and Jifeng He and Qiwen Xu|d500d55aed7a737378eeb529213b45d53ee7f88b\n1999|Verischemelog: Verilog embedded in Scheme|10.1145/331960.331978|21|1|J. Jennings and Eric Beuscher|2d3f3e8149af1901341eb6740430393b0360df62\n2003|An Algebraic Approach to the VERILOG Programming|10.1007/978-3-540-40007-3_5|11|0|H. Jifeng|fc745adcef2a1519155c07f903ebe70918477d3b\n2011|GCC2Verilog Compiler Toolset for Complete Translation of C Programming Language into Verilog HDL|10.4218/etrij.11.0110.0654|11|0|Giang Nguyen Thi Huong and S. Kim|f759a43b5e1aca4eb8d85d2a10444ab3fcf18c0c\n2014|FBDtoVerilog 2.0: An Automatic Translation of FBD into Verilog to Develop FPGA|10.1109/ICISA.2014.6847402|10|0|Dong-Ah Lee and Eui-Sub Kim and Junbeom Yoo and Jang-Soo Lee and J. Choi|9335cf6436e7a5ab0f6be2c37ad3702082f39875\n2000|Combining Operational Semantics, Logic Programming and Literate Programming in the Specification and Animation of the Verilog Hardware Description Language|10.1007/3-540-40911-4_16|10|0|Jonathan P. Bowen|5deda61155eb8aeb4540ad5ecf443a7228899bbb\n1998|Verilog plus C language modeling with PLI 2.0: The next generation simulation language|10.1109/IVC.1998.660687|6|0|S. Meyer|c8eaeb296d7c077e571a26f95a01efe2f2029e58\n1994|The PowerPC 603 C++ Verilog interface model|10.1109/CMPCON.1994.282909|5|0|R. P. Voith|73ac82fcff57ef2a5a81eb167fc51515184aaba5\n1996|Faster Verilog simulations using a cycle based programming methodology|10.1109/IVC.1996.496014|5|1|M. Becker|0b6abbaedaeed268005a26aa72f9bcf36789a920\n2020|DAVE: Deriving Automatically Verilog from English|10.1145/3380446.3430634|3|1|H. Pearce and Benjamin Tan and R. Karri|5bb4f4be3aad75da5a64a52b56e697ee6df71e39\n2004|Introduction to Verilog|10.1002/0471723002.CH2|1|0|T. R. Padmanabhan and B. T. Sundari|5c855df6ed85074d6adae0f10f0683d9b28ab02c\n2012|Principles of Verilog PLI|10.1007/978-1-4615-5161-4|1|1|S. Mittra|00b84822867ddbe569681df411fd7733ea273f88\n2011|FeatureVerilog: Extending Verilog to Support Feature-Oriented Programming|10.1109/IPDPS.2011.167|1|0|Jun Ye and QingPing Tan and Tun Li and GuoRong Cao|9241d6183956e7e47fac20a91a9a9b6ad22ef72b\n2021|Comparative Analysis between Verilog and Chisel in RISC-V Core Design and Verification|10.1109/ISOCC53507.2021.9614007|1|0|Jaekyung Im and Seokhyeong Kang|8e173c2d102219a0e155cbf73b63613cca2df2e0 title|year|author|goodreadsId|rating|ratings|reviews\nHDL Programming Fundamentals: VHDL and Verilog [With CD-ROM]|2005|Nazeih M. Botros|382542|4.15|55|5\nProgramming Fpgas: Getting Started with Verilog||Simon Monk|50000071|3.89|9|2\nComputer Arithmetic And Verilog Hdl Fundamentals|2009|Joseph Cavanagh|7046981|4.70|10|1 pony Pony 2012 Sylvan Clebsch 38 pl https://www.ponylang.org/ 0 0.58.4 147 4 13 24513 true 0 https://github.com/ponylang/ponyc pl 59 78 549 0 text source.pony programming 2012 2024 143 412 5654 266 false p/Pony.pony 32 2014 2018 6 10 pony.py 2012 2025 7569 272 1100 22 198720 2015 https://github.com/ponylang pony pony pony c markdown cpp yaml bash dockerfile cmake dtrace powershell make d llvmir ini true 8036 0 54 1 false 0 true pony https://tio.run/#pony text http://www.rosettacode.org/wiki/Category:Pony Various "actor Main new create(env: Env) => env.out.print(""Hello, world!"")" actor Main var _env: Env new create(env: Env) => _env = env square(3) fun square(num: I32): I32 => num * num "actor Main new create(env: Env) => env.out.print(""Hello World"") " "actor Main new create(env: Env) => env.out.print(""Hello, world."") " Pony https://reddit.com/r/ponylang https://twitter.com/ponylang Pony Pony https://github.com/ponylang/ponyc env.out.print """" true true true true true true true true 0 0 ponylang.org Pony https://github.com/CausalityLtd/sublime-pony Pony ballerina Ballerina 2015 Sanjiva Weerawarana and James Clark and Sameera Jayasoma and Hasitha Aravinda and Srinath Perera and Frank Leymann 37 pl http://ballerina.io/ 0 v2201.9.0 148 3 19 24502 true 0 https://github.com/ballerina-platform/ballerina-lang pl 21 22 1483 0 text source.ballerina programming 2016 2024 2014 164 736 3556 1686 false b/Ballerina.bal 58 2018 2018 5 7 2014 2025 134978 746 23598 916 2273729 https://play.ballerina.io/ 2017 2015 java go rust 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. 2018 37 12 42 57629994 WSO2 bal bal java java json toml markdown gradle xml yaml mustache html sql csv javascript svg bash bourne-shell css groovy dtd handlebars true 7917 0 https://exercism.org/tracks/ballerina 64 6 false 2201 false https://ballerina.io/learn/ text https://central.ballerina.io/ United States "import ballerina/io; public function main() { io:println(""Hello World""); } " "import ballerina.lang.system; function main (string[] args) { system:println(""Hello, World!""); } " https://twitter.com/ballerinalang "// The simplest hello world REST API // To run it: // ballerina run demo.bal // To invoke: // curl localhost:9090/hello/hi import ballerina/http; service hello bind {port:9090} { hi (endpoint caller, http:Request request) { http:Response res; res.setTextPayload(""Hello World!\n""); _ = caller->respond(res); } }" Ballerina https://github.com/ballerina-platform/ballerina-lang/tree/master/language-server https://github.com/ballerina-platform/ballerina-lang // io:println """" true true true true false true https://en.wikipedia.org/wiki/Ballerina_(programming_language) 2 1 ballerina.io Ballerina https://github.com/ballerina-platform/ballerina-grammar 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 Ballerina 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 prql PRQL 2022 Maximilian Roos 33 queryLanguage https://prql-lang.org/ 0 https://prql-lang.org/posts/ 0.11.4 149 2 27 24496 true 0 https://github.com/prql/prql queryLanguage 2022 2024 2022 45 208 9667 238 false Pipelined Relational Query Language 2022 2025 3692 88 829 24 117286 https://prql-lang.org/roadmap/ https://prql-lang.org/playground/ 2022 PRQL is a modern language for transforming data — a simple, powerful, pipelined SQL replacement PRQL is a modern language for transforming data — a simple, powerful, pipelined SQL replacement https://github.com/PRQL PRQL is a modern language for transforming data — a simple, powerful, pipelined SQL replacement rust markdown yaml toml html javascript json css csv csharp php elixir typescript jsx bourne-shell python java zig make dockerfile xml sql nix c cpp handlebars svg sql true 10381 0 63 1 false 0 true prql https://prql-lang.org/book/ https://prql-lang.org/faq/ United States https://news.ycombinator.com/item?id=30060784 "from employees filter start_date > @2021-01-01 # Clear date syntax. derive [ # `derive` adds columns / variables. gross_salary = salary + (tax ?? 0), # Terse coalesce gross_cost = gross_salary + benefits_cost, # Variables can use other variables. ] filter gross_cost > 0 group [title, country] ( # `group` runs a pipeline over each group. aggregate [ # `aggregate` reduces each group to a row. average gross_salary, sum_gross_cost = sum gross_cost, # `=` sets a column name. ] ) filter sum_gross_cost > 100000 # Identical syntax for SQL's `WHERE` & `HAVING`. derive id = f""{title}_{country}"" # F-strings like python. sort [sum_gross_cost, -country] # `-country` means descending order. take 1..20 # Range expressions (also valid here as `take 20`)." https://discord.com/invite/eQcfaCmsNc https://twitter.com/prql_lang https://github.com/prql/prql # true true false 0 0 prql-lang.org hy Hy 2013 Paul Tagliamonte 43 pl lisp http://hylang.org/ 0 0.29.0 150 5 7 24495 true 0 https://github.com/hylang/hy pl 154 180 398 0 hylang hy text source.hy programming 2012 2024 2012 120 368 4818 13 false h/Hy.hy 97 2013 2018 3 30 lisp.py 2012 2025 4400 209 166 9 24062 2013 2013 lisp ia-32 clojure python jvm 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. 2015 1 76 1 43723435 A dialect of Lisp that's embedded in Python A dialect of Lisp that's embedded in Python https://github.com/hylang A dialect of Lisp that's embedded in Python hy hy hy hy python restructuredtext svg yaml markdown css dockerfile true 6358 0 53 1 false 0 true https://tio.run/#hy https://docs.hylang.org/en/stable/ text http://www.rosettacode.org/wiki/Category:Hy Various "(+ ""Hyllo "" ""World"" ""!"")" "(print ""Hello World"") " ";; Fibonacci example in Hy. (defn fib [n] (if (<= n 2) n (+ (fib (- n 1)) (fib (- n 2))))) (if (= __name__ ""__main__"") (for [x [1 2 3 4 5 6 7 8]] (print (fib x)))) " Hy https://riju.codes/hy "(print ""Hello, world!"") " "=> (print ""Hy!"") Hy! => (defn salutationsnm [name] (print (+ ""Hy "" name ""!""))) => (salutationsnm ""YourName"") Hy YourName!" Hy https://github.com/hylang/hy ; print """" true true true true true true true true false true https://github.com/Calysto/calysto_hy https://en.wikipedia.org/wiki/Hy_(programming_language) 0 0 hylang.org Hy https://github.com/Slowki/hy.tmLanguage.git Hy factor Factor 2003 Slava Pestov 38 pl https://factorcode.org/ 0 151 3 29 24493 true 1 interleaved-notation https://github.com/factor/factor pl 110 111 .factor-boot-rc .factor-rc 201 0 text factor text/x-factor source.factor programming 2009 2024 2007 73 205 1602 705 false f/Factor.factor 28257 2007 2016 124 factor.py 2007 2025 52195 177 11695 325 1520299 2005 2009 linux joy forth lisp self java scheme c java-bytecode reverse-polish-notation xml opengl postgresql sqlite objective-c fortran smalltalk 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. 2004 44 63 238 891398 https://github.com/factor factor factor factor xml cpp lisp c html css glsl vim-script csv javascript markdown cson assembly-language json bourne-shell sql cuda yaml restructuredtext smalltalk svg perl make dtd objective-cpp lua nix ruby rust true 2886 0 69 1 false https://tio.run/#factor text 2090 factor http://www.rosettacode.org/wiki/Category:Factor Unknown Factor https://docs.google.com/document/d/17IddUbocCQhmx_mCcycij6Dmmn-c0ReZqLWzY-idt-Q/edit "USING: io ; ""Hello World"" print " Factor https://riju.codes/factor "IN: main USE: io ""Hello, world!"" print " https://twitter.com/factorbuilds : make-html ( string -- xml ) dup <->
<->
XML> ; Factor https://github.com/factor/factor print """" true true true true false true https://en.wikipedia.org/wiki/Factor_(programming_language) 0 2 Factor factorcode.org Factor https://github.com/slavapestov/factor Factor 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 puppet Puppet 2005 22 pl 9 152 2 24488 true 9 apache-hbase cloc hhvm kotlin mgmt minilang objectscript pygments rust pl 8311 14936 Modulefile 23445 0 text puppet text/x-puppet source.puppet programming false 72 2013 2018 5 9 dsls.py 2005 clojure ruby linux rest solaris 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. 2007 586 144 286 14432911 Puppet, Inc pp pp ruby true 3200 0 22 text puppet United States hiera_include('classes') Puppet https://twitter.com/puppetize user { 'harry': ensure => present, uid => '1000', shell => '/bin/bash', home => '/var/tmp' } https://github.com/lingua-pupuli/puppet-editor-services true true true true https://en.wikipedia.org/wiki/Puppet_(software) 11 2 Puppet https://github.com/russCloak/SublimePuppet 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 Puppet 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 flux FLUX 2014 Paul O’Shannessy 26 pl https://facebook.github.io/flux/ 0 4.0.4 153 1 7 24487 true 0 https://github.com/facebook/flux pl 792 853 187 0 text none programming 2014 2024 2014 636 3470 17382 6 false 2014 2023 553 148 174 6 31266 Application Architecture for Building User Interfaces Application Architecture for Building User Interfaces https://github.com/fluxcd Application Architecture for Building User Interfaces fx flux javascript markdown json svg css html yaml true 27942 0 34 1 false 4 true https://fluxcd.io/flux/ https://docs.influxdata.com/flux/v0.x/ text 8630 United States // concrete node signatures Listen () => (int socket); ReadRequest (int socket) => (int socket, bool close, image_tag *request); CheckCache (int socket, bool close, image_tag *request) => (int socket, bool close, image_tag *request); // omitted for space: // ReadInFromDisk, StoreInCache Compress (int socket, bool close, image_tag *request, __u8 *rgb_data) => (int socket, bool close, image_tag *request); Write (int socket, bool close, image_tag *request) => (int socket, bool close, image_tag *request); Complete (int socket, bool close, image_tag *request) => (); // source node source Listen => Image; // abstract node Image = ReadRequest -> CheckCache -> Handler -> Write -> Complete; // predicate type & dispatch typedef hit TestInCache; Handler:[_, _, hit] = ; Handler:[_, _, _] = ReadInFromDisk -> Compress -> StoreInCache; // error handler handle error ReadInFromDisk => FourOhFor; // atomicity constraints atomic CheckCache:{cache}; atomic StoreInCache:{cache}; atomic Complete:{cache}; https://github.com/facebook/flux // true true false 7 11 FLUX 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 FLUX 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 autohotkey AutoHotkey 2003 33 pl https://autohotkey.com 4 154 4 24484 true 4 ace bqn drakon pygments pl 1244 1470 14623 0 ahk autohotkey source.ahk programming false a/AutoHotKey.ahk 53 2013 2018 1 5 automation.py 2003 2017 emacs-editor c excel-app autoit visual-basic.net csharp lua lisp vbscript jscript kixtart winbatch 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. 2005 308 146 496 1485612 AutoHotkey Foundation LLC ahk ahkl ahk ahk ahkl true 1761 0 37 ahk ahkl text http://www.rosettacode.org/wiki/Category:AutoHotkey United States AutoHotkey ; Hello World in AutoHotkey Msgbox Hello, World! MsgBox, Hello World MsgBox, Hello`, World! autohotkey ^+w::last := CopyUser() ; Ctrl+Shift+w ^+e::edit := CopyUser() ; Ctrl+Shift+e CopyUser() { Clipboard = StringReplace, Clipboard, Clipboard, http://en.wikipedia.org/ StringReplace, Clipboard, Clipboard, wiki/ StringReplace, Clipboard, Clipboard, w/index.php?title= StringReplace, Clipboard, Clipboard, Special:Contributions&target= StringReplace, Clipboard, Clipboard, User: StringReplace, Clipboard, Clipboard, &action=edit StringReplace, Clipboard, Clipboard, _, %A_Space%, All Return, Clipboard } ; Ctrl+Shift+r ^+r::Send revert edits by [[Special:Contributions/%edit%|%edit%]] to last version by %last% AutoHotKey ; := true true true true true true true true false https://en.wikipedia.org/wiki/AutoHotkey 7 0 autohotkey.com AutoHotkey https://github.com/ahkscript/SublimeAutoHotkey AutoHotkey 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 manim Manim 2015 Grant Sanderson 25 framework https://www.manim.community 0 v0.17.2 155 0 18 24480 false 0 https://github.com/manimCommunity/manim framework 2020 2024 2015 133 1489 20183 421 false python 2015 2025 6234 499 1350 45 164371 "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." A community-maintained Python framework for creating mathematical animations A community-maintained Python framework for creating mathematical animations https://github.com/ManimCommunity A community-maintained Python framework for creating mathematical animations .py python restructuredtext svg glsl markdown yaml json javascript ini toml awk css dockerfile make jupyter-notebook bourne-shell tex html https://docs.manim.community/en/stable/tutorials/quickstart.html true 33180 0 44 1 false 0 true https://www.youtube.com/3blue1brown https://docs.manim.community/en/stable https://pypi.org/project/manim United States https://www.reddit.com/r/manim https://twitter.com/manim_community https://www.youtube.com/watch?v=hy-6D650Apo https://github.com/manimCommunity/manim https://en.wikipedia.org/wiki/3Blue1Brown 0 0 manim.community basic BASIC 1964 John G. Kemeny and Thomas E. Kurtz 37 pl 0 156 4 24478 176 true 0 pl 61 66 829 text source.basic programming false b/BASIC.bas Beginner's All-purpose Symbolic Instruction Code 1964 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 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. 2001 1401 2623 2802 4015 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. 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. Dartmouth College 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. bas bas bas 7025 0 41 2 https://en.wikibooks.org/wiki/BASIC_Programming text 945 https://github.com/antlr/grammars-v4/tree/master/basic http://www.rosettacode.org/wiki/Category:BASIC United States BASIC "10 REM Hello World in BASIC 20 PRINT ""Hello World!"" " "10 PRINT ""Hello World"" 20 END " https://riju.codes/basic "PRINT ""Hello, world!"" " "Public Class StarsProgram Public Shared Sub Main() Dim UserName, Answer, stars As String, NumStars As Integer Console.Write(""What is your name: "") UserName = Console.ReadLine() Console.WriteLine(""Hello {0}"", UserName) Do Console.Write(""How many stars do you want: "") NumStars = CInt(Console.ReadLine()) stars = New String(""*"", NumStars) Console.WriteLine(stars) Do Console.Write(""Do you want more stars? "") Answer = Console.ReadLine() Loop Until Answer <> """" Answer = Answer.Substring(0, 1) Loop While Answer.ToUpper() = ""Y"" Console.WriteLine(""Goodbye {0}"", UserName) End Sub End Class" BASIC https://sourceforge.net/projects/bwbasic/files/bwbasic/ REM PRINT """" true true true true false true false true false https://en.wikipedia.org/wiki/BASIC 57 13 https://hopl.info/showlanguage.prx?exp=176 Basic BASIC 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 BASIC 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 wren Wren 2013 Bob Nystrom 33 pl https://wren.io/ 0 0.4.0 157 2 15 24476 true 0 https://github.com/munificent/wren pl 3 3 8 wrenlang text source.wren programming 2013 2024 2013 157 545 6832 240 false w/Wren.wren 2013 2025 1975 133 1160 9 320128 Wren is a small, fast, class-based concurrent scripting language. Wren is a small, fast, class-based concurrent scripting language. Wren is a small, fast, class-based concurrent scripting language. wren wren markdown c python html xml lua ruby javascript dart css pascal make yaml bourne-shell svg true 8602 0 https://exercism.org/tracks/wren 51 1 false 0 true https://tio.run/#wren text https://github.com/antlr/grammars-v4/tree/master/wren http://www.rosettacode.org/wiki/Category:Wren United States https://news.ycombinator.com/item?id=23660464 "System.print(""Hello, world!"") class Wren { flyTo(city) { System.print(""Flying to %(city)"") } } var adjectives = Fiber.new { [""small"", ""clean"", ""fast""].each {|word| Fiber.yield(word) } } while (!adjectives.isDone) System.print(adjectives.call())" "IO.print(""Hello World"") " Wren https://github.com/munificent/wren // IO.print """" true true true false true 0 0 wren.io Wren Wren mdx MDX 2017 John Otander 20 textMarkup https://mdxjs.com/ 0 3.0.1 158 1 9 24472 true 1 slashdown https://github.com/mdx-js/mdx textMarkup 2017 2024 2017 86 1139 17208 15 false 2017 2025 2025 196 182 44 49388 https://mdxjs.com/playground/ 2018 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. 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. https://github.com/mdx-js 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. javascript markdown jsx json yaml typescript css svg json5 true 20823 0 29 1 false 3 true https://github.com/antlr/grammars-v4/tree/master/mdx Various import { Chart } from '../components/chart' # Here’s a chart The chart is rendered inside our MDX document. https://twitter.com/chrisbiscardi https://github.com/mdx-js/mdx 1 0 mdxjs.com year|publisher|title|authors|isbn13\n2013-08-26|Packt Publishing|Instant MDX Queries for SQL Server 2012|Nicholas Emond|9781782178071 raml RAML 2013 21 yamlFormat http://raml.org/spec.html 2 1.0.0 159 1 3 24472 true 2 cloc codeql https://github.com/raml-org/raml-spec yamlFormat 416 472 4190 0 yaml yaml text/x-yaml source.yaml markup 2013 2024 2013 151 858 3867 226 false 205 2013 2018 1 25 RESTful API Modeling Language 2013 2021 655 41 11 2 16829 https://github.com/raml-org raml markdown json yaml true 6684 0 25 false 1 true raml https://raml.org/developers/document-your-api text United States "#%RAML 0.8 title: World Music API baseUri: http://example.api.com/{version} version: v1 traits: - paged: queryParameters: pages: description: The number of pages to return type: number - secured: !include http://raml-example.com/secured.yml /songs: is: [ paged, secured ] get: queryParameters: genre: description: filter the songs by genre post: /{songId}: get: responses: 200: body: application/json: schema: | { ""$schema"": ""http://json-schema.org/schema"", ""type"": ""object"", ""description"": ""A canonical song"", ""properties"": { ""title"": { ""type"": ""string"" }, ""artist"": { ""type"": ""string"" } }, ""required"": [ ""title"", ""artist"" ] } application/xml: delete: description: | This method will *delete* an **individual song**" https://github.com/raml-org/raml-language-server https://github.com/raml-org/raml-spec 1 0 RAML https://github.com/atom/language-yaml 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 RAML postscript PostScript 1982 John Warnock and Chuck Geschke and Doug Brotz and Ed Taft and Bill Paxton 38 textMarkup 0 160 5 24469 1010 true 1 interpress textMarkup 3932 4145 8053 0 postscr text source.postscript markup false p/PostScript.ps 10 2006 2011 2 3 graphics.py 1982 ghostscript lisp pdf ascii tex forth reverse-polish-notation latex 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. 2001 473 942 914 24080 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. 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. Adobe 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. ps eps epsi pfa ps ps eps 2585 0 44 5 https://www.pdfa.org/norm-refs/PLRM.pdf text PostScript http://www.rosettacode.org/wiki/Category:PostScript ghostscript United States % Hello World in Postscript %!PS /Palatino-Roman findfont 100 scalefont setfont 100 100 moveto (Hello World!) show showpage % run> gs -q -sDEVICE=nullpage postscript.ps (Hello World\n) print quit %!PS-Adobe-3.0 %%Creator: Aaron Puchert %%Title: The Sierpinski triangle %%Pages: 1 %%PageOrder: Ascend %%BeginProlog % PAGE SETTINGS /pageset { 28.3464566 28.3464566 scale % set cm = 1 0.5 0.5 translate 0 setlinewidth } def % sierpinski(n) draws a sierpinski triangle of order n /sierpinski { dup 0 gt { [0.5 0 0 0.5 0 0] concat dup 1 sub sierpinski [1 0 0 1 1 0] concat dup 1 sub sierpinski [1 0 0 1 -1 1] concat dup 1 sub sierpinski [2 0 0 2 0 -1] concat } { newpath 0 0 moveto 1 0 lineto 0 1 lineto closepath fill } ifelse pop} def %%EndProlog %%BeginSetup << /PageSize [596 843] >> setpagedevice % A4 %%EndSetup %%Page: Test 1 pageset [20 0 10 300 sqrt 0 0] concat 9 sierpinski showpage %%EOF PostScript https://riju.codes/postscript (Hello, world!) = /mm {360 mul 127 div} def 0 0 moveto 0 40 mm lineto stroke PostScript % print true true true true true true true true true false https://en.wikipedia.org/wiki/PostScript 13 1 https://hopl.info/showlanguage.prx?exp=1010 PostScript PostScript https://github.com/textmate/postscript.tmbundle 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 PostScript 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 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 less Less 2009 Alexis Sellier 32 stylesheetLanguage http://lesscss.org 16 161 4 24462 true 16 ace bounce-lang gogs-editor gridstudio-editor katex koka livr mu netbeans-editor ngs nit prettier prometheus purescript sanddance statsplorer stylesheetLanguage 2276 2585 12105 0 less-css less css text/css source.css.less markup false l/Less.less 309 2013 2018 1 35 css.py https://playcode.io/less/ 2009 2009 javascript sass css ruby stylus "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." 2011 186 48 256 31294765 https://github.com/less less less less true 1151 0 37 1 less text 535 https://github.com/antlr/grammars-v4/tree/master/less less Various "body::before { content: ""Hello World"" } " @blue: #3bbfce; @margin: 16px; .content-navigation { border-color: @blue; color: darken(@blue, 9%); } .border { padding: @margin / 2; margin: @margin / 2; border-color: @blue; } LessCss https://riju.codes/less "body:before { content: ""Hello, world!""; } " #header { color: #333333; border-left: 1px; border-right: 3px; } #footer { color: #114411; border-color: #7d2717; } Less // /* */ """" true true true true https://en.wikipedia.org/wiki/Less_(stylesheet_language) 7 3 lesscss.org Less https://github.com/atom/language-less.git 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 Less 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 vuejs Vue 2014 Evan You 22 framework https://vuejs.org 0 2.7.16 162 3 8 24459 false 0 https://github.com/vuejs/vue framework 7769 8639 875562 26 "author name avatar url language languageColor stars forks currentPeriodStars description\nwdlhao vue2-element-touzi-admin https://github.com/wdlhao.png https://github.com/wdlhao/vue2-element-touzi-admin Vue #2c3e50 1896 841 181 ""基于vue2.0 +vuex+ element-ui后台管理系统""\nepicmaxco vuestic-admin https://github.com/epicmaxco.png https://github.com/epicmaxco/vuestic-admin Vue #2c3e50 6428 924 804 ""Free and Beautiful Vue.js Admin Template""\nPanJiaChen vue-element-admin https://github.com/PanJiaChen.png https://github.com/PanJiaChen/vue-element-admin Vue #2c3e50 40249 13473 1948 ""🎉 A magical vue admin https://panjiachen.github.io/vue-element-admin""\ntuandm laravue https://github.com/tuandm.png https://github.com/tuandm/laravue Vue #2c3e50 563 178 114 ""A magical administrative interface for Laravel built by VueJS and Element UI https://laravue.dev""\nbuefy buefy https://github.com/buefy.png https://github.com/buefy/buefy Vue #2c3e50 6183 612 258 ""Lightweight UI components for Vue.js based on Bulma""\nweilanwl ColorUI https://github.com/weilanwl.png https://github.com/weilanwl/ColorUI Vue #2c3e50 5837 985 570 鲜亮的高饱和色彩，专注视觉的小程序组件库\nbestony logoly https://github.com/bestony.png https://github.com/bestony/logoly Vue #2c3e50 3255 288 238 ""A Pornhub Flavour Logo Generator""\nRequarks wiki https://github.com/Requarks.png https://github.com/Requarks/wiki Vue #2c3e50 5222 702 224 ""Wiki.js | A modern, lightweight and powerful wiki app built on Node.js""\nElemeFE element https://github.com/ElemeFE.png https://github.com/ElemeFE/element Vue #2c3e50 40821 8770 1115 ""A Vue.js 2.0 UI Toolkit for Web""\nelunez eladmin-qd https://github.com/elunez.png https://github.com/elunez/eladmin-qd Vue #2c3e50 683 448 107 ""eladmin前端源码，项目基于 Spring Boot 2.1.0 、 Spring Boot Jpa、 Spring Security、Redis、Vue的前后端分离后台管理系统，权限控制采用 RBAC，菜单动态路由""\nMolunerfinn PicGo https://github.com/Molunerfinn.png https://github.com/Molunerfinn/PicGo Vue #2c3e50 6151 518 360 ""🚀A simple & beautiful tool for pictures uploading built by electron-vue""\ndcloudio hello-uniapp https://github.com/dcloudio.png https://github.com/dcloudio/hello-uniapp Vue #2c3e50 454 224 61 uni-app框架演示示例\nbailicangdu vue2-elm https://github.com/bailicangdu.png https://github.com/bailicangdu/vue2-elm Vue #2c3e50 29400 9847 662 ""基于 vue2 + vuex 构建一个具有 45 个页面的大型单页面应用""\nustbhuangyi vue-sell https://github.com/ustbhuangyi.png https://github.com/ustbhuangyi/vue-sell Vue #2c3e50 2899 1257 76 ""🍚 Vue.js高仿饿了么外卖App课程源码 http://coding.imooc.com/class/74.html""\nyouzan vant-demo https://github.com/youzan.png https://github.com/youzan/vant-demo Vue #2c3e50 550 421 74 ""Collection of vant demos.""\nmacrozheng mall-admin-web https://github.com/macrozheng.png https://github.com/macrozheng/mall-admin-web Vue #2c3e50 3467 2063 345 ""mall-admin-web是一个电商后台管理系统的前端项目，基于Vue+Element实现。主要包括商品管理、订单管理、会员管理、促销管理、运营管理、内容管理、统计报表、财务管理、权限管理、设置等功能。""\nxyxiao001 vue-cropper https://github.com/xyxiao001.png https://github.com/xyxiao001/vue-cropper Vue #2c3e50 1764 369 102 ""A simple picture clipping plugin for vue""\nsendya ant-design-pro-vue https://github.com/sendya.png https://github.com/sendya/ant-design-pro-vue Vue #2c3e50 3134 852 348 ""👨🏻‍💻👩🏻‍💻 Use Ant Design Vue like a Pro! A simple vue admin template.""\nymm-tech gods-pen https://github.com/ymm-tech.png https://github.com/ymm-tech/gods-pen Vue #2c3e50 232 41 113\na54552239 pearProject https://github.com/a54552239.png https://github.com/a54552239/pearProject Vue #2c3e50 817 191 110 pear，梨子，一个基于Vue.js实现的项目管理系统\nsdras ecommerce-netlify https://github.com/sdras.png https://github.com/sdras/ecommerce-netlify Vue #2c3e50 475 69 412 ""🛍 A JAMstack Ecommerce Site built with Nuxt and Netlify Functions""\nsl1673495 vue-netease-music https://github.com/sl1673495.png https://github.com/sl1673495/vue-netease-music Vue #2c3e50 485 79 343 ""🎵基于Vue2、Vue-CLI3的高仿网易云mac客户端播放器（PC） Online Music Player""\nopenspug spug https://github.com/openspug.png https://github.com/openspug/spug Vue #2c3e50 962 269 175 ""开源运维平台：帮助中小型企业完成主机、任务、发布部署、配置文件、监控、报警等管理(open source O & M management system,manage the hosts, tasks, deployment, configuration files, monitoring and alarming) https://spug.qbangmang.com/login""\nllldddbbb dbblog https://github.com/llldddbbb.png https://github.com/llldddbbb/dbblog Vue #2c3e50 372 148 87 基于SpringBoot2.x+Vue2.x+ElementUI+Iview+Elasticsearch+RabbitMQ+Redis+Shiro的多模块前后端分离的博客项目\nhinesboy mavonEditor https://github.com/hinesboy.png https://github.com/hinesboy/mavonEditor Vue #2c3e50 2991 496 138 ""mavonEditor - A markdown editor based on Vue that supports a variety of personalized features""" html text.html.vue markup 2013 2024 2016 5891 33651 207463 602 false v/Vue.js 54 2014 2018 2 19 2016 2024 6694 407 508 34 89190 https://playcode.io/vue/ 2013 2014 javascript html css elm Vue.js (commonly referred to as Vue; pronounced , like view) is an open-source JavaScript framework for building user interfaces. Integration into projects that use other JavaScript libraries is simplified with Vue because it is designed to be incrementally adoptable. Vue can also function as a web application framework capable of powering advanced single-page applications. 2016 852 264 158 50978621 vue js typescript typescript javascript html json markdown css yaml bash true 313305 0 31 1 false 2 true vue text "
{{ message }}
" " " https://twitter.com/vuejs "

User 1

" Vue https://github.com/vuejs/vetur https://github.com/vuejs/vue https://en.wikipedia.org/wiki/Vue.js 0 0 vuejs.org Vue https://github.com/vuejs/vue-syntax-highlight Vue drupal Drupal 2000 Dries Buytaert 20 application https://www.drupal.org 0 163 0 14 24453 false 0 https://git.drupalcode.org/project/drupal application false 2000 2025 65194 178 19477 284 1931343 2001 2000 php gettext twig html wordpress mysql 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. 2003 882 947 2995 166004 Drupal community php yaml javascript twig css svg xml json pascal html csv markdown bourne-shell sql true 185783 1642 34 1 false text Various https://www.youtube.com/@DrupalAssociation https://www.reddit.com/r/drupal/ https://x.com/drupal https://git.drupalcode.org/project/drupal https://en.wikipedia.org/wiki/Drupal 1 0 drupal.org drupal title|year|author|goodreadsId|rating|ratings|reviews\nDrupal For Dummies|2009|Lynn Beighley|9208672|3.45|66|12 cython Cython 2007 25 pl http://cython.org 15 164 1 24450 true 15 arrow-format atomspace edgedb fardlang hhvm horse64 htsql impala pandas saltstack scikit-learn scipy sqlalchemy tensorflow tornado pl 528 580 698 0 pyrex text python text/x-cython source.cython programming false 8 2009 2017 2 python.py 2007 python c linux pyrex sagemath xml scipy pandas scikit-learn 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. 2008 270 81 234 18384111 https://github.com/sagemath pyx pxd pxi pyx pxd pxi true 1571 0 29 python pxd pxi pyx https://cython.readthedocs.io/en/latest/ text Various Cython In [1]: %load_ext Cython In [2]: %%cython ...: def f(n): ...: a = 0 ...: for i in range(n): ...: a += i ...: return a ...: ...: cpdef g(int n): ...: cdef int a = 0, i ...: for i in range(n): ...: a += i ...: return a ...: In [3]: %timeit f(1000000) 42.7 ms ± 783 µs per loop (mean ± std. dev. of 7 runs, 10 loops each) In [4]: %timeit g(1000000) 74 µs ± 16.6 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each) true true true true https://en.wikipedia.org/wiki/Cython 10 1 cython.org Cython https://github.com/textmate/cython.tmbundle 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 Cython 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 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 labview LabVIEW G 1986 27 pl http://www.ni.com/labview 0 https://www.ni.com/nl-nl/support/documentation/release-notes/product.labview.html 165 0 24442 2657 true 0 pl 165 357 5849 0 xml xml text/xml text.xml programming false 97 2004 2018 12 548 5 g 45 1986 linux g-code unix matlab fortran c drakon simulink "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." 2004 556 354 1028 544733 National Instruments Corporation lvproj lvclass lvlib false 8125 2012 27 true https://www.ni.com/docs/en-US/bundle/labview/page/lvhelp/labview_help.html https://www.ni.com/nl-nl/support/documentation/supplemental/06/labview-object-oriented-programming-faq.html text http://www.rosettacode.org/wiki/Category:LabVIEW United States LabVIEW https://reddit.com/r/LabVIEW https://www.meetup.com/topics/labview true https://en.wikipedia.org/wiki/LabVIEW 0 0 https://hopl.info/showlanguage.prx?exp=2657 LabVIEW LabVIEW https://github.com/textmate/xml.tmbundle LabVIEW labview engineer android Android 2008 Andy Rubin and Rich Miner and Nick Sears and Chris White 19 os https://android.com/ 0 https://developer.android.com/about/versions 14.0.0 166 1 24440 false 0 os false a/Android.java 1514159 2707 1997 2005 java c arm x86-isa linux go kotlin eclipse-editor mips ios java-bytecode "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." 2007 9920 12074 10354 12610483 Android Inc. && Google java true 975958 9263 23 4 14 true na United States "package com.example.helloworld; import android.app.Activity; import android.os.Bundle; import android.widget.TextView; public class HelloWorld extends Activity { @Override public void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); TextView tv = new TextView(this); tv.setText(""Hello World""); setContentView(tv); } } " https://twitter.com/android Android https://www.meetup.com/topics/android-developers https://en.wikipedia.org/wiki/Android_(operating_system) 2 0 android.com android 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 mumps MUMPS 1966 Neil Pappalardo 35 pl 4 167 5 24436 773 true 6 cache-objectscript cloc cmake mps ncl proto-gnosis pl 4334 4908 2448 0 mumps text mumps text/x-mumps none programming false m/Mumps.m m 1966 joss unix telcomp miis linux tiny-basic ascii csv "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." 2001 255 197 1017 19723 MUMPS Development Committee mumps m m 1345 0 40 1 mps m https://tio.run/#mumps https://mumps.sourceforge.net/docs.html text https://github.com/antlr/grammars-v4/tree/master/mumps mumps http://www.rosettacode.org/wiki/Category:MUMPS United States MUMPS "label1 ; This is a label write ""Hello World !"",! quit " "; Hello World in Mumps-M w !,""Hello World""" " w ""Hello World"",! " https://riju.codes/mumps "main() write ""Hello, world!"",! quit " "GTM>S n="""" GTM>S n=$order(^nodex(n)) GTM>zwr n n="" building"" GTM>S n=$order(^nodex(n)) GTM>zwr n n="" name:gd"" GTM>S n=$order(^nodex(n)) GTM>zwr n n=""%kml:guid""" Mumps ; w """" true true true false true https://en.wikipedia.org/wiki/MUMPS 10 3 https://hopl.info/showlanguage.prx?exp=773 MUMPS M 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 M 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 coldfusion ColdFusion 1995 Joseph J. Allaire 32 pl https://www.adobe.com/products/coldfusion 3 168 4 24431 true 4 ace cloc coldfusion-components pygments pl 1476 2061 20756 0 cfm or cfml or coldfusion html coldfusion text.html.cfm programming false c/ColdFusion.cfm 584 2012 2017 1 15 7310 22 templates.py 1995 java html cfml asp java-server-pages php javascript cfscript soap pdf smtp ftp xml xpath solaris excel-app linux eclipse-editor wsdl json jython groovy jruby 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. 2012 85 386 1 374636 Adobe cfm cfml cfm cfm cfml false 1646 0 36 1 cfm cfml https://cfdocs.org/ text http://www.rosettacode.org/wiki/Category:ColdFusion https://www.forgebox.io/ ColdFusion " #message# " " #message# " " ---> ---> Date Functions #RightNow# #DateFormat(RightNow)# #DateFormat(RightNow,""mm/dd/yy"")# #TimeFormat(RightNow)# #TimeFormat(RightNow,""hh:mm tt"")# #IsDate(RightNow)# #IsDate(""January 31, 2007"")# #IsDate(""foo"")# #DaysInMonth(RightNow)# #x# #y# #z# ---> comment --->" Coldfusion HTML https://twitter.com/coldfusion http://path/to/components/Component.cfc?method=search&query=your+query&mode=strict ColdFusion https://www.meetup.com/topics/coldfusion cfoutput """" true true false true https://en.wikipedia.org/wiki/ColdFusion 36 0 ColdFusion https://github.com/SublimeText/ColdFusion 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 ColdFusion 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 xquery XQuery 2007 33 pl http://www.w3.org/XML/Query/ 4 https://www.w3.org/blog/tags/xquery/ 169 4 24427 true 4 ace cloc ixml pygments pl 983 1175 1753 0 xquery xquery application/xquery source.xq programming false x/XQuery.xq 108 2015 2016 1 2 W3C webmisc.py 2007 xpath sql lisp prolog xml java csharp jsoniq json isbn "XQuery (XML Query) is a query and functional programming language that queries and transforms collections of structured and unstructured data, usually in the form of XML, text and with vendor-specific extensions for other data formats (JSON, binary, etc.). The language is developed by the XML Query working group of the W3C. The work is closely coordinated with the development of XSLT by the XSL Working Group; the two groups share responsibility for XPath, which is a subset of XQuery. XQuery 1.0 became a W3C Recommendation on January 23, 2007. XQuery 3.0 became a W3C Recommendation on April 8, 2014. XQuery 3.1 became a W3C Recommendation on March 21, 2017. ""The mission of the XML Query project is to provide flexible query facilities to extract data from real and virtual documents on the World Wide Web, therefore finally providing the needed interaction between the Web world and the database world. Ultimately, collections of XML files will be accessed like databases""." 2002 216 308 433 23742879 W3C xq xql xqm xqy xquery xquery xq xql xqm xqy xq xqy xquery xq xql xqm xq xql xqm xqy xquery 1351 125 45 xq xql xqm xquery xqy https://www.w3.org/TR/xquery-31/ text xquery http://www.rosettacode.org/wiki/Category:XQuery "(: Hello World with XQuery :) let $i := ""Hello World"" return $i " "let $hello := ""Hello World"" return $hello " "(: ------------------------------------------------------------------------------------- xproc.xqm - core xqm contains entry points, primary eval-step function and control functions. ---------------------------------------------------------------------------------------- :) xquery version ""3.0"" encoding ""UTF-8""; module namespace xproc = ""http://xproc.net/xproc""; (: declare namespaces :) declare namespace p=""http://www.w3.org/ns/xproc""; declare namespace c=""http://www.w3.org/ns/xproc-step""; declare namespace err=""http://www.w3.org/ns/xproc-error""; (: module imports :) (: import module namespace util = ""http://xproc.net/xproc/util"" at ""util1.xqm""; :) import module namespace const = ""http://xproc.net/xproc/const"" at ""const.xqm""; import module namespace parse = ""http://xproc.net/xproc/parse"" at ""parse.xqm""; import module namespace u = ""http://xproc.net/xproc/util"" at ""util.xqm""; (: declare options :) declare boundary-space preserve; declare option saxon:output ""indent=yes""; (: declare functions :) declare variable $xproc:run-step := xproc:run#6; declare variable $xproc:parse-and-eval := (); declare variable $xproc:declare-step := (); declare variable $xproc:choose := (); declare variable $xproc:try := (); declare variable $xproc:catch := (); declare variable $xproc:group := (); declare variable $xproc:for-each := (); declare variable $xproc:viewport := (); declare variable $xproc:library := (); declare variable $xproc:pipeline := (); declare variable $xproc:variable := (); (: list all declared namespaces :) (: -------------------------------------------------------------------------- :) declare function xproc:enum-namespaces($pipeline){ (: -------------------------------------------------------------------------- :) {u:enum-ns({$pipeline})} }; (: entry point :) (: -------------------------------------------------------------------------- :) declare function xproc:run($pipeline,$stdin,$dflag,$tflag,$bindings,$options){ (: -------------------------------------------------------------------------- :) (: STEP I: preprocess :) let $validate := () let $namespaces := xproc:enum-namespaces($pipeline) let $parse := parse:explicit-bindings( parse:AST(parse:explicit-name(parse:explicit-type($pipeline)))) let $ast := element p:declare-step {$parse/@*, parse:pipeline-step-sort( $parse/*, () ) } (: STEP II: eval AST :) let $eval_result := () (: STEP III: serialize and return results :) let $serialized_result := $pipeline return $serialized_result }; " XQuery " { for $act in doc(""hamlet.xml"")//ACT let $speakers := distinct-values($act//SPEAKER) return

{ string($act/TITLE) }

{ for $speaker in $speakers return
{ $speaker }
}

} " XQuery """" false true true true false false true https://en.wikipedia.org/wiki/XQuery 2 15 XQuery XQuery https://github.com/wcandillon/language-jsoniq year|publisher|title|authors|isbn13\n2009|McGraw-Hill Education|XML: A Beginner's Guide: Go Beyond the Basics with Ajax, XHTML, XPath 2.0, XSLT 2.0 and XQuery|Holzner, Steven|9780071606264\n2009|McGraw-Hill Education|XML: A Beginner's Guide: Go Beyond the Basics with Ajax, XHTML, XPath 2.0, XSLT 2.0 and XQuery|Holzner, Steven|9780071606271 XQuery XQuery developer year|title|doi|citations|influentialCitations|authors|paperId\n2009|XQuery Reloaded|10.14778/1687553.1687560|36|1|Roger Bamford and Vinayak R. Borkar and M. Brantner and Peter M. Fischer and D. Florescu and David A. Graf and D. Kossmann and Tim Kraska and D. Muresan and Sorin Nasoi and Markos Zacharioudaki|398e21c1a7f699a4f0298ce49c4bd0c86480946a\n2002|XML programming with SQL/XML and XQuery|10.1147/sj.414.0642|30|2|J. Funderburk and S. Malaika and B. Reinwald|dccdd7c09b1b48be5ad389fb86152851bf918636\n2003|Design and implementation of a graphical interface to XQuery|10.1145/952532.952759|29|3|Enrico Augurusa and Daniele Braga and A. Campi and S. Ceri|b5bc91313d27f1451ed72ae28e3f3e11fa6744ad\n2007|Highly distributed XQuery with DXQ|10.1145/1247480.1247641|28|2|M. Fernández and T. Jim and Kristi Morton and Nicola Onose and Jérôme Siméon|dc4dd7d588dac1952e8a796b01d88b5ef79b8104\n2005|Compiling XSLT 2.0 into XQuery 1.0|10.1145/1060745.1060844|18|2|Achille Fokoue and K. Rose and Jérôme Siméon and L. Villard|fa684f0d013f69deb6e9a0dd9f430363f69f46b5\n2009|XQuery in the browser|10.1145/1526709.1526845|17|0|G. Fourny and Markus Pilman and D. Florescu and D. Kossmann and Tim Kraska and D. McBeath|139f38fd02992a746d0710162771e338d7c3ce4b\n2009|An Encoding of XQuery in Prolog|10.1007/978-3-642-03555-5_12|17|1|J. Almendros-Jiménez|5195d815f3d783c7798e00cbabbb1e83dc00ff6d\n2009|Developing an Enterprise Web Application in XQuery|10.1007/978-3-642-02818-2_39|15|0|Martin Kaufmann and D. Kossmann|6ddcffdaa35a836d21a73acf6b254e6ebc2b94e7\n2009|Integrating XQuery and Logic Programming|10.1007/978-3-642-00675-3_8|14|0|J. Almendros-Jiménez and A. Becerra-Terón and F. J. Enciso-Baños|79d47519e543be6e80904a89bdf3570b0d4629ce\n2010|Eliminating dead-code from XQuery programs|10.1145/1810295.1810363|12|0|P. Genevès and Nabil Layaïda|d27af0ee184aac902c559b35f32e586643706b80\n2008|XQuery in the browser|10.1145/1376616.1376769|7|1|G. Fourny and D. Kossmann and Tim Kraska and Markus Pilman and D. Florescu|ba392dbe46c976df4b7ac39426cffafd2de607c5\n2015|Function inlining in XQuery 3.0 optimization|10.1145/2815072.2815079|5|0|Leonard Wörteler and Michael Grossniklaus and C. Grün and M. Scholl|6824125891a14a5ea4fcc8427a8a3ee6b358089b\n2014|Unleashing XQuery for Data-Independent Programming|10.1007/s13222-014-0160-3|4|0|Sebastian Bächle and Caetano Sauer|f6f4cf733b4a9ba7859bbd4d3a58757dd1bd4e6e\n2011|Programming the KDD Process using XQuery|10.5220/0003626501310139|3|0|A. Romei and F. Turini|f1eadf3f8cb7d644d4114bef4f1cb5c1f1a8e486\n2013|An expressive bidirectional transformation language for XQuery view update (Special issue : Advanced Programming Techniques for Construction of Robust, Generic and Evolutionary Programs)|10.2201/NIIPI.2013.10.6|1|0|Dongxi Liu and Zhenjiang Hu and M. Takeichi|b5aec929e9b515d99a039ead74029f20bb7c6b0c common-lisp Common Lisp 1984 Scott Fahlman and Richard P. Gabriel and David A. Moon and Kent Pitman and Guy Steele and Dan Weinreb 44 pl lisp https://common-lisp.net/ http://common-lisp.net/ 0 https://common-lisp.net/news https://common-lisp.net/downloads 170 4 24421 946 true 1 flare pl 3752 5678 24262 4 "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!""" lisp lisp sbcl ccl clisp ecl lisp commonlisp text/x-common-lisp source.lisp programming false c/Common Lisp.lisp 40 2005 2018 9 6 commonlisp lisp.py 2003 1984 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 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. 2001 334 866 1099 6068 American National Standards Institute lisp lsp l cl fasl lisp asd cl l lsp ny podsl sexp cl lisp lisp lsp l cl fasl lisp lsp l cl fasl http://pldb.info/blog/scottFalhmanInterview.html 1891 24 https://exercism.org/tracks/common 56 6 false https://common-lisp.net/documentation https://common-lisp.net/faq text Common Lisp clisp United States "(defun hello-world () (format t ""Hello World~%"")) (hello-world) " (DEFUN HELLO () (PRINT 'HELLO)) Common Lisp https://riju.codes/commonlisp "(format t ""Hello, world!"") " "CL-USER > (available-shells) (#P""/bin/bash"" #P""/bin/csh"" #P""/bin/ksh"" #P""/bin/sh"" #P""/bin/tcsh"" #P""/bin/zsh"")" Common Lisp https://sourceforge.net/p/sbcl/sbcl/ci/master/tree/ ; PRINT true true true true true true false true https://github.com/fredokun/cl-jupyter https://en.wikipedia.org/wiki/Common_Lisp 6 0 https://hopl.info/showlanguage.prx?exp=946 Common Lisp common-lisp.net Common Lisp https://github.com/textmate/lisp.tmbundle Common Lisp """common lisp""" 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 ipfs IPFS 2015 Juan Benet 18 protocol cryptoProtocol https://ipfs.tech/ https://github.com/ipfs/specs 0 171 0 2 24416 true 1 filecoin https://github.com/ipfs/ipfs protocol 2014 2024 969 1468 22610 5 false InterPlanetary File System IPFS 2013 2024 410 97 7 3 135 IPFS is an open system to manage data without a central server. IPFS is an open system to manage data without a central server. https://github.com/ipfs/papers/raw/master/ipfs-cap2pfs/ipfs-p2p-file-system.pdf https://protocol.ai IPFS is an open system to manage data without a central server. yaml markdown true 43133 0 20 1 false United States https://www.reddit.com/r/ipfs/ https://github.com/ipfs/ipfs https://en.wikipedia.org/wiki/InterPlanetary_File_System 0 0 mustache mustache 2009 Chris Wanstrath 19 template http://mustache.github.io/ 9 v1.1.1 172 1 5 24408 true 9 ballerina cloc codecept codeql hhvm ligo mustache netlogo obsidian-lang https://github.com/mustache/mustache template 535 616 6085 smarty smarty text/x-smarty text.html.smarty markup 2009 2024 2009 68 266 3027 51 false 2009 2022 853 78 98 2 7450 https://github.com/mustache mustache ruby mustache yaml markdown html true 3905 0 25 1 true 1 true mustache text United States and France and Portugal and Croatia Hello {{name}} You have just won {{value}} dollars! {{#in_ca}} Well, {{taxed_value}} dollars, after taxes. {{/in_ca}} https://github.com/mustache/mustache 0 0 mustache.github.io Mustache Mustache rails Ruby on Rails 2005 David Heinemeier Hansson 19 framework http://rubyonrails.org 0 https://rubyonrails.org/category/releases 7.1.3.2 173 1 24405 false 0 framework false r/Ruby on Rails.rb 2004 2004 ruby json xml html javascript jquery coffeescript sass rest nginx-config soap erb jruby mysql postgresql scala 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. 2005 1044 817 2172 1421401 https://github.com/rails true 197225 6343 19 1 7 true text Denmark "class HelloWorld < app print ""Hello World"" end end " https://twitter.com/rails Ruby on Rails https://en.wikipedia.org/wiki/Ruby_on_Rails 1 0 rubyonrails.org rails engineer ruby-on-rails title|year|author|goodreadsId|rating|ratings|reviews\nRuby for Rails: Ruby Techniques for Rails Developers|2006|David A. Black|8159|3.75|176|11 capn-proto Cap'n Proto 2013 Kenton Varda 25 idl https://capnproto.org/ 0 v1.0.2 174 0 18 24399 true 0 https://github.com/capnproto/capnproto idl 557 690 134567 0 text source.capnp programming 2013 2024 2013 315 909 11435 240 false 2 2013 2017 2 capnproto.py 2013 2025 5699 262 490 25 234755 2013 Cap'n Proto capnp capnp cpp markdown bourne-shell cmake html starlark yaml m4 json protobuf css python xml make javascript svg bazel lisp true 14626 0 44 protobuf 1 false 1 true text https://github.com/antlr/grammars-v4/tree/master/capnproto United States and Portugal Cap'n Proto https://twitter.com/capnproto https://github.com/capnproto/capnproto true true 0 0 capnproto.org Cap'n Proto https://github.com/textmate/capnproto.tmbundle Cap'n Proto eiffel Eiffel 1986 Bertrand Meyer 52 pl https://dev.eiffel.com/Main_Page 0 https://www.eiffel.org/blogs https://www.eiffel.org/doc/eiffelstudio/EiffelStudio_release_notes https://www.eiffel.org/downloads 175 4 53 24396 1220 true 1 flare https://github.com/EiffelSoftware/EiffelStudio pl 653 721 913 0 eiffel eiffel text/x-eiffel source.eiffel programming 2016 2024 16 25 49 7 false e/Eiffel.eiff 13 2006 2011 3 4 eiffel.py 1993 2024 98515 107 77257 703 14622476 2001 1986 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 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. 2001 240 262 909 9838 Eiffel Software e e eiff e e xml c markdown html svg bourne-shell perl smarty cpp scss css xslt csharp sql javascript json make ini xsd m4 lex python cmake yacc php idl assembly-language bash cadence-skill ada objective-c sed pascal yaml csv asp.net diff awk matlab ring tex logos java dtd c-shell nemerle coffeescript xhtml dockerfile xmi r scheme sas true 1703 0 109 1 false https://www.eiffel.org/documentation text https://github.com/antlr/grammars-v4/tree/master/eiffel eiffel http://www.rosettacode.org/wiki/Category:Eiffel Various https://www.eiffel.org/doc/eiffel/Eiffel_programming_language_syntax "indexing ""Hello World in Eiffel , from http://roesler-ac.de/wolfram/hello.htm#Eiffel"" class HELLO creation run feature run is local io : BASIC_IO; do !!io; io.put_string(""Hello World""); io.put_newline end; -- run end; -- class HELLO " "note description: ""Git checkout command."" author: ""Olivier Ligot"" class GIT_CHECKOUT_COMMAND inherit GIT_COMMAND create make, make_master feature {NONE} -- Initialization make (a_branch: STRING) -- Checkout the branch `a_branch'. do initialize arguments.force_last (a_branch) branch := a_branch ensure branch_set: branch = a_branch end make_master -- Checkout the master branch. do make (""master"") end feature -- Access branch: STRING -- Branch to checkout name: STRING = ""checkout"" -- Git subcommand name end " Eiffel https://twitter.com/eiffel_language "class HELLO_WORLD create make feature make do print (""Hello, world!"") end end" Eiffel https://github.com/EiffelSoftware/EiffelStudio -- """" := true true true true true true true true false true true true true false true https://en.wikipedia.org/wiki/Eiffel_(programming_language) 10 12 https://hopl.info/showlanguage.prx?exp=1220 Eiffel eiffel.org Eiffel https://github.com/textmate/eiffel.tmbundle 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 Eiffel 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 wa Wa-lang 2022 Shushan Chai and Ernan Ding 54 pl https://wa-lang.org/ 1 https://wa-lang.org/smalltalk/ https://github.com/wa-lang/wa/releases/ 176 1 5 24396 true 1 wa https://github.com/wa-lang/wa pl 2022 2025 24 56 1380 4 false wa 2022 2025 1661 21 1559 30 66925 https://wa-lang.org/playground/ Wa-lang is a general-purpose programming language designed for for WebAssembly. The goal is to provide a simple, reliable, easy-to-use, statically typed language for high-performance web applications. The code generator and runtime are fully independently developed (not dependent on external projects such as LLVM). Currently, Wa-lang is in the engineering trial stage. Wa-lang is a general-purpose programming language designed for for WebAssembly. The goal is to provide a simple, reliable, easy-to-use, statically typed language for high-performance web applications. The code generator and runtime are fully independently developed (not dependent on external projects such as LLVM). Currently, Wa-lang is in the engineering trial stage. 武汉市江夏区凹语言开发工作室 Wa-lang is a general-purpose programming language designed for for WebAssembly. The goal is to provide a simple, reliable, easy-to-use, statically typed language for high-performance web applications. The code generator and runtime are fully independently developed (not dependent on external projects such as LLVM). Currently, Wa-lang is in the engineering trial stage. wa wa go assembly-language c javascript true 1571 0 90 c cpp go wasm 2 true https://wa-lang.org/man/ China " import ""fmt"" global year: i32 = 2023 func main { println(""hello, Wa!"") println(add(40, 2), year) fmt.Println(1+1) } func add(a: i32, b: i32) => i32 { return a+b }" https://x.com/wayuyan break case const continue default defer else for func if import interface map range return struct switch type global https://github.com/wa-lang/wa // /* */ println """" = true true false true true true true true true true true true true true true true true true true false true true true true true 0 0 ml ML 1973 Robin Milner 25 pl 0 177 1 24388 620 true 3 mlite mlscript nemerle pl false Meta Language 1973 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 "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." 2001 541 214 449 20607 University of Edinburgh 2725 6 26 1 http://www.cs.cmu.edu/~rwh/isml/book.pdf https://www.cs.nmsu.edu/~rth/cs/cs471/sml.html http://www.faqs.org/faqs/meta-lang-faq/ text 3710 http://www.rosettacode.org/wiki/Category:ML United Kingdom ML structure Rational : ARITH = struct datatype t = Rat of int * int; val zero = Rat(0,1); fun succ(Rat(a,b)) = Rat( a+b , b ); fun sum (Rat(a,b), Rat(c,d)) = Rat(a*d+ c*b , b*d) : t ; end := true true false true https://en.wikipedia.org/wiki/ML_(programming_language) 33 30 https://hopl.info/showlanguage.prx?exp=620 ML 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 ml engineer 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 edn EDN 2012 28 dataNotation 0 178 2 1 24386 true 1 datomic https://github.com/edn-format/edn dataNotation 0 0 clojure clojure text/x-clojure source.clojure data 2012 2024 2012 100 99 2581 25 false 149 2013 2018 1 36 Extensible Data Notation edn 2012 2014 29 4 1 1 300 https://github.com/edn-format edn markdown true 3083 0 29 false https://learnxinyminutes.com/docs/edn/#:~:text=Extensible%20Data%20Notation%20(EDN)%20is,restricted%20to%20data%2C%20no%20code. text https://github.com/antlr/grammars-v4/tree/master/edn Unknown "{:a 1, ""foo"" :bar, [1 2 3] four}" "[{:db/id #db/id [db.part/db] :db/ident :object/name :db/doc ""Name of a Solar System object."" :db/valueType :db.type/string :db/index true :db/cardinality :db.cardinality/one :db.install/_attribute :db.part/db} {:db/id #db/id [db.part/db] :db/ident :object/meanRadius :db/doc ""Mean radius of an object."" :db/index true :db/valueType :db.type/double :db/cardinality :db.cardinality/one :db.install/_attribute :db.part/db} {:db/id #db/id [db.part/db] :db/ident :data/source :db/doc ""Source of the data in a transaction."" :db/valueType :db.type/string :db/index true :db/cardinality :db.cardinality/one :db.install/_attribute :db.part/db}] [{:db/id #db/id [db.part/tx] :db/doc ""Solar system objects bigger than Pluto.""} {:db/id #db/id [db.part/tx] :data/source ""http://en.wikipedia.org/wiki/List_of_Solar_System_objects_by_size""} {:db/id #db/id [db.part/user] :object/name ""Sun"" :object/meanRadius 696000.0} {:db/id #db/id [db.part/user] :object/name ""Jupiter"" :object/meanRadius 69911.0} {:db/id #db/id [db.part/user] :object/name ""Saturn"" :object/meanRadius 58232.0} {:db/id #db/id [db.part/user] :object/name ""Uranus"" :object/meanRadius 25362.0} {:db/id #db/id [db.part/user] :object/name ""Neptune"" :object/meanRadius 24622.0} {:db/id #db/id [db.part/user] :object/name ""Earth"" :object/meanRadius 6371.0} {:db/id #db/id [db.part/user] :object/name ""Venus"" :object/meanRadius 6051.8} {:db/id #db/id [db.part/user] :object/name ""Mars"" :object/meanRadius 3390.0} {:db/id #db/id [db.part/user] :object/name ""Ganymede"" :object/meanRadius 2631.2} {:db/id #db/id [db.part/user] :object/name ""Titan"" :object/meanRadius 2576.0} {:db/id #db/id [db.part/user] :object/name ""Mercury"" :object/meanRadius 2439.7} {:db/id #db/id [db.part/user] :object/name ""Callisto"" :object/meanRadius 2410.3} {:db/id #db/id [db.part/user] :object/name ""Io"" :object/meanRadius 1821.5} {:db/id #db/id [db.part/user] :object/name ""Moon"" :object/meanRadius 1737.1} {:db/id #db/id [db.part/user] :object/name ""Europa"" :object/meanRadius 1561.0} {:db/id #db/id [db.part/user] :object/name ""Triton"" :object/meanRadius 1353.4} {:db/id #db/id [db.part/user] :object/name ""Eris"" :object/meanRadius 1163.0}]" https://github.com/edn-format/edn true true true true true true false true true 3 0 https://github.com/atom/language-clojure 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 edn monaco Monaco Editor 2016 16 editor https://microsoft.github.io/monaco-editor/ 0 0.48.0 179 0 10 24382 false 5 ace codemirror highlightjs prismjs pygments https://github.com/Microsoft/monaco-editor editor 2016 2024 2016 528 3515 39317 537 false 2016 2025 3529 355 785 134 423919 https://microsoft.github.io/monaco-editor/playground.html The Monaco Editor is the code editor that powers VS Code. The Monaco Editor is the code editor that powers VS Code. Microsoft The Monaco Editor is the code editor that powers VS Code. typescript json javascript html markdown yaml css svg scss bourne-shell true 50219 0 27 codemirror false 0 true na United States https://github.com/Microsoft/monaco-editor 0 0 htmx htmx 2020 Carson Gross 21 template https://htmx.org/ 0 https://htmx.org/essays/ 1.9.12 180 1 13 24381 true 0 https://github.com/bigskysoftware/htmx template 2020 2024 2020 203 1207 35764 562 false 2020 2025 3470 435 644 96 402937 2020 htmx gives you access to AJAX, CSS Transitions, WebSockets and Server Sent Events directly in HTML, using attributes, so you can build modern user interfaces with the simplicity and power of hypertext htmx gives you access to AJAX, CSS Transitions, WebSockets and Server Sent Events directly in HTML, using attributes, so you can build modern user interfaces with the simplicity and power of hypertext https://github.com/bigskysoftware/ htmx gives you access to AJAX, CSS Transitions, WebSockets and Server Sent Events directly in HTML, using attributes, so you can build modern user interfaces with the simplicity and power of hypertext markdown javascript html svg json css toml typescript bourne-shell yaml xml ruby csv https://htmx.org/reference/ true 51822 0 34 1 false 1 true https://htmx.org/docs/ United States " " https://htmx.org/discord https://www.reddit.com/r/htmx/ https://twitter.com/htmx_org https://github.com/bigskysoftware/htmx 0 0 htmx.org jekyll Jekyll 2008 Tom Preston-Werner 17 staticSiteGenerator https://jekyllrb.com/ 0 v4.3.3 181 0 19 24379 true 1 scroll https://github.com/jekyll/jekyll staticSiteGenerator 2008 2024 2008 1427 9926 48705 225 false 2008 2025 12771 1282 812 71 66647 2009 Transforms your plain text into static websites and blogs. Transforms your plain text into static websites and blogs. https://github.com/jekyll Transforms your plain text into static websites and blogs. markdown ruby html yaml gherkin scss bash erb javascript json svg coffeescript css xml dockerfile php csv toml xhtml true 82999 0 37 wordpress 1 false 4 true Various https://www.reddit.com/r/jekyll/ https://github.com/jekyll/jekyll https://en.wikipedia.org/wiki/Jekyll_(software) 0 0 jekyllrb.com smali Smali 2010 26 assembly 0 v2.5.2 182 3 8 24377 true 0 https://github.com/JesusFreke/smali assembly 195 212 2479 3 "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""" text source.smali programming 2012 2024 2009 280 1066 6269 139 false s/Smali.smali 46 2013 2016 7 4 dalvik.py 2009 2022 1942 49 930 11 156730 https://github.com/JesusFreke/smali/issues smali smali smali java gradle xml bash markdown bourne-shell c make true 9717 0 36 false 2 true https://github.com/JesusFreke/smali/wiki text United States ".method public getTokens(I)I .locals 2 .param p1, ""amt"" # I .prologue const/4 v0, 0x0 .line 512 iget-boolean v1, p0, Lcom/limbenjamin/Example;->isPaid:Z if-nez v1, :cond_1 .line 514 :cond_0 :goto_0 return v0 .line 513 :cond_1 iget-object v1, p0, Lcom/limbenjamin/Example;->handler:Lcom/limbenjamin/ExampleHandler; if-eqz v1, :cond_0 .line 514 move v3, p1 iget-object v0, p0, Lcom/limbenjamin/Example;->handler:Lcom/limbenjamin/ExampleHandler; invoke-interface {v0, v3}, Lcom/limbenjamin/ExampleHandler;->creditTokens(I)V move-result v0 goto :goto_0 .end method" ".class public LHelloWorld; .super Ljava/lang/Object; .method public static main([Ljava/lang/String;)V .registers 2 sget-object v0, Ljava/lang/System;->out:Ljava/io/PrintStream; const-string v1, ""Hello World"" invoke-virtual {v0, v1}, Ljava/io/PrintStream;->println(Ljava/lang/String;)V return-void .end method " ".class public Lcom/tdq/game/shootbubble/sprite/PenguinSprite; .super Lcom/tdq/game/shootbubble/sprite/Sprite; .source ""PenguinSprite.java"" # static fields .field public static final LOST_SEQUENCE:[[I .field public static final STATE_FIRE:I = 0x2 .field public static final STATE_GAME_LOST:I = 0x5 .field public static final STATE_GAME_WON:I = 0x4 .field public static final STATE_TURN_LEFT:I = 0x0 .field public static final STATE_TURN_RIGHT:I = 0x1 .field public static final STATE_VOID:I = 0x3 .field public static final WON_SEQUENCE:[[I # instance fields .field private count:I .field private currentPenguin:I .field private finalState:I .field private nextPosition:I .field private rand:Ljava/util/Random; .field private spritesImage:Lcom/tdq/game/shootbubble/sprite/BmpWrap; # direct methods .method static constructor ()V .locals 8 .prologue const/4 v7, 0x4 const/4 v6, 0x3 const/4 v5, 0x1 const/4 v4, 0x0 const/4 v3, 0x2 .line 67 const/16 v0, 0x8 new-array v0, v0, [[I new-array v1, v3, [I fill-array-data v1, :array_0 aput-object v1, v0, v4 new-array v1, v3, [I fill-array-data v1, :array_1 aput-object v1, v0, v5 new-array v1, v3, [I fill-array-data v1, :array_2 aput-object v1, v0, v3 new-array v1, v3, [I fill-array-data v1, :array_3 aput-object v1, v0, v6 new-array v1, v3, [I fill-array-data v1, :array_4 aput-object v1, v0, v7 const/4 v1, 0x5 new-array v2, v3, [I fill-array-data v2, :array_5 aput-object v2, v0, v1 const/4 v1, 0x6 new-array v2, v3, [I fill-array-data v2, :array_6 aput-object v2, v0, v1 const/4 v1, 0x7 new-array v2, v3, [I fill-array-data v2, :array_7 aput-object v2, v0, v1 sput-object v0, Lcom/tdq/game/shootbubble/sprite/PenguinSprite;->LOST_SEQUENCE:[[I .line 69 const/16 v0, 0x8 new-array v0, v0, [[I new-array v1, v3, [I fil" Smali Smali https://github.com/JesusFreke/smali # """" true true false true 0 1 Smali https://github.com/ShaneWilton/sublime-smali Smali 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 json-ld JSON-LD 2010 Dave Longley 21 dataValidationLanguage https://json-ld.org/ 0 8.3.3-0 183 1 6 24376 true 5 krml krml microdata rdf rdfa https://github.com/digitalbazaar/jsonld.js dataValidationLanguage 0 0 javascript javascript application/json source.js data 2011 2024 2010 66 195 1652 144 false 1133 2013 2018 1 103 JavaScript Object Notation for Linked Data data.py 2010 2024 2348 49 76 4 25162 2010 2010 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. 307 259 34228206 https://www.w3.org/2018/json-ld-wg/ jsonld jsonld javascript markdown json yaml idl bourne-shell true 4043 0 27 1 false 8 true text Various "{ ""@context"": { ""property"": ""http://example.com/vocab#property"" }, ""@id"": ""../document-relative"", ""@type"": ""#document-relative"", ""property"": { ""@context"": { ""@base"": ""http://example.org/test/"" }, ""@id"": ""../document-base-overwritten"", ""@type"": ""#document-base-overwritten"", ""property"": [ { ""@context"": null, ""@id"": ""../document-relative"", ""@type"": ""#document-relative"", ""property"": ""context completely reset, drops property"" }, { ""@context"": { ""@base"": null }, ""@id"": ""../document-relative"", ""@type"": ""#document-relative"", ""property"": ""only @base is cleared"" } ] } }" JSON-LD https://github.com/digitalbazaar/jsonld.js https://en.wikipedia.org/wiki/JSON-LD 0 0 json-ld.org https://github.com/atom/language-javascript JSONLD luna Luna 2015 Wojciech Danilo 20 pl https://www.luna-lang.org/ 0 184 0 23 24367 true 1 enso https://github.com/luna/luna pl 2016 2024 2015 89 320 7319 733 false Enso 2019 2025 8401 67 8316 112 459863 2016 Now called Enso. Now called Enso. https://github.com/enso-org Now called Enso. java scala typescript rust markdown yaml svg json csv toml javascript python xml bourne-shell css html haskell dockerfile cpp nix make powershell bash true 8348 0 45 enso enso 1 false true United States and Poland https://twitter.com/luna_language https://github.com/luna/luna 0 1 luna-lang.org 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 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 micropython MicroPython 2014 Damien P. George 21 pl https://micropython.org/ 0 v1.23.0-preview 185 0 22 24367 true 0 https://github.com/micropython/micropython pl 2013 2024 2013 732 7545 18832 1796 false 2013 2025 16814 739 5831 68 761129 2013 2013 c arduino python arm 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. 2016 132 35 51 50278739 https://github.com/micropython python c expect restructuredtext csv make json markdown cmake yaml javascript bourne-shell assembly-language xml svg html toml cpp css protobuf diff pascal true 42888 0 43 1 false 1 true text Australia and The Netherlands https://twitter.com/micropython https://github.com/micropython/micropython https://github.com/goatchurchprime/jupyter_micropython_kernel/ https://en.wikipedia.org/wiki/MicroPython 30 1 micropython.org 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 year|title|doi|citations|influentialCitations|authors|paperId\n2020|Programming in MicroPython|10.1007/978-1-4842-5796-8_3|1|0|Charles Bell|991ad6f5b16d0179712d7272b857091d251cb9b2 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 korn-shell Korn shell 1983 23 pl http://www.kornshell.org/ 5 186 2 24366 3481 true 5 abcl-lang java ncl noweb revolution-programming-language pl false k/KSH.ksh ksh 2005 1983 c unix bourne-shell emacs-editor vi bash motif-software tcl arexx 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. 2016 66 20 351 17213 https://github.com/att ksh 2190 0 26 ksh text United States "#!/bin/ksh echo ""Hello World"" " https://reddit.com/r/ksh https://riju.codes/ksh "echo ""Hello, world!"" " KSH echo """" true true true https://en.wikipedia.org/wiki/KornShell 0 0 https://hopl.info/showlanguage.prx?exp=3481 Korn shell kornshell.org bun Bun 2021 Jarred Sumner 20 vm https://bun.sh/ 0 https://bun.sh/blog 187 0 3 24364 false 0 https://github.com/oven-sh/bun vm 2021 2024 2021 604 2581 72307 3444 false 2021 2025 16780 801 37783 244 8052989 https://github.com/oven-sh/bun/issues/159 2021 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. 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. 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. toml javascript dockerfile true 80873 0 28 deno v8 javascript typescript jsx 1 false https://bun.sh/docs United States https://news.ycombinator.com/item?id=31993429 https://bun.sh/discord https://github.com/oven-sh/bun https://en.wikipedia.org/wiki/Bun_(software) 0 0 bun.sh pegjs PEG.js 2010 David Majda 30 grammarLanguage https://pegjs.org/ 0 v0.10.0 188 1 7 24362 true 0 https://github.com/pegjs/pegjs grammarLanguage 63 63 72 javascript javascript text/javascript source.pegjs programming 2010 2024 2010 91 419 4802 116 false 2010 2019 1417 29 178 6 30822 https://pegjs.org/online 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. 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. https://github.com/pegjs 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. pegjs javascript markdown css json typescript html yaml javascript true 6090 0 42 1 false 0 true pegjs text Germany and United Kingdom "start = additive additive = left:multiplicative ""+"" right:additive { return left + right; } / multiplicative multiplicative = left:primary ""*"" right:multiplicative { return left * right; } / primary primary = integer / ""("" additive:additive "")"" { return additive; } integer ""integer"" = digits:[0-9]+ { return parseInt(digits.join(""""), 10); }" https://twitter.com/pegjs https://github.com/pegjs/pegjs // /* */ true true true false 0 0 pegjs.org PEG.js PEG.js hurl hurl 2020 Orange S.A 24 application https://hurl.dev/ 0 2.0.1 189 0 18 24358 false 0 https://github.com/Orange-OpenSource/hurl application 2020 2024 2020 51 473 12390 137 false hurl.png The name Hurl is a tribute to the awesome curl, with a focus on the HTTP protocol. 2020 2025 4259 87 2249 312 149938 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 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 https://github.com/Orange-OpenSource 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 bourne-shell powershell rust python markdown json html yaml css svg toml javascript xml bash vim-script lisp dockerfile c https://hurl.dev/docs/samples.html true 13898 0 45 curl curl curl 1 false 2 true https://hurl.dev/#also-an-http-test-tool https://hurl.dev/docs/manual.html France https://hurl.dev/docs/running-tests.html https://github.com/Orange-OpenSource/hurl 0 0 hurl.dev netlogo NetLogo 1999 Uri Wilensky 30 pl simulation http://ccl.northwestern.edu/netlogo/ 0 6.4.0 190 1 13 24355 7674 true 1 xtao https://github.com/NetLogo/NetLogo pl 138 154 3859 0 lisp commonlisp text/x-common-lisp source.lisp programming 2011 2024 2011 79 239 1001 481 false 40 2005 2018 1 6 2011 2025 9203 88 3193 78 442115 1999 starlogo logo isbn scala java NetLogo is an agent-based programming language and integrated modeling environment. 2004 80 67 255 593757 Northwestern University nlogo nlogo nlogo3d nls scala java csv mustache xml bourne-shell markdown yaml html xslt css bash dtd true 2428 0 48 1 false 6 true nlogo nls text http://www.rosettacode.org/wiki/Category:NetLogo United States "patches-own [ living? ;; indicates if the cell is living live-neighbors ;; counts how many neighboring cells are alive ] to setup-blank clear-all ask patches [ cell-death ] reset-ticks end to setup-random clear-all ask patches [ ifelse random-float 100.0 < initial-density [ cell-birth ] [ cell-death ] ] reset-ticks end to cell-birth set living? true set pcolor fgcolor end to cell-death set living? false set pcolor bgcolor end to go ask patches [ set live-neighbors count neighbors with [living?] ] ;; Starting a new ""ask patches"" here ensures that all the patches ;; finish executing the first ask before any of them start executing ;; the second ask. This keeps all the patches in synch with each other, ;; so the births and deaths at each generation all happen in lockstep. ask patches [ ifelse live-neighbors = 3 [ cell-birth ] [ if live-neighbors != 2 [ cell-death ] ] ] tick end to draw-cells let erasing? [living?] of patch mouse-xcor mouse-ycor while [mouse-down?] [ ask patch mouse-xcor mouse-ycor [ ifelse erasing? [ cell-death ] [ cell-birth ] ] display ] end " https://twitter.com/netlogo https://github.com/NetLogo/NetLogo ; true false true true true false https://en.wikipedia.org/wiki/NetLogo 4 10 https://hopl.info/showlanguage.prx?exp=7674 NetLogo https://github.com/textmate/lisp.tmbundle 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 NetLogo 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 dot DOT 2007 Emden R. Gansner and Eleftherios Koutsofios and Stephen North 27 diagramLang 0 191 3 24352 true 7 d2 fcl flowchart-fun flowgorithm fsl mscgen workfl diagramLang 67 68 27831 0 text source.dot data false 47 2005 2015 2 8 Graphviz DOT graphviz.py 2007 javascript java python google-cloud actionscript svg 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. 2004 312 44 268 571341 AT&T dot gv gv dot 1780 0 32 3 https://graphviz.org/doc/info/lang.html text 2930 https://github.com/antlr/grammars-v4/tree/master/dot United States https://www.graphviz.org/pdf/dotguide.pdf // The graph name and the semicolons are optional graph graphname { a -- b -- c; b -- d; } "/* Huffman Tree DOT graph. DOT Reference : http://www.graphviz.org/doc/info/lang.html http://en.wikipedia.org/wiki/DOT_language Timestamp : 1415989074 Phrase : 'OH GOD WHY IS LINGUIST SO ANAL ABOUT THIS STUFF' Generated on http://huffman.ooz.ie/ */ digraph G { edge [label=0]; graph [ranksep=0]; T [shape=record, label=""{{T|4}|000}""]; S [shape=record, label=""{{S|5}|001}""]; SPACE [shape=record, label=""{{SPACE|9}|01}""]; A [shape=record, label=""{{A|3}|1000}""]; H [shape=record, label=""{{H|3}|1001}""]; U [shape=record, label=""{{U|3}|1010}""]; L [shape=record, label=""{{L|2}|10110}""]; N [shape=record, label=""{{N|2}|10111}""]; I [shape=record, label=""{{I|4}|1100}""]; O [shape=record, label=""{{O|4}|1101}""]; G [shape=record, label=""{{G|2}|11100}""]; F [shape=record, label=""{{F|2}|11101}""]; GF [label=4]; W [shape=record, label=""{{W|1}|111100}""]; Y [shape=record, label=""{{Y|1}|111101}""]; B [shape=record, label=""{{B|1}|111110}""]; D [shape=record, label=""{{D|1}|111111}""]; BD [label=2]; WYBD [label=4]; GFWYBD [label=8]; 47 -> 18 -> 9 -> T; 29 -> 13 -> 6 -> A; 7 -> U; 4 -> L; 16 -> 8 -> I; GFWYBD -> GF -> G; WYBD -> 2 -> W; BD -> B;9 -> S [label=1]; 18 -> SPACE [label=1]; 6 -> H [label=1]; 13 -> 7 -> 4 -> N [label=1]; 8 -> O [label=1]; GF -> F [label=1]; 2 -> Y [label=1]; 47 -> 29 -> 16 -> GFWYBD -> WYBD -> BD -> D [label=1]; }" Graphviz "digraph g { node [shape=plaintext]; A1 -> B1; A2 -> B2; A3 -> B3; A1 -> A2 [label=f]; A2 -> A3 [label=g]; B2 -> B3 [label=""g'""]; B1 -> B3 [label=""(g o f)'"" tailport=s headport=s]; { rank=same; A1 A2 A3 } { rank=same; B1 B2 B3 } }" // /* */ true true true false https://github.com/laixintao/jupyter-dot-kernel https://en.wikipedia.org/wiki/DOT_(graph_description_language) 0 4 Graphviz (DOT) https://github.com/textmate/graphviz.tmbundle Graphviz (DOT) 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 moonscript MoonScript 2011 36 pl http://moonscript.org/ 0 v0.5.0 192 3 6 24350 true 0 https://github.com/leafo/moonscript pl 276 359 818 0 moon text source.moonscript programming 2011 2024 2011 92 190 3166 188 false m/Moonscript.moon 26 2011 2015 1 6 scripting.py 2011 2025 855 38 160 4 11996 http://moonscript.org/compiler/ https://github.com/leafo/moonscript/issues moon moon moon lua markdown yaml make bourne-shell c lua true 3976 0 48 false 0 true https://tio.run/#moonscript https://moonscript.org/reference/ text http://www.rosettacode.org/wiki/Category:MoonScript United States "class Thing name: ""unknown"" class Person extends Thing say_name: => print ""Hello, I am #{@name}!"" with Person! .name = ""MoonScript"" \say_name!" print 'Hello World' " types = require ""moonscript.types"" util = require ""moonscript.util"" data = require ""moonscript.data"" import reversed, unpack from util import ntype, mtype, build, smart_node, is_slice, value_is_singular from types import insert from table import NameProxy, LocalName from require ""moonscript.transform.names"" destructure = require ""moonscript.transform.destructure"" local implicitly_return class Run new: (@fn) => self[1] = ""run"" call: (state) => self.fn state -- transform the last stm is a list of stms -- will puke on group apply_to_last = (stms, fn) -> -- find last (real) exp last_exp_id = 0 for i = #stms, 1, -1 stm = stms[i] if stm and mtype(stm) != Run last_exp_id = i break return for i, stm in ipairs stms if i == last_exp_id fn stm else stm -- is a body a sindle expression/statement is_singular = (body) -> return false if #body != 1 if ""group"" == ntype body is_singular body[2] else true find_assigns = (body, out={}) -> for thing in *body switch thing[1] when ""group"" find_assigns thing[2], out when ""assign"" table.insert out, thing[2] -- extract names out hoist_declarations = (body) -> assigns = {} -- hoist the plain old assigns for names in *find_assigns body for name in *names table.insert assigns, name if type(name) == ""string"" -- insert after runs idx = 1 while mtype(body[idx]) == Run do idx += 1 table.insert body, idx, {""declare"", assigns} expand_elseif_assign = (ifstm) -> for i = 4, #ifstm case = ifstm[i] if ntype(case) == ""elseif"" and ntype(case[2]) == ""assign"" split = { unpack ifstm, 1, i - 1 } insert split, { ""else"", { {""if"", case[2], case[3], unpack ifstm, i + 1} } } return split ifstm constructor_name = ""new"" with_continue_listener = (body) -> continue_name = nil { Run => @listen ""continue"", -> unless continue_name" MoonScript Moonscript https://github.com/leafo/moonscript -- print ' true false true true true true false true 0 0 moonscript.org MoonScript https://github.com/leafo/moonscript-tmbundle MoonScript restructuredtext reStructuredText 2002 David Goodger 23 textMarkup 131 193 4 24341 true 131 abcl-lang ace ail arrow-format asciidots asdf astroml avi-synth bazel berry blender-app chatterbot cir clash cloc cmake coconut codeql common-workflow-language coq couchdb cryptol curv differential-datalog djangoql dlvm docopt easybuild ecl edgedb egison elpi emscripten f-prime factor fardlang felix fish flatline futhark ghc hcl hhvm highlightjs hobbes htsql hy idio idris impala invokator iterm2 jeeves jinja k-framework leo-editor lift links-programming-language linux loci manim mathics matplotlib metalang99 mgmt michelson micropython mimium minilang minizinc mochi mongodb monte myia mys nestedtext netbeans-editor nim nimskull nltk nodejs nulan numba nylo obsidian-lang ooc open-shading-language pact pan pandas paraview parboiled2 phorth php pygments pyth python pytorch redprl ricscript rita robotframework roy saltstack scikit-learn scipy seq skulpt snowball-programming-language solidity sophie sqlalchemy squirrel stencil swift sympy tiledb tornado triton twtxt ultralisp-pm vale-assembly volt vyper wiredtiger xarray xgboost-model xgboost xlwings-editor yara yeti textMarkup 31 true 0 rst text rst text/x-rst text.restructuredtext prose false r/reStructuredText.rst 101 2014 2018 1 16 markup.py 2002 rest java pod perl python cmake markdown org textile html asciidoc txt2tags 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. 2004 161 56 259 730903 """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." """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." https://sourceforge.net/p/docutils/_list/tickets """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." rst rest resttxt rsttxt rst rst rest true 1025 0 27 1 rest rest.txt rst rst.txt https://docutils.sourceforge.io/rst.html text https://github.com/antlr/grammars-v4/tree/master/restructuredtext restructuredtext Canada http://docutils.sourceforge.net/rst.html ============ Hello World ============ "Contributing to SciPy ===================== This document aims to give an overview of how to contribute to SciPy. It tries to answer commonly asked questions, and provide some insight into how the community process works in practice. Readers who are familiar with the SciPy community and are experienced Python coders may want to jump straight to the `git workflow`_ documentation. Contributing new code --------------------- If you have been working with the scientific Python toolstack for a while, you probably have some code lying around of which you think ""this could be useful for others too"". Perhaps it's a good idea then to contribute it to SciPy or another open source project. The first question to ask is then, where does this code belong? That question is hard to answer here, so we start with a more specific one: *what code is suitable for putting into SciPy?* Almost all of the new code added to scipy has in common that it's potentially useful in multiple scientific domains and it fits in the scope of existing scipy submodules. In principle new submodules can be added too, but this is far less common. For code that is specific to a single application, there may be an existing project that can use the code. Some scikits (`scikit-learn`_, `scikits-image`_, `statsmodels`_, etc.) are good examples here; they have a narrower focus and because of that more domain-specific code than SciPy. Now if you have code that you would like to see included in SciPy, how do you go about it? After checking that your code can be distributed in SciPy under a compatible license (see FAQ for details), the first step is to discuss on the scipy-dev mailing list. All new features, as well as changes to existing code, are discussed and decided on there. You can, and probably should, already start this discussion before your code is finished. Assuming the outcome of the discussion on the mailing list is positive and you have a function or piece of code that does what you nee" reStructuredText https://riju.codes/restructuredtext Hello, world! ":: some literal text This may also be used inline at the end of a paragraph, like so:: some more literal text .. code:: python print(""A literal block directive explicitly marked as python code"")" reStructuredText true https://en.wikipedia.org/wiki/ReStructuredText 0 0 https://github.com/Lukasa/language-restructuredtext reStructuredText tensorflow TensorFlow 2015 Manjunath Kudlur 18 library https://www.tensorflow.org/ 0 v2.16.1 194 0 34 24340 true 0 https://github.com/tensorflow/tensorflow library 2015 2024 2015 7615 74094 184333 3994 false 91480 112 2015 2025 191509 4905 34981 1195 7693164 2015 2015 python cuda linux android ios 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. 2015 1652 111 360 48508507 cpp python bazel markdown protobuf bourne-shell starlark java cmake xml objective-cpp diff go dockerfile yaml jupyter-notebook json c objective-c swift svg gradle bash ruby html csv javascript csharp perl make ini pascal llvmir cython true 419802 721 52 1 false 2 true text https://twitter.com/tensorflow https://github.com/tensorflow/tensorflow https://www.meetup.com/topics/tensorflow https://en.wikipedia.org/wiki/TensorFlow 1 0 tensorflow.org tensorflow engineer title|year|author|goodreadsId|rating|ratings|reviews\nTensorFlow For Dummies (For Dummies (Computer/Tech))||Matthew Scarpino|60733334|0.0|0|0 asp ASP 1996 28 template 0 195 2 24339 5356 true 1 asp.net template 22600 32849 47971 3 "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架构机型""" false a/ASP.asp 39 2005 2015 4 Active Server Pages dotnet.py 2000 vbscript jscript html csharp java-server-pages php 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. 2001 329 817 1093 2883 Microsoft asp asax ascx ashx asmx aspx axd asp aspx asax ascx ashx asmx axd false 1865 9630 34 asa ashx asp axd https://learn.microsoft.com/en-us/previous-versions/iis/6.0-sdk/ms526064(v=vs.90) text 4194 http://www.rosettacode.org/wiki/Category:ASP United States "<%@ Language= ""VBScript"" %> <% Response.Write(""Hello World"") %> " aspx-vb "<% On Error Resume Next Response.Write 1 / 0 ' Division by zero If Err.Number <> 0 Then Response.Write ""Error Code: "" & Server.HTMLEncode(Err.Number) & """" Response.Write ""Error Source: "" & Server.HTMLEncode(Err.Source) & """" Response.Write ""Error Description: "" & Server.HTMLEncode(Err.Description) & """" Err.Clear End If %>" ASP Response.Write """" true true https://en.wikipedia.org/wiki/Active_Server_Pages 72 7 https://hopl.info/showlanguage.prx?exp=5356 ASP https://github.com/textmate/asp.tmbundle 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 ASP ASP developer 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 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 flutter Flutter 2017 Eric Seidel 19 framework https://flutter.dev 0 196 1 26 24336 false 0 https://github.com/flutter/flutter framework 2015 2024 3517 27376 165775 12763 false f/Flutter.dart 94702 146 2013 2025 83943 2174 14544 316 2017 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. 534 488 54699721 Flutter transforms the development process. Build, test, and deploy beautiful mobile, web, desktop, and embedded experiences from a single codebase. Flutter transforms the development process. Build, test, and deploy beautiful mobile, web, desktop, and embedded experiences from a single codebase. Google Flutter transforms the development process. Build, test, and deploy beautiful mobile, web, desktop, and embedded experiences from a single codebase. dart dart markdown xml yaml json gradle objective-c java cpp cmake swift html kotlin bourne-shell svg javascript bash ruby groovy css csv powershell glsl protobuf toml c true 392769 0 45 1 false https://docs.flutter.dev/ United States https://www.youtube.com/flutterdev import 'package:flutter/widgets.dart'; void main() { runApp( Text( 'Hello World', textDirection: TextDirection.ltr, ), ); } https://www.reddit.com/r/FlutterDev/ https://twitter.com/FlutterDev Flutter https://github.com/flutter/flutter https://www.meetup.com/pro/flutter/ https://en.wikipedia.org/wiki/Flutter_(software) 0 0 api-blueprint API Blueprint 2013 23 pl https://apiblueprint.org 0 197 1 1 24333 true 0 https://github.com/apiaryio/api-blueprint pl 698 810 14496 0 markdown text.html.markdown.source.gfm.apib markup 2013 2024 2013 201 2140 8631 66 false 72 2013 2018 3 15 2013 2022 432 63 31 2 737 2013 API Blueprint apib markdown true 15316 0 25 false https://apiblueprint.org/documentation/ text United States FORMAT: 1A # The Simplest API This is one of the simplest APIs written in the **API Blueprint**. One 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). **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. Also 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). ## API Blueprint + [This: Raw API Blueprint](https://raw.github.com/apiaryio/api-blueprint/master/examples/01.%20Simplest%20API.md) + [Next: Resource and Actions](02.%20Resource%20and%20Actions.md) # GET /message + Response 200 (text/plain) Hello World! https://twitter.com/apiblueprint https://github.com/apiaryio/api-blueprint # true true false 0 0 apiblueprint.org API Blueprint https://github.com/apiaryio/api-blueprint-sublime-plugin API Blueprint vala Vala 2006 33 pl https://wiki.gnome.org/Projects/Vala 4 198 4 24332 true 4 ace arrow-format cloc mal pl 1526 2046 3465 0 vala source.vala programming false v/Vala.vala 23 2010 2016 6 c_like.py 2017 c csharp d java boo emacs-editor sublime-editor textmate-editor eclipse-editor vim visual-studio-code-editor genie python Vala is an object-oriented programming language with a self-hosting compiler that generates C code and uses the GObject system. Vala is syntactically similar to C# and includes several features such as: anonymous functions, signals, properties, generics, assisted memory management, exception handling, type inference, and foreach statements. Its developers Jürg Billeter and Raffaele Sandrini aim to bring these features to the plain C runtime with little overhead and no special runtime support by targeting the GObject object system. Rather than compiling directly to machine code or assembly language, it compiles to a lower level intermediate language. It source-to-source compiles to C, which is then compiled with a C compiler for a given platform, such as GCC. For memory management, the GObject system provides reference counting. In C, a programmer must manually manage adding and removing references, but in Vala, managing such reference counts is automated if a programmer uses the language's built-in reference types rather than plain pointers. Using functionality from native code libraries requires writing vapi files, defining the library interfacing. Writing these interface definitions is well-documented for C libraries, especially when based on GObject. However, C++ libraries are not supported. Vapi files are provided for a large portion of the GNOME platform, including GTK+. Vala was conceived by Jürg Billeter and was implemented by him and Raffaele Sandrini, finishing a self-hosting compiler in May 2006. 2007 190 355 428 12655903 vala vapi vala vala vapi vala vapi c true 1171 0 38 vala https://tio.run/#vala https://wiki.gnome.org/Projects/Vala/Documentation text http://www.rosettacode.org/wiki/Category:Vala https://news.ycombinator.com/item?id=32113825 "int main (string[] args) { var app = new Gtk.Application( ""com.example.App"", ApplicationFlags.FLAGS_NONE ); app.activate.connect(() => { var win = new Gtk.ApplicationWindow(app); var btn = new Gtk.Button.with_label(""Hello World""); btn.click.connect(win.close); win.child = btn; win.present(); }) return app.run(args); }" "static void main (string[] args) { stdout.printf (""Hello World\n""); } " Vala https://riju.codes/vala "void main () { print(""Hello, world!\n""); } " https://twitter.com/vala_lang "void main () { print(""Hello, world!\n""); }" Vala // stdout.printf """" true true true false true https://en.wikipedia.org/wiki/Vala_(programming_language) 3 0 Vala https://github.com/technosophos/Vala-TMBundle year|publisher|title|authors|isbn13\n2019|Apress|Introducing Vala Programming: A Language and Techniques to Boost Productivity|Lauer, Michael|9781484253793\n2019|Apress|Introducing Vala Programming: A Language and Techniques to Boost Productivity|Lauer, Michael|9781484253809\n2010||Vala (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130894771 Vala v8 V8 2008 Lars Bak 17 vm https://v8.dev/ 0 12.7.131 199 0 23 24330 false 1 bun https://github.com/v8/v8 vm 2014 2024 2008 968 3931 23018 14 false 2008 2025 130036 1300 17162 1089 3859858 Google javascript cpp python json typescript html bourne-shell markdown c wasm pascal css starlark yaml vim-script xml assembly-language bash svg scheme r bazel make true 36133 0 43 javascript wasm 1 false 12 true text https://www.youtube.com/watch?v=Mbpd1K-ToYg https://github.com/v8/v8 https://en.wikipedia.org/wiki/V8_(JavaScript_engine) 0 0 lex Lex 1975 Mike Lesk and Eric Schmidt 23 grammarLanguage 64 200 3 24330 680 true 64 ad-hoc ana blox boomerang-decompiler c3 carbon cmake cognate cor crema duro ec ecl eiffel elena em euphoria fancy filebench-wml flex gap gforth hhvm hobbes invokator jison-lex jq koka latino lean linux little logica mal mimium mlpolyr mudlle mythryl ncl nesc never opal open-shading-language opencomal openscad orca php poke postgresql prometheus ragel ramdascript recfiles redprl ricscript shill slony solid streem t2b urweb vlc vsxu yara grammarLanguage 9501 12486 Lexer.x lexer.x 2902 0 flex text source.lex programming false 1 1975 yacc unix c regex bison ragel "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." 2002 178 280 304 105985 https://github.com/babyraging/yash/issues l lex 1110 0 29 2 l lex text United States https://github.com/babyraging/yash "/*** Definition section ***/ %{ /* C code to be copied verbatim */ #include %} %% /*** Rules section ***/ /* [0-9]+ matches a string of one or more digits */ [0-9]+ { /* yytext is a string containing the matched text. */ printf(""Saw an integer: %s\n"", yytext); } .|\n { /* Ignore all other characters. */ } %% /*** C Code section ***/ int main(void) { /* Call the lexer, then quit. */ yylex(); return 0; }" "/* +----------------------------------------------------------------------+ | Zend Engine | +----------------------------------------------------------------------+ | Copyright (c) 1998-2012 Zend Technologies Ltd. (http://www.zend.com) | +----------------------------------------------------------------------+ | This source file is subject to version 2.00 of the Zend license, | | that is bundled with this package in the file LICENSE, and is | | available through the world-wide-web at the following url: | | http://www.zend.com/license/2_00.txt. | | If you did not receive a copy of the Zend license and are unable to | | obtain it through the world-wide-web, please send a note to | | license@zend.com so we can mail you a copy immediately. | +----------------------------------------------------------------------+ | Authors: Zeev Suraski | | Jani Taskinen | | Marcus Boerger | | Nuno Lopes | | Scott MacVicar | +----------------------------------------------------------------------+ */ /* $Id$ */ #include #include ""zend.h"" #include ""zend_globals.h"" #include #include ""zend_ini_scanner.h"" #if 0 # define YYDEBUG(s, c) printf(""state: %d char: %c\n"", s, c) #else # define YYDEBUG(s, c) #endif #include ""zend_ini_scanner_defs.h"" #define YYCTYPE unsigned char /* allow the scanner to read one null byte after the end of the string (from ZEND_MMAP_AHEAD) * so that if will be able to terminate to match the current token (e.g. non-enclosed string) */ #define YYFILL(n) { if (YYCURSOR > YYLIMIT) return 0" Saw an integer: 123 Saw an integer: 2 Saw an integer: 6 // /* */ true true true false https://en.wikipedia.org/wiki/Lex_(software) 2 0 https://hopl.info/showlanguage.prx?exp=680 Lex https://github.com/Alhadis/language-grammars 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 Lex codemirror CodeMirror 2007 Marijn Haverbeke 18 editor https://codemirror.net/ 0 0.16.0 201 0 6 24324 false 5 ace highlightjs monaco prismjs pygments https://github.com/codemirror/dev editor 2018 2024 2018 73 353 5557 23 false 2018 2024 1937 25 17 5 736 https://codemirror.net/try/ 2010 2007 javascript vi emacs-editor CodeMirror is a JavaScript component that provides a code editor in the browser. It has a rich programming API and a focus on extensibility. 2013 37 171 74 38914715 https://github.com/codemirror javascript yaml json markdown typescript html true 6848 0 25 monaco 1 false 0 true na Germany https://github.com/codemirror/dev https://en.wikipedia.org/wiki/CodeMirror 0 0 codemirror.net coconut Coconut 2014 32 pl https://coconut-lang.org/ http://coconut-lang.org/ 0 v3.1.0 202 2 7 24324 true 0 https://github.com/evhub/coconut pl 2014 2024 2014 62 120 4012 73 false c/Coconut.coc 2014 2024 5311 38 95 8 35270 https://cs121-team-panda.github.io/coconut-interpreter/ 2016 http://coconut-lang.org coc coco python yaml markdown json make restructuredtext toml python true 4412 0 42 false 3 true https://tio.run/#coconut text Various https://news.ycombinator.com/item?id=23759721 """Hello World"" |> print " https://riju.codes/coconut "print(""Hello, world!"") " Coconut https://github.com/evhub/coconut https://github.com/evhub/coconut print """" true true true true true true true true http://coconut-lang.org/ 0 0 coconut-lang.org koka Koka 2012 Daan Leijen 35 pl https://www.microsoft.com/en-us/research/project/koka/?from=http%3A%2F%2Fresearch.microsoft.com%2Fen-us%2Fprojects%2Fkoka 0 v3.1.1 203 1 30 24324 true 0 https://github.com/koka-lang/koka pl 2016 2024 2012 61 153 3178 182 false haskell.py 2012 2025 5733 60 1957 49 234546 https://rise4fun.com/koka/ A strongly typed functional-style language with effect types and handlers. A strongly typed functional-style language with effect types and handlers. Microsoft A strongly typed functional-style language with effect types and handlers. kk kki haskell c xml javascript markdown json bourne-shell cpp csharp ocaml cmake dockerfile swift svg java typescript lean vim-script css yaml lex yacc logos tex python lisp html sed less cson c true 3699 0 102 1 false 3 true https://tio.run/#koka text United States https://koka-lang.github.io/koka/doc/book.html "fun hello-ten() var i := 0 while { i < 10 } println(""hello"") i := i + 1" Koka 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 https://github.com/koka-lang/koka // println true true true true true true true true true false 0 0 highlightjs highlight.js 2006 Alexandre Go 16 library https://highlightjs.org/ 0 11.9.0 204 0 13 24320 true 3 ace prismjs pygments https://github.com/highlightjs/highlight.js library 2011 2024 2006 306 3560 23376 109 false 2006 2025 7094 842 1881 17 151410 2012 Syntax highlighting for the Web Syntax highlighting for the Web https://github.com/highlightjs/ Syntax highlighting for the Web javascript css markdown restructuredtext yaml json html typescript r make python dockerfile bash true 34900 0 32 pygments codemirror monaco 1 false 11 true Various https://twitter.com/highlightjs https://github.com/highlightjs/highlight.js 0 0 highlightjs.org zephir Zephir 2013 Andres Gutierrez 29 pl https://zephir-lang.com/ 0 0.17.0 205 1 14 24312 true 0 https://github.com/phalcon/zephir pl 127 140 91 0 php source.php.zephir programming 2013 2024 2013 198 467 3281 105 false 37 2013 2017 2 13 php.py 2013 2025 6230 147 1440 27 284133 2013 zep zep php c json bourne-shell yaml markdown m4 xml dockerfile javascript bash css make lisp true 5031 0 46 1 false 0 true https://docs.zephir-lang.com/0.12/en/welcome text "/** * CBLOCK tests * asfas */ %{ // top statement before namespace, add to after headers #define MAX_FACTOR 40 }% namespace Test; %{ // top statement before class, add to after headers // test include .h #include ""kernel/require.h"" }% %{ // c implement fibonacci static long fibonacci(long n) { if (n < 2) return n; else return fibonacci(n - 2) + fibonacci(n - 1); } }% class Cblock { public function testCblock1() { int a = 0; %{ a = MAX_FACTOR; }% return a; } public function testCblock2() { long a = 0; %{ a = fibonacci(MAX_FACTOR); }% return a; } } " Zephir https://twitter.com/zephirlang https://github.com/phalcon/zephir // /* */ true true true true true true false 0 0 zephir-lang.com Zephir https://github.com/phalcon/zephir-sublime Zephir m4 M4 1977 Brian Kernighan and Dennis Ritchie 28 pl 76 206 5 24310 766 true 76 ad-hoc bash bazel beef berkeleydb bio capn-proto cir cityhash-hash-function click cmake crmsh curv ec eiffel emscripten erlang felix filebench-wml flex flow9 g-portugol gap gforth ghc git groff hhvm huginn java jq kefir latino linux lobster mongodb nesc nodejs oil ooc opam-pm orca p-star pcre pgbouncer php poke postgresql pov-ray-sdl python qore racket ragel ramen recfiles redis ricscript ruby sile skip slony smallbasic smpl sqlite swi-prolog tridash ucl urweb vlc vsxu wonkey xgboost-model xgboost yara zephir zl pl 12126 15666 2405 0 text source.m4 programming false m/M4.m4 1 1977 assembly-language ratfor unix fortran html freebsd 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. 2004 99 256 200 625653 Bell Labs m4 mc m4 715 0 32 2 ac m4 https://tio.run/#m4 text M4 http://www.rosettacode.org/wiki/Category:M4 m4 United States # Hello World for the m4 macro processor Hello Hello dnl Took from https://en.wikipedia.org/wiki/M4_(computer_language) divert(-1) M4 has multiple output queues that can be manipulated with the `divert' macro. Valid queues range from 0 to 10, inclusive, with the default queue being 0. Calling the `divert' macro with an invalid queue causes text to be discarded until another call. Note that even while output is being discarded, quotes around `divert' and other macros are needed to prevent expansion. # Macros aren't expanded within comments, meaning that keywords such # as divert and other built-ins may be used without consequence. # HTML utility macro: define(`H2_COUNT', 0) # The H2_COUNT macro is redefined every time the H2 macro is used: define(`H2', `define(`H2_COUNT', incr(H2_COUNT))
H2_COUNT. $1
') divert(1)dnl dnl dnl The dnl macro causes m4 to discard the rest of the line, thus dnl preventing unwanted blank lines from appearing in the output. dnl H2(First Section) H2(Second Section) H2(Conclusion) dnl divert(0)dnl dnl undivert(1)dnl One of the queues is being pushed to output. https://riju.codes/m4 errprint(`Hello, world!')
1. First Section

2. Second Section

3. Conclusion
M4 # true true false https://en.wikipedia.org/wiki/M4_(computer_language) 2 0 https://hopl.info/showlanguage.prx?exp=766 M4 M4 https://github.com/Alhadis/language-etc 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 M4 pig Pig Latin 2008 30 queryLanguage https://pig.apache.org/ 3 207 4 24308 true 3 ace cloc pygments queryLanguage 535 606 1347 0 text source.pig_latin programming false p/Pig.pig 4 2014 2016 1 2 piglatin jvm.py 2008 linux java sql python javascript ruby groovy sawzall 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. 2010 211 13 102 29417433 Apache Software Foundation pig pig pig true 1326 0 34 pig text 7993 pig input_lines = LOAD '/tmp/word.txt' AS (line:chararray); words = FOREACH input_lines GENERATE FLATTEN(TOKENIZE(line)) AS word; filtered_words = FILTER words BY word MATCHES '\\w+'; word_groups = GROUP filtered_words BY word; word_count = FOREACH word_groups GENERATE COUNT(filtered_words) AS count, group AS word; ordered_word_count = ORDER word_count BY count DESC; STORE ordered_word_count INTO '/tmp/results.txt'; Hello WorldPIGHello World /** * sample.pig */ REGISTER $SOME_JAR; A = LOAD 'person' USING PigStorage() AS (name:chararray, age:int); -- Load person B = FOREACH A generate name; DUMP B; Pig input_lines = LOAD '/tmp/my-copy-of-all-pages-on-internet' AS (line:chararray); -- Extract words from each line and put them into a pig bag -- datatype, then flatten the bag to get one word on each row words = FOREACH input_lines GENERATE FLATTEN(TOKENIZE(line)) AS word; -- filter out any words that are just white spaces filtered_words = FILTER words BY word MATCHES '\\w+'; -- create a group for each word word_groups = GROUP filtered_words BY word; -- count the entries in each group word_count = FOREACH word_groups GENERATE COUNT(filtered_words) AS count, group AS word; -- order the records by count ordered_word_count = ORDER word_count BY count DESC; STORE ordered_word_count INTO '/tmp/number-of-words-on-internet'; Pig -- /* */ true true true true true true false https://en.wikipedia.org/wiki/Apache_Pig 0 0 pig.apache.org PigLatin https://github.com/goblindegook/sublime-text-pig-latin PigLatin logo Logo 1967 25 pl simulation 0 208 2 24304 291 true 1 3d-logo pl false l/Logo.lg 36 1967 starlogo netlogo smalltalk etoys scratch rebol lisp trs-80-color-computer objectlogo acornsoft-logo python jquery squeak "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." 2001 575 229 1360 18334 MIT lg 2895 0 27 https://el.media.mit.edu/logo-foundation/what_is_logo/logo_programming.html text 1154 https://github.com/antlr/grammars-v4/tree/master/logo/logo http://www.rosettacode.org/wiki/Category:Logo United States Logo ; Hello World in Logo DRUCKEZEILE [Hello World!] print [Hello World] Logo ; print true true true false https://en.wikipedia.org/wiki/Logo_(programming_language) 40 20 https://hopl.info/showlanguage.prx?exp=291 Logo 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 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 jinja Jinja 2006 Armin Ronacher 22 template http://jinja.pocoo.org/ 0 3.1.4 209 2 11 24303 true 0 https://github.com/pallets/jinja template 701 981 37267 0 django or html+django or html+jinja or htmldjango django django text/x-django text.html.django markup 2010 2024 2007 253 1595 10136 104 false 40 2005 2014 2 6 2007 2024 3097 347 118 8 29266 python django smarty unix isbn 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. 2006 106 34 63 4218966 https://github.com/pallets/jinja/issues/ jinja j2 jinja2 python restructuredtext yaml html markdown svg toml ini json make bourne-shell true 16020 0 36 1 false 3 true j2 jinja jinja2 https://jinja.palletsprojects.com/en/3.1.x/ text Various "
Workers
{% for server_info in server_infos %} {% if not server_info['failed'] %} {% for worker in server_info['workers'] %} {% endfor %} {% endif %} {% endfor %}

Job server IP File descriptor Client ID Functions
{{ server_info['hostport'][0] }}:{{ server_info['hostport'][1] }} {%- if server_info['failed'] -%} Not responding! {%- endif -%}
{{ worker['ip'] }} {{ worker['file_descriptor'] }} {{ worker['client_id'] }} {{ worker['tasks']|join(', ') }}
" Value with <unsafe> data 1, 2, 3, 4, 5, 6 https://github.com/pallets/jinja https://en.wikipedia.org/wiki/Jinja_(template_engine) 0 0 jinja.pocoo.org Jinja https://github.com/textmate/python-django.tmbundle HTML+Django enso Enso 2015 Wojciech Danilo 18 pl https://enso.org/ 0 2024.1.1-rc.1 210 0 23 24300 true 2 luna luna https://github.com/enso-org/enso pl 2016 2024 2019 89 320 7319 733 false luna 2019 2025 8401 67 8316 112 459863 2001 Enso is an award-winning interactive programming language with dual visual and textual representations. Enso is an award-winning interactive programming language with dual visual and textual representations. https://github.com/enso-org Enso is an award-winning interactive programming language with dual visual and textual representations. java scala typescript rust markdown yaml svg json csv toml javascript python xml bourne-shell css html haskell dockerfile cpp nix make powershell bash true 8348 0 42 luna 1 false 2024 false true Poland https://github.com/enso-org/enso 0 0 enso.org npm-pm npm 2010 Isaac Z. Schlueter 20 packageManager http://npmjs.org 0 v6.2.0-next.1 211 0 1 24297 false 0 https://github.com/npm/npm packageManager 2009 2024 2009 855 3022 17531 2165 false 991954002030 1029249 javascript nodejs typescript 2009 2020 9720 586 2 49 91 2010 2010 javascript php perl json 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. 2011 492 158 231 32102343 npm, Inc markdown true 29665 0 21 1 false 6 true text United States https://twitter.com/npmjs https://github.com/npm/npm https://en.wikipedia.org/wiki/Npm_(software) 0 0 npmjs.org jsonnet Jsonnet 2014 Dave Cunningham 24 dataNotation https://jsonnet.org/ 0 v0.20.0 212 1 19 24295 true 0 https://github.com/google/jsonnet dataNotation 104 190 1430 text source.jsonnet programming 2014 2024 2014 108 435 6861 237 false 2014 2025 1349 169 4062 54 501384 https://jsonnet.org/ 2015 Google jsonnet libsonnet javascript html cpp svg bourne-shell python markdown bazel yaml cmake json css java c bash starlark xml make dockerfile true 8337 0 47 json 1 false 0 true United States // A function that returns an object. local Person(name='Alice') = { name: name, welcome: 'Hello ' + name + '!', }; { person1: Person(), person2: Person('Bob'), } https://github.com/google/jsonnet // /* */ true true true false 0 0 jsonnet.org Jsonnet Jsonnet bicep Bicep 2020 Anthony Martin 27 jsonFormat 0 v0.27.1 213 1 12 24294 true 0 https://github.com/Azure/bicep jsonFormat 13 17 2562 text source.bicep programming 2020 2024 2020 115 731 3181 1239 false 2020 2025 10260 187 4452 175 1639892 Bicep is a Domain Specific Language (DSL) for deploying Azure resources declaratively. Bicep is a Domain Specific Language (DSL) for deploying Azure resources declaratively. Microsoft Bicep is a Domain Specific Language (DSL) for deploying Azure resources declaratively. bicep csharp json typescript svg xml html markdown yaml javascript powershell bourne-shell css arm-templates true 5562 0 53 1 false 0 true https://github.com/antlr/grammars-v4/tree/master/bicep bicep United States https://docs.microsoft.com/en-us/azure/azure-resource-manager/bicep/ @minLength(3) @maxLength(11) param storagePrefix string param storageSKU string = 'Standard_LRS' param location string = resourceGroup().location var uniqueStorageName = '${storagePrefix}${uniqueString(resourceGroup().id)}' resource stg 'Microsoft.Storage/storageAccounts@2019-04-01' = { name: uniqueStorageName location: location sku: { name: storageSKU } kind: 'StorageV2' properties: { supportsHttpsTrafficOnly: true } } module webModule './webApp.bicep' = { name: 'webDeploy' params: { skuName: 'S1' location: location } } output storageEndpoint object = stg.properties.primaryEndpoints targetScope resource module param var output for in if existing https://github.com/Azure/bicep // /* */ true true true true 0 0 Bicep Bicep frege Frege 2011 29 pl https://github.com/Frege/frege 0 3.23.288 214 2 11 24290 true 0 https://github.com/frege/frege pl 142 160 223 0 haskell source.haskell programming 2012 2024 2011 152 144 3628 46 false 463 2014 2018 4 13 2011 2025 3353 50 409 103 90690 2011 haskell jvm java java-bytecode linux unix eclipse-editor "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.)" 31 11 35111228 https://github.com/Frege fr fr forth java tex perl svg markdown make yacc bourne-shell html yaml true 4487 0 43 false 3 true http://www.frege-lang.org/doc/fregedoc.html text http://www.rosettacode.org/wiki/Category:Frege Switzerland and Germany and United States Frege "{-- This program displays the current time on stdandard output every other second. -} module examples.CommandLineClock where data Date = native java.util.Date where native new :: () -> IO (MutableIO Date) -- new Date() native toString :: Mutable s Date -> ST s String -- d.toString() --- 'IO' action to give us the current time as 'String' current :: IO String current = do d <- Date.new () d.toString {- ""java.lang.Thread.sleep"" takes a ""long"" and returns nothing, but may throw an InterruptedException. This is without doubt an IO action. public static void sleep(long millis) throws InterruptedException Encoded in Frege: - argument type long Long - result void () - does IO IO () - throws ... throws .... -} -- .... defined in frege.java.Lang -- native sleep java.lang.Thread.sleep :: Long -> IO () throws InterruptedException main args = forever do current >>= print print ""\r"" stdout.flush Thread.sleep 999 " https://twitter.com/fregelang "{-- This program displays the current time on standard output every other second. -} module examples.CommandLineClock where data Date = native java.util.Date where native new :: () -> IO (MutableIO Date) -- new Date() native toString :: Mutable s Date -> ST s String -- d.toString() --- 'IO' action to give us the current time as 'String' current :: IO String current = do d <- Date.new () -- reads system timer, hence IO d.toString main args = forever do current >>= print -- print formatted date print ""\r"" -- followed by carriage return stdout.flush -- make sure it's shown Thread.sleep 999L -- wait 0.999 seconds" https://github.com/frege/frege -- {- -} true true true false true https://en.wikipedia.org/wiki/Frege_(programming_language) 0 0 Frege https://github.com/atom-haskell/language-haskell Frege blender-app Blender 1998 Ton Roosendaal 18 application 3d https://www.blender.org 0 215 1 21 24289 false 0 https://projects.blender.org/blender/blender.git application false b/Blender.py 2002 2025 157636 1370 13549 845 5738218 1998 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. 1068 993 81926 Blender Foundation blend py cpp python svg glsl cmake diff c objective-cpp restructuredtext markdown xml bourne-shell yaml html cuda json css toml make metal javascript true 1306731 0 40 1 false Netherlands https://www.tiktok.com/@blender_org https://instagram.com/blender.official/ https://www.facebook.com/YourOwn3DSoftware/ "import Blender from Blender import Scene, Text3d text = Text3d.New(""Text"") text.setText(""Hello World"") Scene.GetCurrent().objects.new(text) Blender.Redraw()" https://www.reddit.com/r/blender/ Blender https://projects.blender.org/blender/blender.git https://en.wikipedia.org/wiki/Blender_(software) 0 0 vbscript VBScript 1996 31 pl https://msdn.microsoft.com/en-us/library/t0aew7h6.aspx 0 216 2 24288 5226 true 0 pl 327 339 6076 text vbscript text/vbscript source.vbnet programming false basic.py 34 1996 asp visual-basic powershell jscript batch regex javascript mumps applescript fasttrack-scripting-host "VBScript (""Microsoft Visual Basic Scripting Edition"") is an Active Scripting language developed by Microsoft that is modeled on Visual Basic. It allows Microsoft Windows system administrators to generate powerful tools for managing computers with error handling, subroutines, and other advanced programming constructs. It can give the user complete control over many aspects of their computing environment. VBScript uses the Component Object Model to access elements of the environment within which it is running; for example, the FileSystemObject (FSO) is used to create, read, update and delete files. VBScript has been installed by default in every desktop release of Microsoft Windows since Windows 98; in Windows Server since Windows NT 4.0 Option Pack; and optionally with Windows CE (depending on the device it is installed on). A VBScript script must be executed within a host environment, of which there are several provided with Microsoft Windows, including: Windows Script Host (WSH), Internet Explorer (IE), and Internet Information Services (IIS). Additionally, the VBScript hosting environment is embeddable in other programs, through technologies such as the Microsoft Script Control (msscript.ocx)." 2001 472 1090 821 32716 Microsoft vbs vbe wsf wsc vbs vbs VBS vbs vbe wsf wsc 3347 142 36 http://www.csidata.com/custserv/onlinehelp/VBSdocs/VBSTOC.htm https://learn.microsoft.com/en-us/windows/win32/lwef/using-vbscript text vbscript http://www.rosettacode.org/wiki/Category:VBScript United States "' Hello World in VBScript (Windows Scripting Host) msgbox ""Hello, World!"" " VBScript https://reddit.com/r/vbscript "<% Option Explicit %> VBScript Example
<% ' Grab current time from Now() function. ' An '=' sign occurring after a context switch (<%) is shorthand ' for a call to the Write() method of the Response object. Dim timeValue = Now %> The time, in 24-hour format, is <%=Hour(timeValue)%>:<%=Minute(timeValue)%>:<%=Second(timeValue)%>.
" ' true true true true true false https://en.wikipedia.org/wiki/VBScript 40 0 https://hopl.info/showlanguage.prx?exp=5226 VBScript VBScript year|publisher|title|authors|isbn13\n1999|Wrox Press|VBScript Programmers Reference|Adrian Kingsley-Hughes and Kathie Kingsley-Hughes and Paul Wilton and Brian Francis and Brian Matsik and Erick Nelson and Piotr Prussak and Dan Read and Carsten Thomsen and Stuart Updegrave and Antonio De Donatis and Susanne Clark|9781861002716\n1997|Wiley|VBScript Sourcebook (Sourcebooks)|Mara, Mary Jane|9780471191063\n2003|O'Reilly Media|VBScript in a Nutshell, 2nd Edition|Paul Lomax and Matt Childs and Ron Petrusha|9780596004880\n2001|O'Reilly Media|VBScript Pocket Reference|Lomax, Paul and Childs, Matt and Petrusha, Ron|9780596001261\n2005|Cengage Learning PTR|Microsoft WSH and VBScript Programming for the Absolute Beginner|Ford, Jr. Jerry Lee|9781592007318\n1997|Waite Group Pr|Vbscript Interactive Course|Jerke, Noel and Hatmaker, Michael and Anderson, Jonny|9781571690463\n1996|Que Pub|Vbscript by Example|Honeycutt, Jerry|9780789708151\n2015|Lulu.com|VBScript Programming Success In A Day|Key, Sam|9781329503144\n2008|Cengage Learning PTR|Microsoft WSH and VBScript Programming for the Absolute Beginner|Ford Jr., Jerry|9781598638035\n2014-04-15T00:00:01Z|Cengage Learning PTR|Microsoft WSH and VBScript Programming for the Absolute Beginner, 4th|Ford, Jr. Jerry Lee|9781305260320\n1997|O'Reilly Media|Learning VBScript (Nutshell Handbooks)|Lomax, Paul|9781565922471\n2015|CreateSpace Independent Publishing Platform|VBScript Programming Success in a Day: Beginner?s Guide to Fast, Easy and Efficient Learning of VBScript Programming|Key, Sam|9781515202639\n2000|Cengage Learning|Internet Programming with VBScript and JavaScript (Web Warrior Series)|Kalata, Kate|9780619015237\n2003|Course Technology PTR|Microsoft VBScript Professional Projects|Ford, Jr., Jerry Lee|9781592000562\n1996|Sams|Vbscript Unleashed|Schongar, Bill and Lagasse, Paul and Eddy, Craig and Brophy, Keith and Graupman, Owen and Johnson, Brian and Koets, Timothy and Petroutsos, Evangelos|9781575211244\n2002|Muska & Lipman/Premier-Trade|Learn Microsoft VBScript In a Weekend|Ford Jr., Jerry Lee|9781931841702\n1995|O'Reilly Media|VBScript in a Nutshell: A Desktop Quick Reference (In a Nutshell (O'Reilly))|Childs, Matt and Lomax, Paul and Petrusha, Ron|9781565927209\n1996|Sams|Laura Lemay's Web Workshop Activex and Vbscript|Rogers Cadenhead and Paul Lomax|9781575212074\n2003|Cengage Learning PTR|Microsoft WSH and VBScript Programming for the Absolute Beginner|Ford, Jr. Jerry Lee|9781592000722\n1996|Premier Pr|Vbscript Master's Handbook|Goddard, Christopher J. and White, Mark|9780761507697\n2009|Nelson Education|Microsoft Wsh And Vbscript Programming For The Absolute Beginner|Jerry Lee Ford|9781598639681\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\n2015||(part 2) You Must Learn Vbscript For Qtp/uft (fc)|Rex Allen Jones Ii|9781522798712\n20010201|O'Reilly Media, Inc.|VBScript Pocket Reference|Paul Lomax; Matt Childs; Ron Petrusha|9781449356804\n|John Wiley & Sons Inc (Computers)|Vbscript for Dummies|Walkenbach, John|9780764502590\n20010201|O'Reilly Media, Inc.|VBScript Pocket Reference|Paul Lomax; Matt Childs; Ron Petrusha|9780596529116\n20030320|O'Reilly Media, Inc.|VBScript in a Nutshell|Paul Lomax; Matt Childs; Ron Petrusha|9780596552336\n20030320|O'Reilly Media, Inc.|VBScript in a Nutshell|Paul Lomax; Matt Childs; Ron Petrusha|9780596517151\n1997|Idg Books Worldwide|Creating Cool Vbscript Web Pages|Hatfield, Bill.|9780764530319\n1996|Macmillan Computer Pub|Using Vbscript (special Edition Using)|Ron Schwarz and Ibrahim Malluf and William Beem and Yusuf Malluf and Michael Marchuk and Tom Tessier|9780789708090\n2009|Wiley & Sons, Incorporated, John|Microsoft Powershell, Vbscript And Jscript Bible|William R. Stanek and Jeffrey Rosen and James O'Neill|9780470478905\n2020|Emereo|VBScript A Complete Guide - 2021 Edition|Gerardus Blokdyk|9781867485605\n20140228|Emereo|VBScript 102 Success Secrets - 102 Most Asked Questions On VBScript - What You Need To Know|Cynthia Baird|9781488537301\n20140415|Cengage Limited|Microsoft WSH and VBScript Programming for the Absolute Beginner, 4th|Jerry Lee Ford, Jr.|9781337413480\n2014|Cengage Learning|Microsoft Wsh And Vbscript Programming For The Absolute Beginner, 4th Ed.|Jerry Lee Ford Jr.|9781305260337\n1996|Waite Group Pr|Vbscript Superbible: The Complete Reference To Programming In Microsoft Visual Basic Scripting Edition|Jinjer L. Simon|9781571690814\n1997|Coriolis Group, Llc, The|Vbscript 2 And Activex Programming : Master The Art Of Creating Interactive Web Pages|Scott Palmer|9781576101612 VBScript vbscript developer title|year|author|goodreadsId|rating|ratings|reviews\nVbscript Programmer's Reference|2004|Adrian W. Kingsley-Hughes|1634718|3.62|37|2\nMicrosoft Wsh and VBScript Programming for the Absolute Beginner|2003|Jerry Lee Ford Jr.|6400783|3.22|32|3\nVBScript for Dummies|1996|John Walkenbach|2376231|0.0|0|0 janet Janet 2018 Calvin Rose 30 pl https://janet-lang.org 0 v1.34.0 217 1 8 24286 true 0 https://github.com/janet-lang/janet pl 88 janet scheme scheme text/x-scheme source.janet programming 2017 2024 65 220 3396 43 false 2017 2025 4645 125 199 16 56599 https://janet-lang.org/ 2018 https://github.com/janet-lang janet c yaml bourne-shell markdown make meson svg assembly-language true 4183 0 39 1 false 1 true janet https://janet-lang.org/docs/index.html https://janet.guide/all/ Czech Republic and New Zealand and United States "import joy) (defn home [request] (joy/render :text ""You found joy!"")) (def routes [[:get ""/"" home]]) (def app (joy/handler routes)) (joy/server app 8000)" https://www.reddit.com/r/janetlang/ https://github.com/janet-lang/janet true true true true true true true true false true 0 0 janet-lang.org 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 Janet mlir MLIR 2019 Chris Lattner 25 ir https://mlir.llvm.org/ 0 218 2 1 24280 true 1 mojo https://github.com/tensorflow/mlir ir 27 30 84 text source.mlir programming 2019 2024 2019 168 257 1728 57 false Multi-Level Intermediate Representation 2019 2021 3349 91 1 20 36 The MLIR project is a novel approach to building reusable and extensible compiler infrastructure. MLIR aims to address software fragmentation, improve compilation for heterogeneous hardware, significantly reduce the cost of building domain specific compilers, and aid in connecting existing compilers together. The MLIR project is a novel approach to building reusable and extensible compiler infrastructure. MLIR aims to address software fragmentation, improve compilation for heterogeneous hardware, significantly reduce the cost of building domain specific compilers, and aid in connecting existing compilers together. https://ieeexplore.ieee.org/document/9370308 Google The MLIR project is a novel approach to building reusable and extensible compiler infrastructure. MLIR aims to address software fragmentation, improve compilation for heterogeneous hardware, significantly reduce the cost of building domain specific compilers, and aid in connecting existing compilers together. mlir markdown true 2592 0 30 llvmir swift-il xla 1 false Various https://blog.tensorflow.org/2019/04/mlir-new-intermediate-representation.html // Syntactically similar to LLVM: func @testFunction(%arg0: i32) { %x = call @thingToCall(%arg0) : (i32) -> i32 br ^bb1 ^bb1: %y = addi %x, %x : i32 return %y : i32 } "// Example code of an affine reduction. // MLIR example code may not always work out of the box because the textual MLIR format is not stable. // The example tries to be compatible with the latest MLIR version, which may not work on previous versions. func @affine_parallel_with_reductions_i64(%arg0: memref<3x3xi64>, %arg1: memref<3x3xi64>) -> (i64, i64) { %0:2 = affine.parallel (%kx, %ky) = (0, 0) to (2, 2) reduce (""addi"", ""muli"") -> (i64, i64) { %1 = affine.load %arg0[%kx, %ky] : memref<3x3xi64> %2 = affine.load %arg1[%kx, %ky] : memref<3x3xi64> %3 = arith.muli %1, %2 : i64 %4 = arith.addi %1, %2 : i64 affine.yield %3, %4 : i64, i64 } return %0#0, %0#1 : i64, i64 } " MLIR https://github.com/tensorflow/mlir // true true false 0 0 mlir.llvm.org MLIR MLIR qt Qt 1995 16 framework https://www.qt.io/ 16 219 0 1 24271 false 16 boomerang-decompiler cmake eco-editor emscripten flow9 flua ktexteditor-editor kumir leo-editor monkeyx openscad paraview pep8 tao3d textadept-editor vlc framework false 50 2006 2014 7 2013 1990 android ios linux sql xml json visual-studio-editor qml javascript sibelius-software qmake solaris opengl qtscript xpath xquery unix emacs-editor "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." 2001 790 734 2376 25204 Qt Group plc cpp 4171 0 18 false ui text 9774 Finland https://twitter.com/qtproject https://en.wikipedia.org/wiki/Qt_(software) 5 0 qt.io https://github.com/textmate/cpp-qt.tmbundle 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 dafny Dafny 2009 K. Rustan M. Leino 30 pl https://www.microsoft.com/en-us/research/project/dafny-a-language-and-program-verifier-for-functional-correctness/ 0 220 3 21 24269 true 0 https://github.com/Microsoft/dafny pl 1 1 157 dafny text text.dfy.dafny programming 2016 2024 2009 80 257 2853 1184 false 2009 2025 9096 154 6062 247 566367 2009 csharp spec-sharp spark idris agda 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. 2018 1 4 2 56073623 Microsoft dfy csharp markdown java yaml f-sharp toml python go xml html make bash javascript tex bourne-shell gradle css json rust diff svg true 3805 0 54 1 false dfy https://tio.run/#dafny text Dafny http://www.rosettacode.org/wiki/Category:Dafny dafny "// Hello world in Dafny method Main() { print ""Hello, World!\n""; }" https://riju.codes/dafny "method Main() { print ""Hello, world!\n""; } " datatype List = Nil | Link(data:int,next:List) function sum(l:List): int { match l case Nil => 0 case Link(d,n) => d + sum(n) } predicate isNatList(l:List) { match l case Nil => true case Link(d,n) => d >= 0 && isNatList(n) } ghost method NatSumLemma(l:List, n:int) requires isNatList(l) && n == sum(l) ensures n >= 0 { match l case Nil => // Discharged Automatically case Link(data,next) => { // Apply Inductive Hypothesis NatSumLemma(next,sum(next)); // Check what known by Dafny assert data >= 0; } } https://github.com/Microsoft/dafny // print true true true false https://en.wikipedia.org/wiki/Dafny_(programming_language) 1 11 Dafny year|publisher|title|authors|isbn13\n2022|Apress|Introducing Software Verification with Dafny Language: Proving Program Correctness|Sitnikovski, Boro|9781484279786 Dafny 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 batch Batchfile 1985 29 pl https://docs.microsoft.com/en-us/windows-server/administration/windows-commands/windows-commands 0 221 3 24265 true 0 pl 76182 97775 72380 8 "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成为真正的“网游加速器”" bat or batch or dosbatch or winbatch batchfile source.batchfile programming false b/Batch.bat 55 2014 2018 3 cmd shell.py 1985 jcl linux notepad-editor unicode kixtart vbscript jscript powershell unix perl python ruby php "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." 2004 757 845 1307 15264030 Microsoft bat cmd bat bat cmd bat 4005 0 https://exercism.org/tracks/batch 31 text 7410 bat United States Batch @echo off echo Hello World Batchfile https://riju.codes/cmd "echo ""Hello, world!"" " "C:\>set /p =""Message 1""data.txt C:\>set /p =""Message 2"">data.txt C:\>set /p =""Message 3"">data.txt C:\>type data.txt Message 1Message 2Message 3" Batch REM echo true true true true true true https://en.wikipedia.org/wiki/Batch_file 0 0 Batchfile https://github.com/mmims/language-batchfile Batchfile carp carp 2016 Erik Svedäng 25 pl lisp 0 v0.5.5 222 1 11 24264 true 0 https://github.com/carp-lang/carp pl 2016 2024 2016 110 173 5489 144 false 2016 2024 5022 77 411 13 49638 https://github.com/carp-lang haskell markdown bourne-shell yaml css python nix powershell svg c lisp true 6086 0 39 1 false 0 true text Various ";; Hello world in Carp (println ""hello world"")" https://github.com/carp-lang/carp ; println """" true false true true false true true 0 2 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 thrift Thrift 2007 21 idl http://thrift.apache.org/ 8 223 3 24259 true 9 apache-hbase arrow-format avro cloc codeql hhvm impala m3db pygments idl 2983 3526 447 0 text source.thrift programming false 30 2008 2014 1 3 dsls.py 2017 actionscript c csharp erlang go haskell java objective-c ocaml perl php python ruby smalltalk json soap xml asn-1 protobuf "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." 2007 281 381 188 10438451 Apache Software Foundation thrift thrift true 1626 0 22 thrift text https://github.com/antlr/grammars-v4/tree/master/thrift enum PhoneType { HOME, WORK, MOBILE, OTHER } struct Phone { 1: i32 id, 2: string number, 3: PhoneType type } service PhoneSvc { Phone findById(1: i32 id), list findAll() } struct PullRequest { 1: string title } Thrift enum PhoneType { HOME, WORK, MOBILE, OTHER } struct Phone { 1: i32 id, 2: string number, 3: PhoneType type } service PhoneSvc { Phone findById(1: i32 id), list findAll() } true true true https://en.wikipedia.org/wiki/Apache_Thrift 0 0 thrift.apache.org Thrift https://github.com/textmate/thrift.tmbundle Thrift react-native React Native 2015 Jordan Walke and Christopher Chedeau 18 framework http://www.reactnative.com/ 0 1000.0.0 224 1 21 24258 false 0 https://github.com/facebook/react-native framework 2015 2024 2015 3603 24124 117381 916 false r/React Native.js 2015 2025 43710 4064 6563 928 939868 2015 Facebook javascript java kotlin cpp objective-cpp svg xml markdown objective-c typescript ruby cmake json yaml bourne-shell gradle assembly-language html toml jsx swift true 193839 0 40 2 false 1000 false text United States "import React from ""react""; import { Text, View } from ""react-native""; export default function HelloWorld() { return ( Hello World ); } " React Native https://github.com/facebook/react-native https://en.wikipedia.org/wiki/React_Native 1 0 reactnative.com title|year|author|goodreadsId|rating|ratings|reviews\nProgramming React Native||Dotan Nahum|51202148|4.67|3|1 qml QML 2009 26 pl http://qt-project.org/doc/qt-5/qmlapplications.html 7 225 3 24257 true 7 ace kumir leo-editor opa pygments score vlc pl 4140 5249 14755 2 "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...""" text source.qml programming false 9 2013 2014 1 1 Qt Modeling Language webmisc.py 2009 json javascript ring "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." 2010 182 114 213 28116392 Qt Group plc qml qbs qml qbs 1131 0 31 qbs qml https://doc.qt.io/qt-6/qtqml-documents-topic.html text Finland Item { Rectangle { id: myRect width: 120 height: 100 } Rectangle { width: myRect.width height: 200 } } "/**************************************************************************** ** ** Copyright (C) 2015 The Qt Company Ltd. ** Contact: http://www.qt.io/licensing ** ** This file is part of the Qt Build Suite. ** ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and The Qt Company. For licensing terms and ** conditions see http://www.qt.io/terms-conditions. For further information ** use the contact form at http://www.qt.io/contact-us. ** ** GNU Lesser General Public License Usage ** Alternatively, this file may be used under the terms of the GNU Lesser ** General Public License version 2.1 or version 3 as published by the Free ** Software Foundation and appearing in the file LICENSE.LGPLv21 and ** LICENSE.LGPLv3 included in the packaging of this file. Please review the ** following information to ensure the GNU Lesser General Public License ** requirements will be met: https://www.gnu.org/licenses/lgpl.html and ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, The Qt Company gives you certain additional ** rights. These rights are described in The Qt Company LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ****************************************************************************/ import qbs 1.0 import qbs.FileInfo import qbs.ModUtils Module { property string buildVariant: ""debug"" property bool enableDebugCode: buildVariant == ""debug"" property bool debugInformation: (buildVariant == ""debug"") property string optimization: (buildVariant == ""debug"" ? ""none"" : ""fast"") readonly property stringList hostOS: undefined // set internally property string hostOSVersion: { if (hostOS && hostOS.contains(""osx"")) { return getNativeSetting(""/System/Library/CoreServices/ServerVersion.plist"", ""ProductVersion"") || getNativeSetting(""/System/Library/CoreServices/SystemVersion.plist"", ""ProductVersion""); } else if (hostOS && hostOS.contains(""windows"")) { var version = getNativeSetting(""HKEY_LOCAL_MACHINE\\Software\\Microsoft\\Windows NT\\CurrentVersion"", ""CurrentVersion""); return version + ""."" + hostOSBuildVersion; } } property string hostOSBuildVersion: { if (hostOS.contains(""osx"")) { return getNativeSetting(""/System/Library/CoreServices/ServerVersion.plist"", ""ProductBuildVersion"") || getNativeSetting(""/System/Library/CoreServices/SystemVersion.plist"", ""ProductBuildVersion""); } else if (hostOS.contains(""windows"")) { return getNativeSetting(""HKEY_LOCAL_MACHINE\\Software\\Microsoft\\Windows NT\\CurrentVersion"", ""CurrentBuildNumber""); } } readonly property var hostOSVersionParts: hostOSVersion ? hostOSVersion.split('.').map(function(item) { return parseInt(item, 10); }) : [] readonly property int hostOSVersionMajor: hostOSVersionParts[0] || 0 readonly property int hostOSVersionMinor: hostOSVersionParts[1] || 0 readonly property int hostOSVersionPatch: hostOSVersionParts[2] || 0 property stringList targetOS: hostOS property string pathListSeparator: hostOS.contains(""windows"") ? "";"" : "":"" property string pathSeparator: hostOS.contains(""windows"") ? ""\\"" : ""/"" property string profile property stringList toolchain property string architecture property bool install: false property string installSourceBase readonly property string installRoot: undefined property string installDir property string installPrefix: """" property path sysroot PropertyOptions { name: ""buildVariant"" allowedValues: ['debug', 'release'] description: ""name of the build variant"" } PropertyOptions { name: ""optimization"" allowedValues: ['none', 'fast', 'small'] description: ""optimization level"" } validate: { var validator = new ModUtils.PropertyValidator(""qbs""); validator.setRequiredProperty(""architecture"", architecture, ""you might want to re-run 'qbs-setup-toolchains'""); validator.setRequiredProperty(""hostOS"", hostOS); validator.setRequiredProperty(""targetOS"", targetOS); if (hostOS && (hostOS.contains(""windows"") || hostOS.contains(""osx""))) { validator.setRequiredProperty(""hostOSVersion"", hostOSVersion, ""could not detect host operating system version; "" + ""verify that system files and registry keys have not "" + ""been modified.""); if (hostOSVersion) validator.addVersionValidator(""hostOSVersion"", hostOSVersion, 2, 4); validator.setRequiredProperty(""hostOSBuildVersion"", hostOSBuildVersion, ""could not detect host operating system build version; "" + ""verify that system files or registry have not been "" + ""tampered with.""); } validator.addCustomValidator(""architecture"", architecture, function (value) { return architecture === canonicalArchitecture(architecture); }, ""'"" + architecture + ""' is invalid. You must use the canonical name '"" + canonicalArchitecture(architecture) + ""'""); validator.validate(); } // private properties property var commonRunEnvironment: { var env = {}; if (targetOS.contains(""windows"")) { env[""PATH""] = [ FileInfo.joinPaths(installRoot, installPrefix) ]; } else if (hostOS.contains(""darwin"") && targetOS.contains(""darwin"")) { env[""DYLD_FRAMEWORK_PATH""] = [ FileInfo.joinPaths(installRoot, installPrefix, ""Library"", ""Frameworks""), FileInfo.joinPaths(installRoot, installPrefix, ""lib""), FileInfo.joinPaths(installRoot, installPrefix) ].join(pathListSeparator); env[""DYLD_LIBRARY_PATH""] = [ FileInfo.joinPaths(installRoot, installPrefix, ""lib""), FileInfo.joinPaths(installRoot, installPrefix, ""Library"", ""Frameworks""), FileInfo.joinPaths(installRoot, installPrefix) ].join(pathListSeparator); if (targetOS.contains(""ios-simulator"") && sysroot) { env[""DYLD_ROOT_PATH""] = [sysroot]; } } else if (hostOS.contains(""unix"") && targetOS.contains(""unix"")) { env[""LD_LIBRARY_PATH""] = [ FileInfo.joinPaths(installRoot, installPrefix, ""lib"") ]; } return env; } // internal properties readonly property string version: [versionMajor, versionMinor, versionPatch].join(""."") readonly property int versionMajor: undefined // set internally readonly property int versionMinor: undefined // set internally readonly property int versionPatch: undefined // set internally } " QML "MouseArea { onPressed: console.log(""mouse button pressed"") }" // /* */ true true true true true true false https://en.wikipedia.org/wiki/QML 0 0 QML https://github.com/skozlovf/Sublime-QML QML d3 D3.js 2010 Mike Bostock 18 library https://d3js.org/ 0 7.9.0 226 1 9 24255 true 0 https://github.com/d3/d3 library 2010 2024 2010 3633 22875 108187 13 false 2010 2025 4841 153 175 59 26154 2011 2011 javascript svg css actionscript html json csv geojson jquery 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. 2012 275 92 351 36177168 https://github.com/d3 markdown javascript json typescript yaml csv bourne-shell css svg true 178362 0 28 observable-lang 1 false 7 true text United States https://twitter.com/d3js_org "// Data var countriesData = [ { name:""Ireland"", income:53000, life: 78, pop:6378, color: ""black""}, { name:""Norway"", income:73000, life: 87, pop:5084, color: ""blue"" }, { name:""Tanzania"", income:27000, life: 50, pop:3407, color: ""grey"" } ]; // Create SVG container var svg = d3.select(""#hook"").append(""svg"") .attr(""width"", 120) .attr(""height"", 120) .style(""background-color"", ""#D0D0D0""); // Create SVG elements from data svg.selectAll(""circle"") // create virtual circle template .data(countriesData) // bind data .enter() // for each row in data... .append(""circle"") // bind circle & data row such that... .attr(""id"", function(d) { return d.name }) // set the circle's id according to the country name .attr(""cx"", function(d) { return d.income / 1000 }) // set the circle's horizontal position according to income .attr(""cy"", function(d) { return d.life }) // set the circle's vertical position according to life expectancy .attr(""r"", function(d) { return d.pop / 1000 *2 }) // set the circle's radius according to country's population .attr(""fill"", function(d) { return d.color }); // set the circle's color according to country's color" https://github.com/d3/d3 https://en.wikipedia.org/wiki/D3.js 0 0 d3js.org pl-sql PL/SQL 1991 33 pl 0 227 4 24251 7323 true 0 pl 6008 6767 20365 0 sql sql text/x-plsql none programming false p/PL∕SQL.pls 8 78458 276 PLSQL 18 2005 sql transact-sql postgresql plpgsql sql-psm object-pascal free-pascal java sqlite sqlpl 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. 2001 427 432 1056 33862363 Oracle pls bdy ddl fnc pck pkb pks plb plsql prc spc sql tpb tps trg vw pls 2355 2972 https://exercism.org/tracks/pl 38 https://docs.oracle.com/database/121/LNPLS/toc.htm text https://github.com/antlr/grammars-v4/tree/master/sql/plsql United States -- Hello World in Oracle PL/SQL (sqlplus) set serveroutput on begin dbms_output.enable(10000); dbms_output.put_line('Hello World'); end; / BEGIN dbms_output.put_line('Hello World'); END; / create or replace procedure print_bool( p_bool in BOOLEAN, p_true_value in varchar2 default 'TRUE', p_false_value in varchar2 := 'FALSE' ) as begin dbms_output.put_line(case when p_bool then p_true_value else p_false_value end); end print_bool; / DECLARE CURSOR cursor_person IS SELECT person_code FROM people_table; BEGIN FOR RecordIndex IN cursor_person LOOP DBMS_OUTPUT.PUT_LINE(recordIndex.person_code); END LOOP; END; PL∕SQL https://www.meetup.com/topics/oracle -- dbms_output.put_line ' TRUE FALSE true true true true false true https://en.wikipedia.org/wiki/PL/SQL 5 0 https://hopl.info/showlanguage.prx?exp=7323 PL/SQL PLSQL https://github.com/textmate/sql.tmbundle PLSQL pl/sql developer 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 eve Eve 2016 Chris Granger and Rob Attorri and Jamie Brandon and Josh Cole and Corey Montella 23 pl http://witheve.com/ 0 0.3.0-preview5 228 1 8 24250 true 0 https://github.com/witheve/Eve pl 2013 2024 2016 195 256 7153 71 false 2016 2018 3250 45 71 10 25246 http://play.witheve.com/#/examples/quickstart.eve 2014 https://github.com/witheve typescript css javascript markdown json html yaml dockerfile true 7968 0 36 5 false 0 true text 5008 United States // People older than 30 [#person age > 30] // The same as above [#person age] age > 30 // Also the same as above people = [#person] https://twitter.com/with_eve https://github.com/witheve/Eve // true true false 0 0 witheve.com yara YARA 2008 Victor M. Alvarez 21 pl http://virustotal.github.io/yara/ 0 v4.5.1 229 2 18 24248 true 0 https://github.com/VirusTotal/yara pl 43 46 812 0 text source.yara programming 2012 2024 2008 320 1420 7981 183 false 21 2014 2018 3 4 Yet Another Recursive Acronym 2008 2025 3401 247 385 24 138601 perl regex elf YARA is the name of a tool primarily used in malware research and detection. It provides a rule-based approach to create descriptions of malware families based on textual or binary patterns. A description is essentially a Yara rule name, where these rules consist of sets of strings and a boolean expression. The language used has traits of Perl compatible regular expressions. 2010 106 5 27 26289898 YARA is a tool aimed at (but not limited to) helping malware researchers to identify and classify malware samples. With YARA you can create descriptions of malware families (or whatever you want to describe) based on textual or binary patterns. Each description, a.k.a rule, consists of a set of strings and a boolean expression which determine its logic. YARA is a tool aimed at (but not limited to) helping malware researchers to identify and classify malware samples. With YARA you can create descriptions of malware families (or whatever you want to describe) based on textual or binary patterns. Each description, a.k.a rule, consists of a set of strings and a boolean expression which determine its logic. YARA is a tool aimed at (but not limited to) helping malware researchers to identify and classify malware samples. With YARA you can create descriptions of malware families (or whatever you want to describe) based on textual or binary patterns. Each description, a.k.a rule, consists of a set of strings and a boolean expression which determine its logic. yar yara c restructuredtext xml cpp starlark yaml markdown bourne-shell yacc lex bazel protobuf m4 make javascript svg html python true 13240 0 39 1 false 4 true text https://github.com/antlr/grammars-v4/tree/master/yara "rule silent_banker : banker { meta: description = ""This is just an example"" threat_level = 3 in_the_wild = true strings: $a = {6A 40 68 00 30 00 00 6A 14 8D 91} $b = {8D 4D B0 2B C1 83 C0 27 99 6A 4E 59 F7 F9} $c = ""UVODFRYSIHLNWPEJXQZAKCBGMT"" condition: $a or $b or $c }" rule test { condition: true } https://github.com/VirusTotal/yara https://en.wikipedia.org/wiki/YARA 0 0 YARA https://github.com/blacktop/language-yara YARA ninja Ninja 2012 Evan Martin 20 template https://ninja-build.org/ 0 v1.12.1 230 0 13 24245 true 0 https://github.com/ninja-build/ninja template 0 0 text source.ninja data 2011 2024 2010 266 1573 10866 360 false 20 2015 2016 3 2010 2025 3276 343 176 6 36379 2014 2012 python cmake meson "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." 2017 71 18 27 54312048 Google ninja cpp python yaml markdown bourne-shell xslt asciidoc c cmake lisp css vim-script xml true 16505 0 33 1 false 1 true text United States https://github.com/ninja-build/ninja https://en.wikipedia.org/wiki/Ninja_(build_system) 2 4 ninja-build.org https://github.com/khyo/language-ninja 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 Ninja 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 imba Imba 2014 17 pl https://imba.io/ 2 v2.0.0-y.0 231 1 11 24243 true 2 cloc imba https://github.com/imba/imba pl 2014 2024 2015 108 173 6276 158 false 2015 2025 4031 47 1115 28 237048 2013 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. 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. https://github.com/imba/ 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. imba javascript json typescript markdown html css yaml svg xml bourne-shell javascript true 6844 0 30 true 2 true imba Norway and United States tag app-canvas prop dpr = window.devicePixelRatio prop state = {} def draw e let path = e.#path ||= new Path2D let ctx = $canvas.getContext('2d') path.lineTo(e.x * dpr,e.y * dpr) ctx.lineWidth = state.stroke * dpr ctx.strokeStyle = state.color ctx.stroke(path) def resized e $canvas.width = offsetWidth * dpr $canvas.height = offsetHeight * dpr https://github.com/imba/imba true 0 0 imba.io couchdb CouchDB 2005 21 application https://couchdb.apache.org/ 0 3.3.3 232 0 24 24243 false 0 https://github.com/apache/couchdb application 2009 2024 237 1020 6124 316 false 2008 2025 17933 311 1488 47 406328 2005 c javascript linux solaris freebsd json nginx-config sql mongodb postgresql 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. 70 13427539 https://github.com/apache/couchdb erlang restructuredtext elixir java markdown python bourne-shell c javascript ini make cpp html yaml json svg groovy gradle diff css bash ruby powershell dockerfile true 10867 13 45 false 3 true https://docs.couchdb.org/en/3.2.2-docs/ text https://www.reddit.com/r/CouchDB https://twitter.com/couchdb https://github.com/apache/couchdb true true https://en.wikipedia.org/wiki/Apache_CouchDB 3 0 couchdb.apache.org couchdb developer 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 nginx-config Nginx 2004 24 configFormat 0 233 2 24237 true 0 configFormat 7652 8529 nginx.conf 5905 0 nginx configuration file text nginx text/x-nginx-conf source.nginx data false 41 2014 2018 1 6 configs.py 2004 c linux solaris tls wordpress 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. 2007 795 298 1044 10494974 F5, Inc nginx nginxconf vhost nginx.conf true 4245 2884 25 https://nginx.org/en/docs/ https://devdocs.io/nginx/ text nginx Russia #user nobody; worker_processes 1; #error_log logs/error.log; #pid /run/nginx.pid; events { worker_connections 1024; } http { include /etc/nginx/mime.types; gzip on; gzip_http_version 1.1; gzip_comp_level 2; gzip_types text/plain text/html text/css application/x-javascript text/xml application/xml application/xml+rss text/javascript; server { listen 80; server_name localhost; access_log logs/localhost.access.log main; location / { root html; index index.html index.htm; } include /etc/nginx/sites-enabled/*; } } "# Move the www people to no-www server { listen 80; server_name www.example.com; return 301 $scheme://example.com$request_uri; } server { listen 80; listen 443 ssl; server_name example.com; # Certs sent to the client in SERVER HELLO are concatenated in ssl_certificate ssl_certificate /srv/www/example.com/ssl/example.com.crt; ssl_certificate_key /srv/www/example.com/ssl/example.com.key; # Allow multiple connections to use the same key data ssl_session_timeout 5m; ssl_session_cache shared:SSL:50m; # Diffie-Hellman parameter for DHE ciphersuites, recommended 2048 bits ssl_dhparam /etc/ssl/certs/dhparam.pem; # Intermediate configuration. tweak to your needs ssl_protocols TLSv1 TLSv1.1 TLSv1.2; include snippets/ssl_ciphers_intermediate.conf; ssl_prefer_server_ciphers on; # HSTS (ngx_http_headers_module is required) (15768000 seconds = 6 months) #add_header Strict-Transport-Security max-age=15768000; # OCSP Stapling - fetch OCSP records from URL in ssl_certificate and cache them ssl_stapling on; ssl_stapling_verify on; # Verify chain of trust of OCSP response using Root CA and Intermediate certs ssl_trusted_certificate /srv/www/example.com/ssl/unified-ssl.crt; resolver 8.8.8.8 8.8.4.4; resolver_timeout 10s; root /srv/www/example.com/htdocs; index index.php index.html index.htm; charset UTF-8; autoindex off; # Deny access based on HTTP method (set in HTTP level) if ($bad_method = 1) { return 444; } # Show ""Not Found"" 404 errors in place of ""Forbidden"" 403 errors, because # forbidden errors allow attackers potential insight into your server's # layout and contents error_page 403 = 404; # It's always good to set logs, note however you cannot turn off the error log # setting error_log off; will simply create a file called 'off'. access_log /var/log/nginx/example.com.access.log; error_log /var/log/nginx/example.com.error.log; # Add trailing slash to */wp-admin requests. rewrite /wp-admin$ $scheme://$host$uri/ permanent; location / { # This try_files directive is used to enable pretty, SEO-friendly URLs # and permalinks for Wordpress. Leave it *off* to start with, and then # turn it on once you've gotten Wordpress configured! try_files $uri $uri/ /index.php?$args; } # Option to create password protected directory # http://www.howtoforge.com/basic-http-authentication-with-nginx # location /admin { # auth_basic ""Administrator Login""; # auth_basic_user_file /var/www/domain.com/admin/.htpasswd; # } # Do not log access to these to keep the logs cleaner location = /favicon.ico { log_not_found off; access_log off; } location = /apple-touch-icon.png { log_not_found off; access_log off; } location = /apple-touch-icon-precomposed.png { log_not_found off; access_log off; } # This block will catch static file requests, such as images, css, js # The ?: prefix is a 'non-capturing' mark, meaning we do not require # the pattern to be captured into $1 which should help improve performance 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)$ { # Some basic cache-control for static files to be sent to the browser expires max; add_header Pragma public; add_header Cache-Control ""public, must-revalidate, proxy-revalidate""; } # Deny all attempts to access hidden files such as .htaccess, .htpasswd, .DS_Store (Mac). # Keep logging the requests to parse later (or to pass to firewall utilities such as fail2ban) location ~ /\. { access_log off; log_not_found off; deny all; } location ~ ~$ { access_log off; log_not_found off; deny all; } # Common deny or internal locations, to help prevent access to areas of # the site that should not be public location ~* wp-admin/includes { deny all; } location ~* wp-includes/theme-compat/ { deny all; } location ~* wp-includes/js/tinymce/langs/.*\.php { deny all; } location /wp-content/ { internal; } # Deny access to any files with a .php extension in the uploads directory # Works in sub-directory installs and also in multisite network # Keep logging the requests to parse later (or to pass to firewall utilities such as fail2ban) location ~* /(?:uploads|files)/.*\.php$ { deny all; } # Make sure these get through, esp with dynamic WP sitmap plugin location = /robots.txt { try_files $uri /index.php; } location = /sitemap.xml { try_files $uri /index.php; } location = /sitemap.xml.gz { try_files $uri /index.php; } # Fix for Firefox issue with cross site font icons location ~* \.(eot|otf|ttf|woff)$ { add_header Access-Control-Allow-Origin *; } # Redirect server error pages to the static page /50x.html # Make sure 50x.html exists at that location error_page 500 502 503 504 /50x.html; location = /50x.html { root /usr/share/nginx/html; } # Cache everything by default set $skip_cache 0; # POST requests and urls with a query string should always go to PHP if ($request_method = POST) { set $skip_cache 1; } if ($query_string != """") { set $skip_cache 1; } # Don't cache uris containing the following segments if ($request_uri ~* ""/wp-admin/|/xmlrpc.php|wp-.*.php|/feed/|index.php|sitemap(_index)?.xml"") { set $skip_cache 1; } # Don't use the cache for logged in users or recent commenters if ($http_cookie ~* ""comment_author|wordpress_[a-f0-9]+|wp-postpass|wordpress_no_cache|wordpress_logged_in"") { set $skip_cache 1; } # Pass all .php files onto a php-fpm/php-fcgi server. location ~ [^/]\.php(/|$) { # regex to split $uri to $fastcgi_script_name and $fastcgi_path fastcgi_split_path_info ^(.+\.php)(/.+)$; # Check that the PHP script exists before passing it try_files $fastcgi_script_name =404; # Bypass the fact that try_files resets $fastcgi_path_info # see: http://trac.nginx.org/nginx/ticket/321 set $path_info $fastcgi_path_info; fastcgi_param PATH_INFO $path_info; fastcgi_pass unix:/var/run/example.com.sock; fastcgi_index index.php; # Uncomment if site is HTTPS #fastcgi_param HTTPS on; include fastcgi.conf; fastcgi_cache_bypass $skip_cache; fastcgi_no_cache $skip_cache; fastcgi_cache WORDPRESS; fastcgi_cache_valid 60m; } location ~ /purge(/.*) { fastcgi_cache_purge WORDPRESS ""$scheme$request_method$host$1""; } # Use this block if PHPMyAdmin is enabled for this domain location /phpmyadmin { root /usr/share/; index index.php index.html index.htm; location ~ ^/phpmyadmin/(.+\.php)$ { try_files $uri =404; root /usr/share/; fastcgi_pass unix:/var/run/example.com.sock; fastcgi_index index.php; include fastcgi.conf; } location ~* ^/phpmyadmin/(.+\.(jpg|jpeg|gif|css|png|js|ico|html|xml|txt))$ { root /usr/share/; } } location /phpMyAdmin { rewrite ^/* /phpmyadmin last; } # End PHPMyAdmin block } # End of server block." Nginx configuration file # true true false false https://en.wikipedia.org/wiki/Nginx 6 0 Nginx https://github.com/brandonwamboldt/sublime-nginx 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 Nginx nginx engineer nearley Nearley 2014 Kartik Chandra 26 grammarLanguage https://nearley.js.org/ 0 2.20.1 234 1 8 24236 true 0 https://github.com/Hardmath123/nearley grammarLanguage 32 33 53 0 text source.ne programming 2014 2024 2014 45 232 3578 195 false 4 2017 2017 1 2 2014 2024 1094 66 134 3 28707 https://github.com/kach/nearley/issues ne nearley javascript html markdown json svg css yaml bourne-shell true 4542 0 37 1 false 2 true https://nearley.js.org/docs/how-to-grammar-good text United States "# nearley grammar @builtin ""string.ne"" @{% function insensitive(sl) { var s = sl.literal; result = []; for (var i=0; i whit? prog whit? {% function(d) { return d[1]; } %} prog -> prod {% function(d) { return [d[0]]; } %} | prod whit prog {% function(d) { return [d[0]].concat(d[2]); } %} prod -> word whit? (""-""|""=""):+ "">"" whit? expression+ {% function(d) { return {name: d[0], rules: d[5]}; } %} | word ""["" wordlist ""]"" whit? (""-""|""=""):+ "">"" whit? expression+ {% function(d) {return {macro: d[0], args: d[2], exprs: d[8]}} %} | ""@"" whit? js {% function(d) { return {body: d[2]}; } %} | ""@"" word whit word {% function(d) { return {config: d[1], value: d[3]}; } %} | ""@include"" whit? string {% function(d) {return {include: d[2].literal, builtin: false}} %} | ""@builtin"" whit? string {% function(d) {return {include: d[2].literal, builtin: true }} %} expression+ -> completeexpression | expression+ whit? ""|"" whit? completeexpression {% function(d) { return d[0].concat([d[4]]); } %} expressionlist -> completeexpression | expressionlist whit? "","" whit? completeexpression {% function(d) { return d[0].concat([d[4]]); } %} wordlist -> word | wordlist whit? "","" whit? word {% function(d) { return d[0].concat([d[4]]); } %} completeexpression -> expr {% function(d) { return {tokens: d[0]}; } %} | expr whit? js {% function(d) { return {tokens: d[0], postprocess: d[2]}; } %} expr_member -> word {% id %} | ""$"" word {% function(d) {return {mixin: d[1]}} %} | word ""["" expressionlist ""]"" {% function(d) {return {macrocall: d[0], args: d[2]}} %} | string ""i"":? {% function(d) { if (d[1]) {return insensitive(d[0]); } else {return d[0]; } } %} | ""%"" word {% function(d) {return {token: d[1]}} %} | charclass {% id %} | ""("" whit? expression+ whit? "")"" {% function(d) {return {'subexpression': d[2]} ;} %} | expr_member whit? ebnf_modifier {% function(d) {return {'ebnf': d[0], 'modifier': d[2]}; } %} ebnf_modifier -> "":+"" {% id %} | "":*"" {% id %} | "":?"" {% id %} expr -> expr_member | expr whit expr_member {% function(d){ return d[0].concat([d[2]]); } %} word -> [\w\?\+] {% function(d){ return d[0]; } %} | word [\w\?\+] {% function(d){ return d[0]+d[1]; } %} string -> dqstring {% function(d) {return { literal: d[0] }; } %} #string -> ""\"""" charset ""\"""" {% function(d) { return { literal: d[1].join("""") }; } %} # #charset -> null # | charset char {% function(d) { return d[0].concat([d[1]]); } %} # #char -> [^\\""] {% function(d) { return d[0]; } %} # | ""\\"" . {% function(d) { return JSON.parse(""\""""+""\\""+d[1]+""\""""); } %} charclass -> ""."" {% function(d) { return new RegExp("".""); } %} | ""["" charclassmembers ""]"" {% function(d) { return new RegExp(""["" + d[1].join('') + ""]""); } %} charclassmembers -> null | charclassmembers charclassmember {% function(d) { return d[0].concat([d[1]]); } %} charclassmember -> [^\\\]] {% function(d) { return d[0]; } %} | ""\\"" . {% function(d) { return d[0] + d[1]; } %} js -> ""{"" ""%"" jscode ""%"" ""}"" {% function(d) { return d[2]; } %} jscode -> null {% function() {return """";} %} | jscode [^%] {% function(d) {return d[0] + d[1];} %} | jscode ""%"" [^}] {% function(d) {return d[0] + d[1] + d[2]; } %} # Whitespace with a comment whit -> whitraw | whitraw? comment whit? # Optional whitespace with a comment whit? -> null | whit # Literally a string of whitespace whitraw -> [\s] | whitraw [\s] # A string of whitespace OR the empty string whitraw? -> null | whitraw comment -> ""#"" commentchars ""\n"" commentchars -> null | commentchars [^\n]" https://github.com/Hardmath123/nearley # true false true true true false 0 0 nearley.js.org Nearley https://github.com/Hardmath123/sublime-nearley Nearley terra Terra 2012 29 pl http://terralang.org/ 0 1.2.0 235 3 14 24235 true 0 https://github.com/zdevito/terra pl 195 206 410 0 lua lua lua text/x-lua source.terra programming 2012 2024 2012 95 197 2692 122 false t/Terra.t 3 2016 2016 3 1 2012 2025 1623 70 738 8 54686 Terra is a low-level system programming language that is embedded in and meta-programmed by the Lua programming language: Terra is a low-level system programming language that is embedded in and meta-programmed by the Lua programming language: Terra is a low-level system programming language that is embedded in and meta-programmed by the Lua programming language: t t cpp lua markdown c cmake bourne-shell yaml javascript html css dockerfile make nix diff true 3555 0 46 false 1 true https://docs.terra.money/ text http://www.rosettacode.org/wiki/Category:Terra "-- This top-level code is plain Lua code. function printhello() -- This is a plain Lua function print(""Hello, Lua!"") end printhello() -- Terra is backwards compatible with C, we'll use C's io library in our example. C = terralib.includec(""stdio.h"") -- The keyword 'terra' introduces a new Terra function. terra hello(argc : int, argv : &rawstring) -- Here we call a C function from Terra C.printf(""Hello, Terra!\n"") return 0 end -- You can call Terra functions directly from Lua, they are JIT compiled -- using LLVM to create machine code hello(0,nil) -- Terra functions are first-class values in Lua, and can be introspected -- and meta-programmed using it hello:disas() --[[ output: assembly for function at address 0x60e6010 0x60e6010(+0): push rax 0x60e6011(+1): movabs rdi, 102129664 0x60e601b(+11): movabs rax, 140735712154681 0x60e6025(+21): call rax 0x60e6027(+23): xor eax, eax 0x60e6029(+25): pop rdx 0x60e602a(+26): ret ]] -- You can save Terra code as executables, object files, or shared libraries -- and link them into existing programs terralib.saveobj(""helloterra"",{ main = hello })" "print(""Hello World"") " "C = terralib.includecstring [[ #include #include ]] local arraytypes = {} function Array(T) local struct ArrayImpl { data : &T; N : int; } function ArrayImpl.metamethods.__typename(self) return ""Array(""..tostring(T).."")"" end arraytypes[ArrayImpl] = true terra ArrayImpl:init(N : int) self.data = [&T](C.malloc(N*sizeof(T))) self.N = N end terra ArrayImpl:free() C.free(self.data) end ArrayImpl.metamethods.__apply = macro(function(self,idx) return `self.data[idx] end) ArrayImpl.metamethods.__methodmissing = macro(function(methodname,selfexp,...) local args = terralib.newlist {...} local i = symbol(int) local promotedargs = args:map(function(a) if arraytypes[a:gettype()] then return `a(i) else return a end end) return quote var self = selfexp var r : ArrayImpl r:init(self.N) for [i] = 0,r.N do r.data[i] = self.data[i]:[methodname](promotedargs) end in r end end) return ArrayImpl end struct Complex { real : float; imag : float; } terra Complex:add(c : Complex) return Complex { self.real + c.real, self.imag + c.imag } end ComplexArray = Array(Complex) N = 10 terra testit() var ca : ComplexArray ca:init(N) for i = 0,N do ca(i) = Complex { i, i + 1 } end var ra = ca:add(ca) return ra end local r = testit() assert(r.N == N) for i = 0,N-1 do assert(r.data[i].real == 2*i) assert(r.data[i].imag == 2*(i+1)) end assert(tostring(Array(int)) == ""Array(int32)"")" Terra https://github.com/zdevito/terra -- print """" true true true false true 0 4 terralang.org Terra https://github.com/pyk/sublime-terra Terra 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 octave GNU Octave 1988 John W. Eaton 38 pl https://gnu.org/software/octave/ 0 236 4 24235 2302 true 0 pl false o/Octave.m matlab.py 1988 linux c fortran scilab opengl gnuplot unix bash lisp qt 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. 2002 467 613 653 48707 University of Wisconsin-Madison && University of Texas m m true 2406 0 42 1 https://tio.run/#octave https://docs.octave.org/interpreter/ text octave Octave http://www.rosettacode.org/wiki/Category:Octave octave United States Octave "#Hello World in Octave (http://www.octave.org/) printf(""Hello World\n""); " "printf(""Hello World""); " Octave https://riju.codes/octave "disp(""Hello, world!"") " "% create figure and panel on it f = figure; % create a button group gp = uibuttongroup (f, ""Position"", [ 0 0.5 1 1]) % create a buttons in the group b1 = uicontrol (gp, ""style"", ""radiobutton"", ""string"", ""Choice 1"", ""Position"", [ 10 150 100 50 ]); b2 = uicontrol (gp, ""style"", ""radiobutton"", ""string"", ""Choice 2"", ""Position"", [ 10 50 100 30 ]); % create a button not in the group b3 = uicontrol (f, ""style"", ""radiobutton"",""string"", ""Not in the group"",""Position"", [ 10 50 100 50 ]);" Octave % printf """" true true true true true true false true https://github.com/calysto/octave_kernel https://en.wikipedia.org/wiki/GNU_Octave 1 0 https://hopl.info/showlanguage.prx?exp=2302 GNU Octave title|year|author|goodreadsId|rating|ratings|reviews\nScientific Computing with MATLAB and Octave|2003|Alfio Quarteroni|312792|4.10|10|0 opa Opa 2011 41 pl http://opalang.org 0 1.1.0 237 3 20 24230 true 0 https://github.com/MLstate/opalang pl 50 58 76 0 text source.opa programming 2011 2024 2010 47 125 1242 37 false o/Opa.opa 23 2011 2014 2 3 ml.py 2010 2017 4609 71 1707 42 334367 2010 2011 linux ocaml erlang javascript jquery html mongodb postgresql sql dart haxe coffeescript 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. 2011 53 94 149 32976878 https://github.com/MLstate opa opa opa ocaml javascript css bourne-shell c diff lisp make bash xml html svg vim-script markdown perl qml java python z-shell dockerfile true 2175 0 93 false 1 true https://github.com/MLstate/opalang/wiki/A-tour-of-Opa text http://www.rosettacode.org/wiki/Category:Opa France "jlog(""Hello World"") " "/** * To compile & run on port 8080: * opa hello_syntax1.opa -- */ server = Server.one_page_server( ""Hello, world"", -> (
Hello, world
) ) " Opa https://twitter.com/opalang "Server.start(Server.http, { title: ""Hello"" , page: function() {
Hello, web!
} } )" Opa 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 https://github.com/MLstate/opalang /* */ jlog """" true true true true true true true true true true false true true https://en.wikipedia.org/wiki/Opa_(programming_language) 2 0 opalang.org Opa https://github.com/mads379/opa.tmbundle year|publisher|title|authors|isbn13\n2013|Packt Publishing|Opa Application Development|Wenbo, Li|9781782163749\n20130612|Packt Publishing|Opa Application Development|Li Wenbo|9781782163756 Opa cson CSON 2011 Benjamin Lupton 19 dataNotation 11 8.4.0 238 2 6 24211 true 11 ait catala cson factor flow9 fork-lang invokator ko koka mirth unison https://github.com/bevry/cson dataNotation 1 2 16 0 coffee coffeescript text/x-coffeescript source.coffee data 2011 2024 2011 23 56 1334 2 false c/CSON.cson 332 2013 2018 4 30 CoffeeScript Object Notation 2011 2023 208 19 49 1 4197 https://bevry.me/ cson cson json cson coffeescript markdown yaml javascript true 1722 0 26 1 true 8 true cson text Australia {'Hello': 'World'} 'menu': [ { 'label': 'Packages' 'submenu': [ 'label': 'Wercker Status' 'submenu': [ { 'label': 'Check now!', 'command': 'wercker-status:checknow' } ] ] } ] CSON https://github.com/bevry/cson 0 0 CSON https://github.com/atom/language-coffee-script CSON matplotlib Matplotlib 2003 John D. Hunter 18 dataVis library http://matplotlib.org/ 0 v3.9.0 239 1 22 24210 true 0 https://github.com/matplotlib/matplotlib dataVis 2011 2024 2003 597 7522 19754 1586 false 2003 2025 52465 1824 4609 459 911835 2012 python numpy qt opengl matlab scipy gnuplot julia octave maxima excel-app jython sagemath "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." 2005 218 85 241 2901907 https://github.com/matplotlib python svg restructuredtext cpp yaml meson json html markdown css javascript csv jupyter-notebook bourne-shell tex objective-c toml xml ini make c lua true 45256 0 40 1 false 3 true text Various https://twitter.com/matplotlib >>> from matplotlib import cm >>> from mpl_toolkits.mplot3d import Axes3D >>> import matplotlib.pyplot as plt >>> import numpy as np >>> fig = plt.figure() >>> ax = fig.gca(projection='3d') >>> X = np.arange(-5, 5, 0.25) >>> Y = np.arange(-5, 5, 0.25) >>> X, Y = np.meshgrid(X, Y) >>> R = np.sqrt(X**2 + Y**2) >>> Z = np.sin(R) >>> surf = ax.plot_surface(X, Y, Z, rstride=1, cstride=1, cmap=cm.coolwarm) >>> plt.show() https://github.com/matplotlib/matplotlib https://en.wikipedia.org/wiki/Matplotlib 6 0 matplotlib.org 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 halide Halide 2010 21 pl http://halide-lang.org/ 0 v17.0.1 240 1 23 24209 true 0 https://github.com/halide/Halide pl 2012 2024 2010 243 1067 5798 1052 false 2010 2025 32101 342 2267 180 480745 2012 a language for fast, portable computation on images and tensors a language for fast, portable computation on images and tensors https://github.com/halide a language for fast, portable computation on images and tensors cpp cmake python make bourne-shell markdown java llvmir xml yaml c json objective-cpp javascript gradle bash html css jupyter-notebook pascal idl toml assembly-language true 9343 0 45 false 17 true United States https://news.ycombinator.com/item?id=7544855 Func blur_3x3(Func input) { Func blur_x, blur_y; Var x, y, xi, yi; // The algorithm - no storage or order blur_x(x, y) = (input(x-1, y) + input(x, y) + input(x+1, y))/3; blur_y(x, y) = (blur_x(x, y-1) + blur_x(x, y) + blur_x(x, y+1))/3; // The schedule - defines order, locality; implies storage blur_y.tile(x, y, xi, yi, 256, 32) .vectorize(xi, 8).parallel(y); blur_x.compute_at(blur_y, x).vectorize(x, 8); return blur_y; } https://github.com/halide/Halide // true true false 0 12 halide-lang.org year|title|doi|citations|influentialCitations|authors|paperId\n2016|Automatically scheduling halide image processing pipelines|10.1145/2897824.2925952|133|17|Ravi Teja Mullapudi and Andrew Adams and Dillon Sharlet and Jonathan Ragan-Kelley and Kayvon Fatahalian|9b240a87b11d085641d6640f73cc3cc2d678e305\n2019|Learning to optimize halide with tree search and random programs|10.1145/3306346.3322967|128|19|Andrew Adams and Karima Ma and Luke Anderson and Riyadh Baghdadi and Tzu-Mao Li and Michaël Gharbi and Benoit Steiner and Steven Johnson and Kayvon Fatahalian and F. Durand and Jonathan Ragan-Kelley|f90a7bc396e205b204d5d6066a10162f84b128f9\n2018|Differentiable programming for image processing and deep learning in halide|10.1145/3197517.3201383|78|8|Tzu-Mao Li and Michaël Gharbi and Andrew Adams and F. Durand and Jonathan Ragan-Kelley|c1c8d15520d84ed6d9a701e18627ded4d8f1eb2a\n2017|Halide|10.1145/3150211|48|0|Jonathan Ragan-Kelley and Andrew Adams and Dillon Sharlet and Connelly Barnes and Sylvain Paris and M. Levoy and S. Amarasinghe and F. Durand|93bb58cfdd34521c59e593d8f4332a75a18e3448\n2015|Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code|10.1145/2737924.2737974|28|3|Charith Mendis and Jeffrey Bosboom and Kevin Wu and S. Kamil and Jonathan Ragan-Kelley and Sylvain Paris and Qin Zhao and Saman P. Amarasinghe|62e3781d9aa0a2dc5845f5cb06466ba9e83f9241\n2019|Automatically translating image processing libraries to halide|10.1145/3355089.3356549|21|1|Maaz Bin Safeer Ahmad and Jonathan Ragan-Kelley and Alvin Cheung and S. Kamil|8a52c0852c1a38c9f24a14704e1fb749b55ddbba\n2017|Extending Halide to Improve Software Development for Imaging DSPs|10.1145/3106343|8|0|Sander Vocke and H. Corporaal and Roel Jordans and R. Corvino and Rick J. M. Nas|213533b755b70e4754b2f11f39c766db17aa71a9\n2014|Easy optimization of image transformation using sFFT algorithm with HALIDE language|10.1109/IC3I.2014.7019723|7|0|C. Thirumoorthi and T. Karthikeyan|cc86e7bc4031e7ce45d3af516ba15c7345e146b4\n2019|Accelerate DNN Performance with Sparse Matrix Compression in Halide|10.1145/3339186.3339194|6|0|Chao-Lin Lee and Chen-Ting Chao and Jenq-Kuen Lee and Ming-Yu Hung and Chung-Wen Huang|0056c33177043161aaf81565191dac14bb8c5c6a\n2016|Locality-Aware Scheduling for Stencil Code in Halide|10.1109/ICPPW.2016.26|3|0|Shih-Wei Liao and Sheng-Jun Tsai and Chieh-Hsun Yang and C. Lo|58f7375ba591a446d5ff44d08cf9aaf143441d8b\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|Halide and OpenMP for generating high-performance recursive filters|10.1117/12.2566537|1|0|Yuta Tsuji and Norishige Fukushima|e14b46621e0c04bd4b877e11a71d76b56e1396d7 agda Agda 2007 Ulf Norell and Catarina Coquand 37 pl http://wiki.portal.chalmers.se/agda 4 241 3 24208 7860 true 5 axio cloc datafun obsidian-lang pygments pl 143 207 2120 0 text source.agda programming false a/Agda.agda 6 2011 2014 1 2 haskell.py 2007 coq epigram haskell idris emacs-editor unicode javascript 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. 2006 102 64 256 4426773 Chalmers University of Technology agda agda agda agda lagda true 731 0 43 2 agda lagda https://tio.run/#agda https://agda.readthedocs.io/en/v2.6.2.2/ text http://www.rosettacode.org/wiki/Category:Agda Sweden "module agda where open import IO main = run (putStrLn ""Hello World"") " module NatCat where open import Relation.Binary.PropositionalEquality -- If you can show that a relation only ever has one inhabitant -- you get the category laws for free module EasyCategory (obj : Set) (_⟶_ : obj → obj → Set) (_∘_ : ∀ {x y z} → x ⟶ y → y ⟶ z → x ⟶ z) (id : ∀ x → x ⟶ x) (single-inhabitant : (x y : obj) (r s : x ⟶ y) → r ≡ s) where idʳ : ∀ x y (r : x ⟶ y) → r ∘ id y ≡ r idʳ x y r = single-inhabitant x y (r ∘ id y) r idˡ : ∀ x y (r : x ⟶ y) → id x ∘ r ≡ r idˡ x y r = single-inhabitant x y (id x ∘ r) r ∘-assoc : ∀ w x y z (r : w ⟶ x) (s : x ⟶ y) (t : y ⟶ z) → (r ∘ s) ∘ t ≡ r ∘ (s ∘ t) ∘-assoc w x y z r s t = single-inhabitant w z ((r ∘ s) ∘ t) (r ∘ (s ∘ t)) open import Data.Nat same : (x y : ℕ) (r s : x ≤ y) → r ≡ s same .0 y z≤n z≤n = refl same .(suc m) .(suc n) (s≤s {m} {n} r) (s≤s s) = cong s≤s (same m n r s) ≤-trans : ∀ x y z → x ≤ y → y ≤ z → x ≤ z ≤-trans .0 y z z≤n s = z≤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) ≤-refl : ∀ x → x ≤ x ≤-refl zero = z≤n ≤-refl (suc x) = s≤s (≤-refl x) module Nat-EasyCategory = EasyCategory ℕ _≤_ (λ {x}{y}{z} → ≤-trans x y z) ≤-refl same Agda data _≤_ : ℕ → ℕ → Set where z≤n : {n : ℕ} → zero ≤ n s≤s : {n m : ℕ} → n ≤ m → suc n ≤ suc m Agda -- putStrLn """" true true true true true true true false true true https://en.wikipedia.org/wiki/Agda_(programming_language) 7 14 https://hopl.info/showlanguage.prx?exp=7860 Agda https://github.com/mokus0/Agda.tmbundle 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 Agda 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 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 penrose Penrose 2016 Katherine Ye and Wode Ni and Max Krieger and Dor Ma’Ayan and Jenna Wise and Jonathan Aldrich and Joshua Sunshine and Keenan Crane 22 diagramLang http://penrose.ink 0 https://penrose.cs.cmu.edu/blog v3.2.0 242 1 13 24207 true 0 https://github.com/penrose/penrose diagramLang 2016 2024 2016 111 280 6734 170 false 2016 2025 5539 60 1516 1100 250183 https://penrose.cs.cmu.edu/try/ Create beautiful diagrams just by typing notation in plain text. Create beautiful diagrams just by typing notation in plain text. https://penrose.cs.cmu.edu/media/Penrose_SIGGRAPH2020a.pdf Carnegie Mellon Create beautiful diagrams just by typing notation in plain text. json typescript markdown svg css html javascript yaml vim-script python lisp handlebars bourne-shell true 7636 0 42 8 false 3 true https://penrose.cs.cmu.edu/docs/ref United States Set A, B, C, D, E, F, G Subset(B, A) Subset(C, A) Subset(D, B) Subset(E, B) Subset(F, C) Subset(G, C) Disjoint(E, D) Disjoint(F, G) Disjoint(B, C) AutoLabel All https://discord.com/invite/a7VXJU4dfR https://twitter.com/usepenrose https://github.com/penrose/penrose 0 1 penrose.ink 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 literate-coffeescript Literate CoffeeScript 2013 Jeremy Ashkenas 19 pl https://coffeescript.org/#literate 0 2.7.0 243 1 9 24206 true 0 https://github.com/jashkenas/coffeescript pl 7938 true 0 CoffeeScript litcoffee text source.litcoffee programming 2009 2024 2009 509 1978 16466 83 false 332 2013 2018 1 30 2009 2023 5205 279 458 32 220021 2009 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. 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. https://github.com/jashkenas/coffeescript/issues 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. litcoffee coffeemd markdown coffeescript html javascript css json svg yaml xml true 22881 0 28 1 false 2 true text United States https://news.ycombinator.com/item?id=5277916 "The **Scope** class regulates lexical scoping within CoffeeScript. As you generate code, you create a tree of scopes in the same shape as the nested function bodies. Each scope knows about the variables declared within it, and has a reference to its parent enclosing scope. In this way, we know which variables are new and need to be declared with `var`, and which are shared with external scopes. Import the helpers we plan to use. {extend, last} = require './helpers' exports.Scope = class Scope The `root` is the top-level **Scope** object for a given file. @root: null Initialize a scope with its parent, for lookups up the chain, as well as a reference to the **Block** node it belongs to, which is where it should declare its variables, and a reference to the function that it belongs to. constructor: (@parent, @expressions, @method) -> @variables = [{name: 'arguments', type: 'arguments'}] @positions = {} Scope.root = this unless @parent Adds a new variable or overrides an existing one. add: (name, type, immediate) -> return @parent.add name, type, immediate if @shared and not immediate if Object::hasOwnProperty.call @positions, name @variables[@positions[name]].type = type else @positions[name] = @variables.push({name, type}) - 1 When `super` is called, we need to find the name of the current method we're in, so that we know how to invoke the same method of the parent class. This can get complicated if super is being called from an inner function. `namedMethod` will walk up the scope tree until it either finds the first function object that has a name filled in, or bottoms out. namedMethod: -> return @method if @method.name or !@parent @parent.namedMethod() Look up a variable name in lexical scope, and declare it if it does not already exist. find: (name) -> return yes if @check name @add name, 'var' no Reserve a variable name as originating from a function parameter for this scope. No `var` required for internal references. parameter: (name) -> return if @shared and @parent.check name, yes @add name, 'param' Just check to see if a variable has already been declared, without reserving, walks up to the root scope. check: (name) -> !!(@type(name) or @parent?.check(name)) Generate a temporary variable name at the given index. temporary: (name, index) -> if name.length > 1 '_' + name + if index > 1 then index - 1 else '' else '_' + (index + parseInt name, 36).toString(36).replace /\d/g, 'a' Gets the type of a variable. type: (name) -> return v.type for v in @variables when v.name is name null If we need to store an intermediate result, find an available name for a compiler-generated variable. `_var`, `_var2`, and so on... freeVariable: (name, reserve=true) -> index = 0 index++ while @check((temp = @temporary name, index)) @add temp, 'var', yes if reserve temp Ensure that an assignment is made at the top of this scope (or at the top-level scope, if requested). assign: (name, value) -> @add name, {value, assigned: yes}, yes @hasAssignments = yes Does this scope have any declared variables? hasDeclarations: -> !!@declaredVariables().length Return the list of variables first declared in this scope. declaredVariables: -> realVars = [] tempVars = [] for v in @variables when v.type is 'var' (if v.name.charAt(0) is '_' then tempVars else realVars).push v.name realVars.sort().concat tempVars.sort() Return the list of assignments that are supposed to be made at the top of this scope. assignedVariables: -> ""#{v.name} = #{v.type.value}"" for v in @variables when v.type.assigned" https://github.com/jashkenas/coffeescript true 0 0 coffeescript.org https://github.com/atom/language-coffee-script Literate CoffeeScript cir CIR 2020 20 ir https://facebookincubator.github.io/clangir/ 0 244 1 54 24205 true 1 swift-il https://github.com/facebookincubator/clangir ir 2022 2024 2001 13 6 157 0 false Clang IR 2001 2022 419652 3581 112009 1029 24152661 Clang IR (CIR) is a new IR for Clang. Clang IR (CIR) is a new IR for Clang. Engineering at Meta Clang IR (CIR) is a new IR for Clang. llvmir cpp assembly-language c yaml python objective-c cmake restructuredtext fortran-90 opencl objective-cpp make cuda smalltalk markdown xml bourne-shell json html fortran-77 csv ocaml pascal starlark svg perl go css lisp vim-script scheme bazel expect matlab bash dockerfile javascript csharp ini protobuf lua typescript tex diff rust awk swift logos julia mathematica m4 toml d true 3758 0 76 llvmir false United States https://discourse.llvm.org/t/rfc-an-mlir-based-clang-ir-cir/63319 // Read from local variable, address in %0. %1 = cir.load %0 : !cir.ptr, i32 // Load address from memory at address %0. %3 is used by at least one // operation that dereferences a pointer. %3 = cir.load deref %0 : cir.ptr > https://github.com/facebookincubator/clangir // true true false 0 0 arrow-format Apache Arrow 2016 Wes McKinney 16 binaryDataFormat https://arrow.apache.org/ 0 245 0 40 24202 false 1 mps-format https://github.com/apache/arrow binaryDataFormat 2016 2024 354 3417 14009 4742 false feather 2016 2025 18278 1473 5689 209 1442602 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. 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. Apache Software Foundation 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. java cpp go ruby csharp matlab python typescript restructuredtext r bourne-shell yaml json cmake markdown dockerfile assembly-language cython swift javascript c svg xml csv meson diff make protobuf vala html lua toml css lisp thrift objective-cpp bash awk sql sed true 25755 0 56 1 false binary Various https://github.com/apache/arrow https://en.wikipedia.org/wiki/Apache_Arrow 0 0 arrow.apache.org rdf RDF 1997 17 dataNotation https://www.w3.org/RDF/ 0 246 1 24200 true 11 bossam krml krml microdata notation3 oem sdlang shacl susn trig-syntax underlay dataNotation false Resource Description Framework 1997 owl xml turtle json unicode sparql sql python 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. 2001 815 698 947 53847 W3C 4096 0 18 json-ld https://www.w3.org/TR/rdf-concepts/ text United States "@prefix rdf: . @prefix foaf: . @prefix dc: . dc:publisher ""Wikipedia"" ; dc:title ""Tony Benn"" ; foaf:primaryTopic [ a foaf:Person ; foaf:name ""Tony Benn"" ] ." true true https://en.wikipedia.org/wiki/Resource_Description_Framework 6 17 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 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 title|year|author|goodreadsId|rating|ratings|reviews\nCreating The Semantic Web With Rdf: Professional Developer's Guide||Johan Hjelm|774684|3.75|4|0 bourne-shell Bourne shell 1977 Stephen Bourne 17 pl 634 247 0 24197 3931 true 634 aardvark abcl-lang abs ace adept alma-007 alpaca aluasm alumina amber ana apache-hbase aplette aretext argdown ark-lang arkscript arret arrow-format asciidots asterius-compiler atomspace atprotocol austral avail ballerina bamboo bash basis-universal-format battlestar bazel beef berkeleydb berry bicep binaryen bio blech blender-app blitzmax blockml blox blz boomerang-decompiler bpkg-pm bruijn bucardo bucklescript c2 c3 cairo calc4 calcit calypso candor capn-proto caramel carbon carp carth catala ceu ceylon chaiscript chevrotain chibicc chicken chika chrysalisp cir circle-lang cityhash-hash-function civet claro clash clay click cloc clojure clojurescript cmake co2 codecept codeql coffeekup cokescript comby common-workflow-language concurr contracts.coffee coq cor cortex couchdb cperl crema crmsh cryptol crystal cspydr csvw curv cwerg cyber d3 dafny dale dasel dasm dat-protocol datafun datascript ddp dedukti dern dexvis dgraph dhall differential-datalog dllup dlvm dogescript dplyr dragonbasic drakon drupal dub-pm duro dyvil easybuild ec ecl ecr edina eff eiffel elixir elm elvish elymas emojicode emscripten encore enso erg erlang euphoria eyg f-prime fact-lang factor fancy fardlang fay fe felix femtolisp fennel fetlang ffmpeg firrtl fish flame-ir flatbuffers fleck flex flix flow flow9 flowchart-fun flownote flua flutter fork-lang forml forsp fql frege fstar futhark g-portugol gamerlanguage gap generate-ninja gerbil gforth ghc git gleam glicol glms gluon go gogs-editor golo gradle gravity grid-notation gridstudio-editor groff gun gura gwion hackett hacspec hakaru hal-format halide hamler hare harlan hasklig haste haxe haxelibs-pm hcl hedy hera hhvm hobbes homa homebrew-pm hook htmx htsql huginn hurl hush huwcode hyphy i ibis icarus idris imba imhex impala ink inko invokator ircis iterm2 ixml j jakt jal-compiler janet jank jasmine java jayfor jemplate jflex jinja jinx jonprl jq jql jquery jsil-compiler jslt json-ld json-url jsonnet jsparagus julia juniper juvix k-framework kai kaitai kakoune-editor katex kefir keras kerf kitlang knight ko koka kona kotlin ktexteditor-editor ktyek kubernetes kumir kuroko ladybird lambda-zero lamdu-editor lamdu latino lawvere ldpl lean lem-editor leo-editor lesma lfortran lift lighttable ligo lil linearml links-programming-language linux litescript little lobster lodash luna lux lwjgl m3db mages mal mangle manim manool mapgen markus mastodon mathics mathjson matplotlib mdq melody menhir mermaid metalang99 mewl mewmew mgmt michelson micro-cpp micro-editor micro-mitten microblocks micropython minilang mirah mirth mlpolyr mobl-lang mochi moirai mojo monaco mongodb monkeyx moonbit moonscript mountain moya mps mu mudlle mun-lang mycroft myia mys mythryl nadesiko ncl nearley neeilang neko nesc nestedtext netbeans-editor netlogo neut never newclay newlisp nextflow ngs nianiolang nim nimskull ninja nit nltk nodejs noisecraft noms-db noweb nqc numba nushell objectscript observable-framework obsidian-lang oden odin ohm oil ok olc om onnx ooc opa opal opam-pm open-nn opencomal opencv openrc-runscript openscad openverse orca-pl orca oxyl p-star p pact pandas paraview partiql pcre penrose perl pest pgbouncer pharen phel php pkl plaid-programming-language plam plasma please-build poke polyglot-compiler popr porffor postgresql potion pov-ray-sdl powershell prettier project-mentat prometheus prql psyche-c psyche purescript pycket pygments pyret-lang pyret python pytorch qoir qore quickjs quint racket ragel rainbow rakudo ralph ramdascript ramen rapidbatch rascal reach react-native reactjs reason recfiles red redis redprl reforth reia reko-decompiler ren-c rescript retdec revolution-programming-language rhine rholang ricscript rmarkdown roc rocksdb rosie roslyn-compiler rouge roy ru ruby rust saltstack sanddance satysfi savi scala-js scikit-learn scipy score scryer seq serious setlx shill shiv shml sile silk sill simit simple-binary-encoding skip skulpt slab slony smali smallbasic smpl solidity souper sourcepawn spatial spiderbasic sporth spry sqlite squiggle squire srt starlark stencil stoneknifeforth streem strictyaml sugar superjson surrealdb svgbob swi-prolog swift swizzle sympy tablam taichi tamgu tao-lang tao3d tbox-lib tea-pm tensorflow terra textadept-editor tht tibet tiledb tinyc-compiler tiscript tl tldr tldraw tmtp toi topshell tornado treesheets triton truck truth txtzyme typescript ucg ucl ultralisp-pm unison uno urweb v v8 vale-assembly vale vcpkg-pm vega-editor-app vega veryl video vimwiki virgil vlc vsxu vyper vyxal walt wasm wasmer wasp-lang wax web3js wing wiredtiger wlambda wonkey worst wren wyvern xarray xgboost-model xgboost xla xodio xsv-app xtclang xtext xxl yakou-lang yamp yang yara yasl yawl yeti yggdrasil yii z-flat zephir zest zig zl zolang zot zz pl false 1977 unix algol-68 c almquist-shell bash rc linux 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. 2002 270 249 420 92839 Bell Telephone 1370 0 18 1 sh text United States Bourne Shell true true https://en.wikipedia.org/wiki/Bourne_shell 2 0 https://hopl.info/showlanguage.prx?exp=3931 Bourne shell 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 kubernetes Kubernetes 2014 Craig McLuckie and Joe Beda and and Brendan Burns 17 application https://kubernetes.io 0 v1.31.0-alpha.0 248 0 20 24197 false 0 https://github.com/kubernetes/kubernetes application 2014 2024 3224 39005 108808 2514 false 2014 2025 147545 5485 26339 1152 1462028 2560 Google go yaml markdown json bourne-shell protobuf make assembly-language dockerfile starlark bash powershell python c svg toml sed csv html z-shell https://cheatsheets.zip/kubernetes true 245130 0 40 3 false 1 true https://docs.helm.sh/ United States https://www.reddit.com/r/kubernetes/ https://www.youtube.com/watch?v=8ZSxYJ0IaTc https://github.com/kubernetes/kubernetes https://en.wikipedia.org/wiki/Kubernetes 0 0 ace Ace Editor 2010 Fabian Jakobs 15 editor https://ace.c9.io 0 1.33.2 249 0 98 24193 false 2 prismjs pygments https://github.com/ajaxorg/ace editor 2010 2024 2010 619 5268 26584 148 false 2010 2025 9117 652 1523 46 436880 https://ace.c9.io/build/kitchen-sink.html 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. 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. Mozilla && Cloud9 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. javascript json xml html yaml markdown typescript css svg pug assembly-language bourne-shell tex make sql asciidoc restructuredtext robotframework kotlin liquid java-server-pages objective-c hcl scala blade powershell graphql haml vtl-lang stylus forth diff rust cpp nix raku tcl sass cobol pascal groovy ejs slim ruby actionscript java autohotkey vhdl twig crystal go gherkin fortran-77 elixir erb eex abap toml lua lisp less scheme qml logtalk odin json5 clojure vala r dockerfile coffeescript scss perl haxe erlang protobuf php swift python julia glsl nim ocaml haskell elm dart jsx smarty pig razor handlebars zig xquery ada ini f-sharp csharp coldfusion true 43042 0 118 codemirror monaco highlightjs pygments 1 false 1 true https://github.com/ajaxorg/ace 0 0 ace.c9.io nextflow Nextflow 2013 24 pl http://nextflow.io 0 v23.12.0-edge 250 1 19 24192 true 0 https://github.com/nextflow-io/nextflow pl 46 62 nextflow.config 3132 0 nextflow groovy source.nextflow programming 2013 2024 2013 87 609 2638 409 false 33 2018 2018 3 1 2013 2025 8663 226 2038 62 2014 https://github.com/nextflow-io nf groovy java markdown json bourne-shell gradle javascript yaml html dockerfile xml bash css make perl python svg toml csv true 4893 0 45 false 23 true https://www.nextflow.io/docs/latest/index.html text Sweden and Spain and Brazil and South Africa "#!/usr/bin/env nextflow /* * This is free and unencumbered software released into the public domain. * * Anyone is free to copy, modify, publish, use, compile, sell, or * distribute this software, either in source code form or as a compiled * binary, for any purpose, commercial or non-commercial, and by any * means. * * In jurisdictions that recognize copyright laws, the author or authors * of this software dedicate any and all copyright interest in the * software to the public domain. We make this dedication for the benefit * of the public at large and to the detriment of our heirs and * successors. We intend this dedication to be an overt act of * relinquishment in perpetuity of all present and future rights to this * software under copyright law. * * THE SOFTWARE IS PROVIDED ""AS IS"", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR * OTHER DEALINGS IN THE SOFTWARE. * * For more information, please refer to */ /* * Author Paolo Di Tommaso */ params.query = ""$HOME/sample.fa"" params.db = ""$HOME/tools/blast-db/pdb/pdb"" process blast { output: file top_hits """""" blastp -query ${params.query} -db ${params.db} -outfmt 6 \ | head -n 10 \ | cut -f 2 > top_hits """""" } process extract { input: file top_hits output: file sequences """""" blastdbcmd -db ${params.db} -entry_batch $top_hits > sequences """""" } process align { input: file sequences echo true """""" t_coffee $sequences 2>&- | tee align_result """""" }" https://twitter.com/nextflowio https://github.com/nextflow-io/nextflow /* */ true true false 0 1 nextflow.io Nextflow https://github.com/nextflow-io/atom-language-nextflow Nextflow 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 freecad FreeCAD 2002 Jürgen Riegel 18 cad 3d application https://www.freecad.org 0 251 0 24189 false 0 https://github.com/FreeCAD/FreeCAD cad false 2011 2025 43354 997 12019 2140 8227281 FreeCAD is an open-source parametric 3D modeler made primarily to design real-life objects of any size. Parametric modeling allows you to easily modify your design by going back into your model history and changing its parameters. FreeCAD is an open-source parametric 3D modeler made primarily to design real-life objects of any size. Parametric modeling allows you to easily modify your design by going back into your model history and changing its parameters. FreeCAD is an open-source parametric 3D modeler made primarily to design real-life objects of any size. Parametric modeling allows you to easily modify your design by going back into your model history and changing its parameters. true 36019 0 18 irc://irc.libera.chat/freecad 1 Germany https://www.facebook.com/FreeCAD https://discord.gg/w2cTKGzccC https://fosstodon.org/@FreeCAD https://reddit.com/r/FreeCAD https://twitter.com/FreeCADNews https://github.com/FreeCAD/FreeCAD https://en.wikipedia.org/wiki/FreeCAD 0 0 futhark Futhark 2013 Troels Henriksen and Cosmin Oancea and Martin Elsman 29 pl arrayLang https://futhark-lang.org 0 https://futhark-lang.org/blog.html 252 0 20 24188 true 0 https://github.com/diku-dk/futhark pl 107 92 text source.futhark programming 2013 2024 2013 68 166 2358 69 false futhark.py 2013 2025 17789 94 3106 55 207226 2016 Futhark, a high-performance parallel functional array language targeting GPUs. Futhark, a high-performance parallel functional array language targeting GPUs. University of Copenhagen Futhark, a high-performance parallel functional array language targeting GPUs. fut fut fut haskell restructuredtext markdown bourne-shell python c yaml nix make javascript json opencl css xml toml yacc logos cuda svg tex true 2952 0 54 apl 3 false fut text http://www.rosettacode.org/wiki/Category:Futhark Denmark Futhark https://github.com/diku-dk/futhark true true true true true true 0 0 futhark-lang.org Futhark Futhark magit Magit 2013 Marius Vollmer 17 application https://magit.vc/ 0 v3.3.0 253 1 4 24186 false 1 sourcetree https://github.com/magit/magit application 2010 2024 152 805 6453 17 false 2008 2025 12733 398 122 33 66623 git lisp emacs-lisp 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 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 https://emacs.stackexchange.com/questions/tagged/magit 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 lisp yaml markdown make true 9288 0 21 1 false 3 true https://magit.vc/manual/ Unknown https://github.com/magit/magit#readme https://github.com/magit/magit https://en.wikipedia.org/wiki/Magit 0 0 magit.vc pytorch PyTorch 2016 Ronan Collobert 17 library http://pytorch.org/ 0 254 0 35 24185 true 0 https://github.com/pytorch/pytorch library 2016 2024 2012 1743 21695 80826 14564 false 2012 2025 112330 5657 16537 1058 3553981 2016 2016 python cuda linux numpy "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" 2017 594 41 54022970 https://github.com/pytorch python cpp cuda restructuredtext c bourne-shell markdown yaml cmake glsl objective-cpp starlark assembly-language java bazel xml csv json jupyter-notebook dockerfile gradle protobuf css make html javascript svg ini toml powershell ruby diff objective-c bash vim-script https://cheatsheets.zip/pytorch true 154560 0 52 1 false Various https://www.reddit.com/r/pytorch/ https://twitter.com/pytorch https://github.com/pytorch/pytorch https://en.wikipedia.org/wiki/PyTorch 0 0 pytorch.org flex FLEX 1987 Vern Paxson 23 grammarLanguage https://github.com/westes/flex 0 v2.6.4 255 2 13 24178 2033 true 0 https://github.com/westes/flex grammarLanguage 2013 2024 1987 90 528 3518 147 false 1987 2025 2693 83 297 6 54411 1987 bison yacc c ratfor pl-0 "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." 2003 80 12 253 376795 University of California Berkeley lex c bourne-shell make yacc llvmir m4 markdown yaml perl awk cpp idl true 5607 0 36 1 false 2 true https://www.di.uminho.pt/~prh/FlexTutorial.pdf https://www.geeksforgeeks.org/flex-fast-lexical-analyzer-generator/ text 9114 United States https://github.com/babyraging/yash https://riju.codes/flex "%{ #include %} %% %% int yywrap() { printf(""Hello, world!\n""); return 1; } int main() { yylex(); return 0; } " "%{ #include ""y.tab.h"" %} digit [0-9] letter [a-zA-Z] %% ""+"" { return PLUS; } ""-"" { return MINUS; } ""*"" { return TIMES; } ""/"" { return SLASH; } ""("" { return LPAREN; } "")"" { return RPAREN; } "";"" { return SEMICOLON; } "","" { return COMMA; } ""."" { return PERIOD; } "":="" { return BECOMES; } ""="" { return EQL; } ""<>"" { return NEQ; } ""<"" { return LSS; } "">"" { return GTR; } ""<="" { return LEQ; } "">="" { return GEQ; } ""begin"" { return BEGINSYM; } ""call"" { return CALLSYM; } ""const"" { return CONSTSYM; } ""do"" { return DOSYM; } ""end"" { return ENDSYM; } ""if"" { return IFSYM; } ""odd"" { return ODDSYM; } ""procedure"" { return PROCSYM; } ""then"" { return THENSYM; } ""var"" { return VARSYM; } ""while"" { return WHILESYM; } {letter}({letter}|{digit})* { yylval.id = strdup(yytext); return IDENT; } {digit}+ { yylval.num = atoi(yytext); return NUMBER; } [ \t\n\r] /* skip whitespace */ . { printf(""Unknown character [%c]\n"",yytext[0]); return UNKNOWN; } %% int yywrap(void){return 1;}" https://github.com/westes/flex https://en.wikipedia.org/wiki/Flex_(lexical_analyser_generator) 78 4 https://hopl.info/showlanguage.prx?exp=2033 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 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 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 mips MIPS architecture 1985 23 isa 0 256 2 24174 true 0 isa false m/Mips.s 1985 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 DEC, 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. 2001 1025 1013 1553 20170 MIPS Technologies && Imagination Technologies s 5145 12 https://exercism.org/tracks/mips 85 https://www.mips.com/products/architectures/mips32-2/ na mips ".data hello_world: .asciiz ""Hello World"" .text main: li $v0, 4 # Load syscommand print_string la $a0, hello_world # Load hello_world string into register $a0 syscall # Print the string jr $ra # Return " https://riju.codes/mips " .text .global main main: li $v0, 5001 li $a0, 1 dla $a1, message li $a2, 14 syscall li $v0, 5058 li $a0, 0 syscall .data message: .string ""Hello, world!\n""" Mips .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 # ### """" true true true true true https://en.wikipedia.org/wiki/MIPS_architecture 0 0 mips engineer semver Semantic Versioning 2011 Tom Preston-Werner 20 schema https://semver.org/ 0 2.0.0 257 1 4 24173 true 0 https://github.com/semver/semver schema 2011 2024 2011 183 689 7126 120 false SemVer semver 2011 2023 155 42 10 1 6528 2009 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). 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). https://github.com/semver 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). markdown json svg yaml true 9237 0 24 1 false 2 true text https://github.com/antlr/grammars-v4/tree/master/semver United States 1.5.12 https://github.com/semver/semver 0 0 semver.org pl-i PL/I 1964 24 pl 1 258 1 24170 185 true 2 cloc pl-i-formac pl false Programming Language One 1964 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 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. 2001 303 341 1138 23708 IBM 1535 0 28 pl1 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 text PL/I /* Read in a line, which contains a string, /* and then print every subsequent line that contains that string. */ find_strings: procedure options (main); declare pattern character (100) varying; declare line character (100) varying; declare line_no fixed binary; on endfile (sysin) stop; get edit (pattern) (L); line_no = 1; do forever; get edit (line) (L); if index(line, pattern) > 0 then put skip list (line_no, line); line_no = line_no + 1; end; end find_strings; /* */ = true true true true true true false true https://en.wikipedia.org/wiki/PL/I 0 0 https://hopl.info/showlanguage.prx?exp=185 PL/I processing Processing 2001 32 pl http://processing.org 0 259 4 24159 true 0 pl 5494 6773 78037 2 "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""" text source.processing programming false p/Processing.pde 33 2006 2015 1 5 2003 2001 java logo opengl postscript c javascript arduino scala clojure lisp max 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. 2004 429 240 517 546083 MIT pde pde pde pde 2366 0 37 https://processing.org/reference text 1486 http://www.rosettacode.org/wiki/Category:Processing United States Processing "// Hello world in Processing println( ""Hello world!"" );" "size(128, 128); background(0); textAlign(CENTER, CENTER); fill(255); text(""Hello World"", width / 2, height / 2); " /** * Shape Primitives. * * The basic shape primitive functions are triangle(), * rect(), quad(), ellipse(), and arc(). Squares are made * with rect() and circles are made with ellipse(). Each * of these functions requires a number of parameters to * determine the shape's position and size. */ void setup() { size(640, 360); background(0); noStroke(); } void draw() { fill(204); triangle(18, 18, 18, 360, 81, 360); fill(102); rect(81, 81, 63, 63); fill(204); quad(189, 18, 216, 18, 216, 360, 144, 360); fill(255); ellipse(252, 144, 72, 72); fill(204); triangle(288, 18, 351, 360, 288, 360); fill(255); arc(479, 300, 280, 280, PI, TWO_PI); } https://twitter.com/processingorg "PShape usa; PShape state; String [] Obama = { ""HI"", ""RI"", ""CT"", ""MA"", ""ME"", ""NH"", ""VT"", ""NY"", ""NJ"", ""FL"", ""NC"", ""OH"", ""IN"", ""IA"", ""CO"", ""NV"", ""PA"", ""DE"", ""MD"", ""MI"", ""WA"", ""CA"", ""OR"", ""IL"", ""MN"", ""WI"", ""DC"", ""NM"", ""VA"" }; String [] McCain = { ""AK"", ""GA"", ""AL"", ""TN"", ""WV"", ""KY"", ""SC"", ""WY"", ""MT"", ""ID"", ""TX"", ""AZ"", ""UT"", ""ND"", ""SD"", ""NE"", ""MS"", ""MO"", ""AR"", ""OK"", ""KS"", ""LA"" }; void setup() { size(950, 600); // The file ""Blank US Map (states only).svg"" can be found at Wikimedia Commons usa = loadShape(""http://upload.wikimedia.org/wikipedia/commons/archive/1/1a/20130330152451!Blank_US_Map_(states_only).svg""); smooth(); // Improves the drawing quality of the SVG noLoop(); } void draw() { background(255); // Draw the full map shape(usa, 0, 0); // Blue denotes states won by Obama statesColoring(Obama , color(0, 0, 255)); // Red denotes states won by McCain statesColoring(McCain, color(255, 0, 0)); // Save the map as image saveFrame(""map output.png""); } void statesColoring(String[] states, int c){ for (int i = 0; i < states.length; ++i) { PShape state = usa.getChild(states[i]); // Disable the colors found in the SVG file state.disableStyle(); // Set our own coloring fill(c); noStroke(); // Draw a single state shape(state, 0, 0); } }" Processing // /* */ """" true true true false true https://en.wikipedia.org/wiki/Processing_(programming_language) 42 31 Processing processing.org Processing https://github.com/textmate/processing.tmbundle 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 Processing 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 sparql SPARQL 2008 33 queryLanguage 0 260 3 24158 true 0 queryLanguage 0 0 text sparql application/sparql-query source.sparql data false s/SparQL.sparql 128 2013 2015 2 2 SPARQL Protocol and RDF Query Language rdf.py https://dbpedia.org/sparql 2008 rdf sql xquery turtle geo-ml "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." 2005 379 480 380 2574343 W3C sparql rq sparql rq sparql typescript http://www.iro.umontreal.ca/~lapalme/ift6281/sparql-1_1-cheat-sheet.pdf 2165 0 83 https://www.w3.org/TR/rdf-sparql-query/ https://docs.stardog.com/tutorials/learn-sparql text https://github.com/antlr/grammars-v4/tree/master/sparql sparql sparql https://www.w3.org/TR/rdf-sparql-query/ "SELECT ?h WHERE { VALUES ?h { ""Hello World"" } } " PREFIX foaf: SELECT ?name ?email WHERE { ?person a foaf:Person. ?person foaf:name ?name. ?person foaf:mbox ?email. } SPARQL PREFIX ex: SELECT ?capital ?country WHERE { ?x ex:cityname ?capital ; ex:isCapitalOf ?y . ?y ex:countryname ?country ; ex:isInContinent ex:Africa . } SparQL https://github.com/stardog-union/stardog-language-servers/tree/master/packages/sparql-language-server 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 # """" true false true true true true true true https://github.com/paulovn/sparql-kernel https://en.wikipedia.org/wiki/SPARQL 4 18 https://github.com/peta/turtle.tmbundle 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 SPARQL 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 diff Diff 1974 17 unixApplication 103 261 2 24155 true 103 abcl-lang ace arrow-format asdf asterius-compiler bazel blender-app bucardo caramel carbon cir claro click cmake codeql comby coq couchdb cperl cryptol dafny dhall eiffel erlang fardlang fennel flatbuffers flow flow9 gforth git groff haste haxe hhvm hobbes homebrew-pm imhex impala java julia kefir kotlin ladybird lfortran lobster mal mastodon menhir mermaid michelson micropython minilang mongodb mps ncl netbeans-editor nit nodejs oil opa opencv openscad paraview perl php please-build pogoscript polyglot-compiler pov-ray-sdl python pytorch quickjs racket rascal reach reason revolution-programming-language roslyn-compiler ruby rust saltstack scipy sile simplictiy slony smpl snowball-programming-language spatial tensorflow terra textadept-editor tiledb tldraw typescript vcpkg-pm vega-editor-app vlc wasmer wing wiredtiger xla yeti unixApplication 477 561 0 udiff diff diff text/x-diff source.diff data false 81 2005 2017 1 10 diff.py 1970 unix grep emacs-editor regex c bourne-shell fortran modula-2 lisp isbn doi "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." 2018 223 257 1 79673 Bell Labs diff patch diff patch true 1385 0 23 edscript patch context-diff unified-diff diff patch text 2959 diff United States diff --git a/lib/linguist.rb b/lib/linguist.rb index d472341..8ad9ffb 100644 --- a/lib/linguist.rb +++ b/lib/linguist.rb Diff --- /path/to/original timestamp +++ /path/to/new timestamp @@ -1,3 +1,9 @@ +This is an important +notice! It should +therefore be located at +the beginning of this +document! + This part of the document has stayed the same from version to @@ -5,16 +11,10 @@ be shown if it doesn't change. Otherwise, that would not be helping to -compress the size of the -changes. - -This paragraph contains -text that is outdated. -It will be deleted in the -near future. +compress anything. It is important to spell -check this dokument. On +check this document. On the other hand, a misspelled word isn't the end of the world. @@ -22,3 +22,7 @@ this paragraph needs to be changed. Things can be added after it. + +This paragraph contains +important new additions +to this document. https://en.wikipedia.org/wiki/Diff_utility 0 0 Diff https://github.com/textmate/diff.tmbundle Diff scala-js Scala.js 2013 Martin Odersky 22 pl https://www.scala-js.org/ 0 v1.16.0 262 2 10 24153 true 0 https://github.com/scala-js/scala-js pl 2013 2024 2013 148 384 4557 50 false 2013 2025 7532 114 2113 33 23335 2013 2004 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 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. 2016 2 843 1 3254510 https://github.com/scala-js scala markdown javascript html xml json css java bourne-shell yaml javascript true 6036 0 34 1 false 1 true text United States and Switzerland "class Person(val firstName: String, val lastName: String) { def fullName(): String = s""$firstName $lastName"" }" https://reddit.com/r/scalajs "val urls = List(""https://scala-lang.org"", ""https://github.com/scala/scala"") def fromURL(url: String) = scala.io.Source.fromURL(url) .getLines().mkString(""\n"") val t = System.currentTimeMillis() urls.par.map(fromURL(_)) println(""time: "" + (System.currentTimeMillis - t) + ""ms"")" https://github.com/scala-js/scala-js println true https://en.wikipedia.org/wiki/Scala.js_(programming_language) 0 3 scala-js.org 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 vyper Vyper 2016 Vitalik Buterin 20 contractLanguage https://vyperlang.org 0 https://blog.vyperlang.org/ v0.3.10 263 1 11 24144 true 0 https://github.com/ethereum/vyper contractLanguage 1 1 117 text source.vyper programming 2016 2024 2016 166 790 4828 436 false 2016 2025 6070 273 557 14 111098 Pythonic language for the EVM. Pythonic language for the EVM. Pythonic language for the EVM. vy python restructuredtext markdown yaml make html dockerfile toml bash svg bourne-shell true 7473 0 32 1 false 0 true vy https://docs.vyperlang.org/en/latest/ https://ethereumclassic.org/blog/2017-03-13-viper # @version >=0.2.4 <0.3.0 DNA_DIGITS: constant(uint256) = 16 DNA_MODULUS: constant(uint256) = 10 ** DNA_DIGITS struct Pokemon: name: String[32] dna: uint256 HP: uint256 matches: uint256 wins: uint256 # Declare totalPokemonCount pokemonList: HashMap[uint256, Pokemon] @internal def _createPokemon(_name: String[32], _dna: uint256, _HP: uint256): # use totalPokemonCount self.pokemonList[0] = Pokemon({ name: _name, dna: _dna, HP: _HP, matches: 0, wins: 0 }) # increment totalPokemonCount by 1 https://discord.com/invite/6tw7PTM7C2 https://x.com/vyperlang https://github.com/ethereum/vyper 0 0 Vyper Vyper flowchart-fun FlowchartFun 2021 Rob Gordon 19 diagramLang https://flowchart.fun/ 0 1.49.3 264 1 11 24142 true 1 workfl https://github.com/tone-row/flowchart-fun diagramLang 2021 2024 2021 35 228 3106 11 false 2021 2025 1626 13 471 29 83175 https://flowchart.fun/ flowchart.fun is a lightweight application to generate flowcharts and diagrams from text. flowchart.fun is a lightweight application to generate flowcharts and diagrams from text. https://github.com/tone-row flowchart.fun is a lightweight application to generate flowcharts and diagrams from text. typescript css svg json javascript yaml markdown html xml csv bourne-shell true 3805 0 31 dot 1 false 1 true Canada Node A goes to: Node B and: Node C goes back to: (Node A) https://discord.com/invite/wPASTQHQBf https://x.com/tone_row_ https://github.com/tone-row/flowchart-fun true 0 0 tornado tornado 2009 Ben Darnell and Brett Taylor 17 template http://www.tornadoweb.org/en/stable/guide/templates.html 0 v6.4.0 265 1 18 24132 true 0 https://github.com/tornadoweb/tornado template 2009 2024 2009 983 5491 21634 211 false 2009 2025 4922 483 311 11 56224 Facebook python restructuredtext html ini bourne-shell yaml css javascript json xml markdown c make cython sql toml dockerfile csv true 38642 0 36 2 false 6 true text tornado {{ title }}
{% for item in items %}
{{ escape(item) }}
{% end %}
https://github.com/tornadoweb/tornado 4 0 year|publisher|title|authors|isbn13\n2009|National Geographic|Tornado Hunter: Getting Inside the Most Violent Storms on Earth|Samaras, Tim and Bechtel, Stefan|9781426203022\n2009|National Geographic|Tornado Hunter: Getting Inside the Most Violent Storms on Earth|Bechtel, Stefan and Samaras, Tim|9781426205804\n20120319|O'Reilly Media, Inc.|Introduction to Tornado|Michael Dory; Allison Parrish; Brendan Berg|9781449333980\n20120319|O'Reilly Media, Inc.|Introduction to Tornado|Michael Dory; Allison Parrish; Brendan Berg|9781449333973 rmarkdown RMarkdown 2014 Joseph J. Allaire 21 textMarkup https://rmarkdown.rstudio.com/ 0 v0.9.6 266 1 13 24129 true 0 https://github.com/rstudio/rmarkdown textMarkup 198 true 0 markdown gfm text/x-gfm source.gfm prose 2014 2024 2014 146 967 2841 259 false 426 2013 2018 1 58 2014 2024 3996 144 502 124 86284 https://github.com/rstudio rmd qmd rmd r css javascript markdown yaml html lua svg tex bourne-shell xml scss csv https://www.rstudio.com/wp-content/uploads/2015/02/rmarkdown-cheatsheet.pdf true 6088 0 35 1 false 0 true text United States # An example RMarkdown Some text. ## A graphic in R ```{r} plot(1:10) hist(rnorm(10000)) ``` https://github.com/rstudio/rmarkdown 2 0 rmarkdown.rstudio.com https://github.com/atom/language-gfm RMarkdown 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 carbon Carbon 2020 Chandler Carruth and Jon Ross-Perkins 17 pl https://docs.carbon-lang.dev 0 267 2 23 24127 true 0 https://github.com/carbon-language/carbon-lang pl 2020 2024 2020 391 1464 32258 112 false 2020 2025 3573 175 5415 50 479615 Google carbon markdown cpp bazel python yaml starlark bourne-shell json svg diff javascript vim-script dockerfile xml protobuf c scheme html yacc lua lex make toml true 36847 0 43 2 false carbon United States https://news.ycombinator.com/item?id=32151609 package Sorting api; fn Partition[T:! Comparable & Movable](s: Slice(T)) -> i64 { var i: i64 = -1; for (e: T in s) { if (e <= s.Last()) { ++i; Swap(&s[i], &e); } } return i; } fn QuickSort[T:! Comparable & Movable](s: Slice(T)) { if (s.Size() <= 1) { return; } let p: i64 = Partition(s); QuickSort(s[:p - 1])); QuickSort(s[p + 1:])); } package sample api; fn Square(x: i32) -> i32 { return x * x; } fn Main() -> i32 { return Square(12); } Carbon https://github.com/carbon-language/carbon-lang https://en.wikipedia.org/wiki/Carbon_(programming_language) 0 0 svelte Svelte 2019 Rich Harris 14 pl https://svelte.dev/ 2 0.0.1 268 1 9 24125 true 2 cloc svelte https://github.com/sveltejs/svelte pl 2016 2024 2016 860 4049 77710 843 false 2016 2025 11163 868 7285 116 216522 2019 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. 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. 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. svelte javascript markdown json css html typescript svg yaml true 90727 0 24 1 true 0 true svelte
Hello {name}!
https://github.com/sveltejs/svelte 0 0 svelte.dev jison Jison 2009 Zachary Carter 21 pl http://zaa.ch/jison/ 0 0.4.18 269 1 12 24124 true 0 https://github.com/zaach/jison pl 0 0 Yacc text source.jison programming 2009 2024 2009 108 448 4338 161 false 131 2014 2018 3 9 2009 2020 709 58 141 3 32701 https://github.com/zaach/jison/issues jison javascript csharp html json css xml ruby markdown yaml php yacc make true 5942 0 35 1 false 0 true https://gerhobbelt.github.io/jison/docs/ text Various /* description: ClassyLang grammar. Very classy. */ /* To build parser: $ ./bin/jison examples/classy.jison examples/classy.jisonlex */ /* author: Zach Carter */ %right ASSIGN %left OR %nonassoc EQUALITY GREATER %left PLUS MINUS %left TIMES %right NOT %left DOT %% pgm : cdl MAIN LBRACE vdl el RBRACE ENDOFFILE ; cdl : c cdl | ; c : CLASS id EXTENDS id LBRACE vdl mdl RBRACE ; vdl : VAR t id SEMICOLON vdl | ; mdl : t id LPAREN t id RPAREN LBRACE vdl el RBRACE mdl | ; t : NATTYPE | id ; id : ID ; el : e SEMICOLON el | e SEMICOLON ; e : NATLITERAL | NUL | id | NEW id | THIS | IF LPAREN e RPAREN LBRACE el RBRACE ELSE LBRACE el RBRACE | FOR LPAREN e SEMICOLON e SEMICOLON e RPAREN LBRACE el RBRACE | READNAT LPAREN RPAREN | PRINTNAT LPAREN e RPAREN | e PLUS e | e MINUS e | e TIMES e | e EQUALITY e | e GREATER e | NOT e | e OR e | e DOT id | id ASSIGN e | e DOT id ASSIGN e | id LPAREN e RPAREN | e DOT id LPAREN e RPAREN | LPAREN e RPAREN ; https://github.com/zaach/jison /* */ true true false 0 0 https://github.com/cdibbs/language-jison Jison moonbit MoonBit 2022 Hongbo Zhang 37 pl https://www.moonbitlang.cn 1 270 1 6 24124 true 1 moonbit https://github.com/moonbitlang/core pl 2024 2024 14 78 616 76 false 2024 2025 2395 90 500 6 92511 https://try.moonbitlang.com Intelligent developer platform for Cloud and Edge using WASM. Intelligent developer platform for Cloud and Edge using WASM. International Digital Economy Academy Intelligent developer platform for Cloud and Edge using WASM. mbt moonbit json markdown yaml toml bourne-shell true 942 0 46 rust go 1 true https://docs.moonbitlang.com/ China fn main { println(@lib.hello()) } http://www.youtube.com/@MoonBit_lang https://discord.gg/CVFRavvRav https://x.com/moonbitlang https://github.com/moonbitlang/core true true true true true true true true true true true true true true true true true 0 0 ampl AMPL 1985 Robert Fourer and David Gay and Brian Kernighan 37 pl https://ampl.com/ 0 271 3 24123 7232 true 3 mpl mps-format rason pl 806 852 5570 0 text source.ampl programming false 12 2013 2013 2 2 A Mathematical Programming Language ampl.py 1995 1985 linux unix awk c algebraic-modeling-language nl xml excel-app 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. 2004 109 133 237 1076270 AMPL Optimization LLC ampl mod run mod dat run false 766 3 41 3 https://ampl.com/learn/docs/ https://ampl.com/about/upcoming-events/ https://ampl.com/learn/docs/faqs/ text http://www.rosettacode.org/wiki/Category:AMPL United States set PROD; # products param rate {PROD} > 0; # tons produced per hour param avail >= 0; # hours available in week param profit {PROD}; # profit per ton param market {PROD} >= 0; # limit on tons sold in week var Make {p in PROD} >= 0, <= market[p]; # tons produced maximize Total_Profit: sum {p in PROD} profit[p] * Make[p]; # Objective: total profits from all products subject to Time: sum {p in PROD} (1/rate[p]) * Make[p] <= avail; # Constraint: total of hours used by all # products may not exceed hours available # A toy knapsack problem from the LocalSolver docs written in AMPL. set I; param Value{I}; param Weight{I}; param KnapsackBound; var Take{I} binary; maximize TotalValue: sum{i in I} Take[i] * Value[i]; s.t. WeightLimit: sum{i in I} Take[i] * Weight[i] <= KnapsackBound; data; param: I: Weight Value := 0 10 1 1 60 10 2 30 15 3 40 40 4 30 60 5 20 90 6 20 100 7 2 15; param KnapsackBound := 102; Ampl https://twitter.com/amplopt set Plants; set Markets; # Capacity of plant p in cases param Capacity{p in Plants}; # Demand at market m in cases param Demand{m in Markets}; # Distance in thousands of miles param Distance{Plants, Markets}; # Freight in dollars per case per thousand miles param Freight; # Transport cost in thousands of dollars per case param TransportCost{p in Plants, m in Markets} := Freight * Distance[p, m] / 1000; # Shipment quantities in cases var shipment{Plants, Markets} >= 0; # Total transportation costs in thousands of dollars minimize cost: sum{p in Plants, m in Markets} TransportCost[p, m] * shipment[p, m]; # Observe supply limit at plant p s.t. supply{p in Plants}: sum{m in Markets} shipment[p, m] <= Capacity[p]; # Satisfy demand at market m s.t. demand{m in Markets}: sum{p in Plants} shipment[p, m] >= Demand[m]; data; set Plants := seattle san-diego; set Markets := new-york chicago topeka; param Capacity := seattle 350 san-diego 600; param Demand := new-york 325 chicago 300 topeka 275; param Distance : new-york chicago topeka := seattle 2.5 1.7 1.8 san-diego 2.5 1.8 1.4; param Freight := 90; # := true true true true true true false https://en.wikipedia.org/wiki/AMPL 8 2 https://hopl.info/showlanguage.prx?exp=7232 ampl.com AMPL https://github.com/ampl/sublime-ampl 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 AMPL ampl developer 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 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 gravity gravity 2017 22 pl http://gravity-lang.org/ 0 0.8.5 272 1 11 24119 true 0 https://github.com/marcobambini/gravity pl 2017 2024 2017 113 228 4290 44 false g/Gravity.gravity 2017 2024 776 52 1195 3 310440 https://github.com/marcobambini/gravity/issues gravity markdown c xml cmake objective-c make css yaml cpp html bourne-shell true 5028 0 35 false 0 true text 7797 Various "func main() { System.print(""Hello World""); } " Gravity https://github.com/marcobambini/gravity System.print """" true true 1 6 gravity-lang.org year|publisher|title|authors|isbn13\n2009|The Aasgaard Company|Mean Ol' Mr. Gravity|Mark Rippetoe|9780982522714 year|title|doi|citations|influentialCitations|authors|paperId\n2019|Differentiable strong lensing: uniting gravity and neural nets through differentiable probabilistic programming|10.1093/MNRAS/STAA1477|16|0|M. Chianese and A. Coogan and Paul Hofma and S. Otten and C. Weniger|266df117374910b73f520bc93f3074634e788668\n2011|Optimization of the orbit parameters of future gravity missions using genetic algorithms|10.18419/OPUS-3873|7|0|M. Ellmer|e7f2cfa8fd8726d360b8127bf3e3731dd6d7aa6d\n2014|Design and Modal Analysis of Gravity Dams by Ansys Parametric Design Language|10.2004/WJST.V11I12.866|7|2|S. Khosravi and M. Heydari|9741464b7e783280fbf878e91627352c6ad1dc0a\n2007|Development of a software package for visualization of three-dimensional mass distributions and forward gravity modelling|10.1088/1742-2132/4/1/005|3|0|J. Fellner|42227640eae5adbf442ff93ce1066b73ec7ffac4\n2019|LTide - Matlab/Octave software tool for temporal and spatial analysis of tidal gravity acceleration effects according to Longman formulas|10.1007/s12145-019-00379-y|2|0|Olga Bjelotomić Oršulić and M. Varga and Danko Markovinović and Tomislav Bašić|7b1c271be809837db6a65450fc136ea5d178f16f\n2019|Mathematical modeling of free convection problems in a gravity field in OpenFOAM|10.1088/1742-6596/1205/1/012026|1|0|V. Kozlov and M. Chmykhov|3934ff2c416853c5be327da7f79d76a733eb2ea3 unison unison 2015 20 pl http://unisonweb.org/ 0 273 2 16 24116 true 0 https://github.com/unisonweb/unison pl 2015 2024 2013 110 265 5688 1077 false 2013 2025 18590 151 1620 141 239631 2014 haskell markdown yaml racket sql bourne-shell scheme nix vim-script bash cson json html xml dockerfile dhall true 6636 0 https://exercism.org/tracks/unison 37 false https://www.youtube.com/watch?v=rp_Eild1aq8 -- comments start with `--` -- alice : Node, bob : Node x = factorial 6 Remote.transfer alice y = foo x -- happens on `alice` node Remote.transfer bob bar x y -- happens on `bob` node https://riju.codes/unison "use io runProg: '{IO, Exception} a -> '{IO} () runProg f = 'let printErr err = match err with Failure _ errMsg _ -> handle putBytes (stdHandle StdErr) (toUtf8 errMsg) with cases {raise _ -> _} -> () {_} -> () match catch f with Left err -> printErr err Right _ -> () main: '{IO} () main = runProg 'let printLine ""Hello, world!"" " https://twitter.com/unisonweb https://github.com/unisonweb/unison -- true true false 0 0 unisonweb.org taichi Taichi 2019 Yuanming Hu 17 pl https://taichi-lang.org/ 0 v1.7.1 274 1 16 24112 true 0 https://github.com/taichi-dev/taichi pl 2016 2024 2016 389 2260 25152 812 false 2016 2025 11536 288 1564 62 320194 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. 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. 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. python cpp markdown cmake json glsl yaml cuda bourne-shell objective-cpp powershell toml c jupyter-notebook make ini true 32222 0 34 1 false 1 true http://taichi.graphics/wp-content/uploads/2019/09/taichi_lang.pdf // For CPU Parallelize(int num_threads) // Multi-threading Vectorize(int width) // Loop vectorization // For GPU BlockDim(int blockDim) // Specify GPU block size // For scratchpad optimization AssumeInRange(Expr base, int lower, int upper) Cache(Expr) // Cache data into GPU L1 cache CacheL1(Expr) More discussions on h https://github.com/taichi-dev/taichi // true true false 0 0 uml UML 1996 16 xmlFormat 0 275 1 24110 7130 true 1 xuml xmlFormat false Unified Modeling Language 1994 bpmn sysml The Unified Modeling Language (UML) is a general-purpose, developmental, modeling language in the field of software engineering, that is intended to provide a standard way to visualize the design of a system. UML was originally motivated by the desire to standardize the disparate notational systems and approaches to software design developed by Grady Booch, Ivar Jacobson and James Rumbaugh at Rational Software in 1994–1995, with further development led by them through 1996. In 1997 UML was adopted as a standard by the Object Management Group (OMG), and has been managed by this organization ever since. In 2005 UML was also published by the International Organization for Standardization (ISO) as an approved ISO standard. Since then the standard has been periodically revised to cover the latest revision of UML. 2001 2203 1661 3050 32169 11035 0 18 true https://www.uml-diagrams.org/ text " ananas.org stylesheet " true false true https://en.wikipedia.org/wiki/Unified_Modeling_Language 112 38 https://hopl.info/showlanguage.prx?exp=7130 year|publisher|title|authors|isbn13\n2006|O'Reilly Media|Learning UML 2.0: A Pragmatic Introduction to UML|Miles, Russ and Hamilton, Kim|9780596009823\n2002|Addison-Wesley Professional|Visual Modeling with Rational Rose 2002 and UML (3rd Edition)|Quatrani, Terry|9780201729320\n2004|Cambridge University Press|UML by Example (Sigs: Advances in Object Technology S)|Jalloul, Ghinwa|9780521008815\n2008|Routledge|Practical UML Statecharts in C/C++|Samek, Miro|9780750687065\n2005|O'Reilly Media|UML 2.0 in a Nutshell: A Desktop Quick Reference (In a Nutshell (O'Reilly))|Pilone, Dan and Pitman, Neil|9780596007959\n1999|Addison-Wesley Professional|Fundamentals of Object-Oriented Design in UML|Page-Jones, Meilir|9780201699463\n2005|McGraw Hill|UML Demystified|Kimmel, Paul|9780072261820\n2001|Cambridge University Press|The Object Primer: The Application Developer's Guide to Object Orientation and the UML|Ambler, Scott W.|9780521785198\n2004|Addison-Wesley Professional|Real Time UML: Advances in the UML for Real-Time Systems|Douglass, Bruce|9780321160768\n2000|New Riders Pub|A Uml Pattern Language (The Mtp Software Engineering Series)|Evitts, Paul|9781578701186\n2013|Apress|Use Case Driven Object Modeling with UML: Theory and Practice (Expert's Voice in UML Modeling)|Rosenberg, Don and Stephens, Matt|9781430243052\n1997|Prentice Hall|UML and C++: A Practical Guide to Object-Oriented Development|Lee, Richard C. and Tepfenhart, William M.|9780136197195\n2002|Wiley|Java the UML Way: Integrating Object-Oriented Design and Programming|Lervik, Else and Havdal, Vegard B.|9780470843864\n1998|Wiley|Object-Oriented Project Management with UML|Cantor, Murray|9780471253037\n2008|Pearson Technology Group|Developing Applications with Visual Basic and UML|Reed Jr., Paul R.|9780201615791\n2013|Morgan Kaufmann|Modeling and Analysis of Real-Time and Embedded Systems with UML and MARTE: Developing Cyber-Physical Systems (The MK/OMG Press)|Selic, Bran and Gerard, Sebastien|9780124166196\n2007|Springer|Real-Time Object Uniform Design Methodology with UML|Bui Minh Duc|9781402059766\n2003|Morgan Kaufmann|Design Methods for Reactive Systems: Yourdon, Statemate, and the UML (The Morgan Kaufmann Series in Software Engineering and Programming)|Wieringa, R. J.|9781558607552\n2005|Springer|Software Engineering Techniques Applied to Agricultural Systems: An Object-Oriented and UML Approach (Applied Optimization)|Papajorgji, Petraq and Pardalos, Panos|9780387281704\n2006|Ibm Press|Visual Modeling with IBM Rational Software Architect and UML|Quatrani, Terry|9780321238085\n1999|Apress|VB6 UML Design and Development|Sturm, Jake|9781861002518\n2004|Springer|Component-Based Software Testing with UML|Gross, Hans-Gerhard|9783540208648\n2002|Prentice Hall|Practical Object-Oriented Development with UML and Java|Lee, Richard C. and Tepfenhart, William M.|9780130672384\n2004|Cambridge University Press|Model Driven Architecture with Executable UML|Raistrick, Chris and Francis, Paul and Wright, John and Carter, Colin and Wilkie, Ian|9780521537711\n2000|Prentice Hall|UML and C++: A Practical Guide to Object-Oriented Development (2nd Edition)|Lee, Richard C. and Tepfenhart, William M.|9780130290403\n2001|Wiley|An Introduction to Object-Oriented Analysis: Objects and UML in Plain English|Brown, David William|9780471371373\n20070508|Springer Nature|UML for Real|Luciano Lavagno; Grant Martin; Bran V. Selic|9780306487385\n20130730|Springer Nature|Grundkurs Software-Engineering mit UML|Stephan Kleuker|9783658006426\n20111121|Pearson Education (US)|Object-Oriented Modeling and Design with UML|James R Rumbaugh; Michael R. Blaha|9780133002171\n2003|Addison-Wesley Professional|UML Distilled: A Brief Guide to the Standard Object Modeling Language|Fowler, Martin|9780321193681\n2020|Wiley|Systems Analysis and Design: An Object-Oriented Approach with UML|Dennis, Alan and Wixom, Barbara and Tegarden, David|9781119559917\n2012|Wiley|Systems Analysis and Design with UML|Dennis, Alan and Wixom, Barbara Haley and Tegarden, David|9781118037423\n2018|Addison-Wesley Professional|UML Distilled: A Brief Guide to the Standard Object Modeling Language (Addison-Wesley Object Technology Series)|Fowler, Martin|9780134865126\n2006|O'Reilly Media|UML 2.0 Pocket Reference: UML Syntax and Usage (Pocket Reference (O'Reilly))|Pilone, Dan|9780596102081\n2008|CRC Press|Practical UML Statecharts in C/C++: Event-Driven Programming for Embedded Systems|Samek, Miro|9781138436381\n2005|Packt Publishing|UML 2.0 in Action: A project-based tutorial|Baumann, Henriette and Grassle, Patrick and Baumann, Philippe|9781847190420\n2015|Springer|UML @ Classroom: An Introduction to Object-Oriented Modeling (Undergraduate Topics in Computer Science)|Seidl, Martina and Scholz, Marion and Huemer, Christian and Kappel, Gerti|9783319127415\n2005|McGraw-Hill Education|UML Demystified|Kimmel, Paul|9780071486712\n2010|S Chand|Learn Object Oriented Programming Using Java: An UML based|Venkateswarlu N.B. & Prasad E.V.|9788121935463\n2002|AddisonWesley Professional|Building Web Applications with UML|Paul Becker and Conallen, Jim|9780201730388\n1999|Addison-Wesley Pub (Sd)|UML Distilled: A Brief Guide to the Standard Object Modeling Language (2nd Edition)|Fowler, Martin and Scott, Kendall|9780201657838\n2005|Packt Publishing|UML 2.0 in Action: A project-based tutorial: A detailed and practical walk-through showing how to apply UML to real world development projects|Patrick Graessle and Henriette Baumann and Philippe Baumann|9781904811558\n2004|Sams|Sams Teach Yourself Uml in 24 Hours: Complete Starter Kit|Schmuller, Joseph|9780672326400\n2018|Independently published|UML and Object-Oriented Design Foundations: Understanding Object-Oriented Programming and the Unified Modeling Language (Professional Skills)|Nyisztor, Karoly|9781980818496\n2005|Addison-Wesley Professional|UML 2 and the Unified Process: Practical Object-Oriented Analysis and Design|Arlow, Jim and Neustadt, Ila|9780132702638\n2003|Addison-Wesley Professional|Enterprise Patterns and MDA: Building Better Software with Archetype Patterns and UML|Arlow, Jim|9780321112309\n2001|McGraw-Hill/Spanish Imports|Schaum's Outline of UML|Bennett, Simon and Skelton, John|9780077096731\n2005|Wiley|Object-Oriented Analysis and Design: Understanding System Development with UML 2.0|O'Docherty, Mike|9780470092408\n1997|Prentice Hall|Object-Oriented Methods: A Foundation, UML Edition (2nd Edition)|Martin, James and Odell, James J.|9780139055973\n2006|Morgan Kaufmann|UML 2 Certification Guide: Fundamental and Intermediate Exams (The MK/OMG Press)|Weilkiens, Tim and Oestereich, Bernd|9780123735850\n2002|Wiley|UML Weekend Crash Course|Pender, Tom|9780764549106\n2004|Butterworth-Heinemann|Object-Oriented Design with UML and Java|Barclay, Kenneth and Savage, John|9780750660983\n2003|O'Reilly Media|UML Pocket Reference|Pilone, Dan|9780596004972\n2005|Springer|Component-Based Software Testing with UML|Gross, Hans-Gerhard|9783540267331\n2004|Pearson|Object-Oriented Systems Analysis and Design With UML|Stumpf, Robert and Teague, Lavette|9780131434066\n2001|Addison-Wesley Professional|UML Explained|Scott, Kendall|9780201721829\n2002|Wiley|Mastering XMI: Java Programming with XMI, XML, and UML (With CD-ROM)|Timothy J. Grose and Gary C. Doney and Stephen A. Brodsky|9780471384298\n2004|Apress|Fast Track UML 2.0|Scott, Kendall and Apress|9781590593202\n1998|Cambridge University Press|Advanced Object-Oriented Analysis & Design Using UML (SIGS Reference Library)|Odell, James J.|9780521648196\n1999|Sybex|Mastering UML with Rational Rose|Boggs, Wendy and Boggs, Michael|9780782124538\n1997|Apress|Instant Uml|Muller, Pierre-Alain|9781861000873\n2003-10-01T00:00:01Z|Cengage Learning Emea|Visual Basic .Net: A Complete Object-Oriented Programming Course Including Unified Modelling Language Uml|Jones, Phil|9781844800988\n2005|Butterworth-Heinemann|Advanced Systems Design with Java, UML and MDA|Lano, Kevin|9780750664967\n1999|Addison-Wesley Professional|Visual Modeling with Rational Rose 2000 and UML (2nd Edition) (Addison Wesley Object Technology Series)|Quatrani, Terry|9780201699616\n1999|McGraw-Hill College|Classical and Object-Oriented Software Engineering With Uml and Java|Schach, Stephen R.|9780072302264\n2006|IGI Global|Enterprise Modeling and Computing With UML|Peter Rittgen|9781599041742\n2010|Springer|UML for SOC Design||9781441938299\n2003|Springer|UML for Real: Design of Embedded Real-Time Systems||9781402075018\n2014|Springer|Software Engineering Techniques Applied to Agricultural Systems: An Object-Oriented and UML Approach (Springer Optimization and Its Applications (93))|Papajorgji, Petraq J. and Pardalos, Panos M.|9781489974624\n2000|Springer|UML 2000 - The Unified Modeling Language: Advancing the Standard: Third International Conference York, UK, October 2-6, 2000 Proceedings (Lecture Notes in Computer Science, 1939)||9783540411338\n|eyrolle|Modelis objet avec uml|pierre-alain muller|9782212089660\n2016|LAP LAMBERT Academic Publishing|Domain Driven Software Architecture Systems: Modeling and Design through UML|Ansari, Gufran Ahmed|9783659950742\n2004|De Gruyter Mouton|Cognitive Modeling and Verbal Semantics: A Representational Framework Based on UML (Trends in Linguistics. Studies and Monographs [Tilsm])|Schalley, Andrea C.|9783110179514\n2014|Springer|Software Engineering Techniques Applied to Agricultural Systems: An Object-Oriented and UML Approach (Springer Optimization and Its Applications Book 93)|Papajorgji, Petraq J. and Pardalos, Panos M.|9781489974631\n2003|Prentice Hall|Applying UML and Patterns:An Introduction to Object-Oriented Analysis and Design and the Unified Process with Extreme Programming Explained:Embrace Change|Larman, Craig and Beck, Kent|9780582832480\n2003|Butterworth-heinemann|Applying Uml|Rob Pooley and Pauline Wilcox|9780080527505\n20220512|Taylor & Francis|UML Diagramming|Suriya Sundaramoorthy|9781000587272\n2000|Pearson Education|Uml Distilled|Martin Fowler|9788178082486\n20150221|Springer Nature|UML @ Classroom|Martina Seidl; Marion Scholz; Christian Huemer; Gerti Kappel|9783319127422\nMay 2006|Anaya Multimedia-Anaya Interactiva|UML 2|Ila Neustadt and Jim Arlow|9788441520332\n2002|Springer|Essential Uml Fast|Aladdin Ayesh|9781852334130\n2003|Springer Verlag|UML for Real: Design of Embedded Real-Time Systems|Lavagno and Luciano and Martin and Grant and Selic and Bran V.|9781441953681\n20060425|O'Reilly Media, Inc.|Learning UML 2.0|Russ Miles; Kim Hamilton|9780596519117\n20060425|O'Reilly Media, Inc.|Learning UML 2.0|Russ Miles; Kim Hamilton|9780596555221\n20030629|Springer Nature|SDL 2001: Meeting UML|Rick Reed; Jeanne Reed|9783540482130\n20060314|O'Reilly Media, Inc.|UML 2.0 Pocket Reference|Dan Pilone|9780596529086\n20060314|O'Reilly Media, Inc.|UML 2.0 Pocket Reference|Dan Pilone|9781491947562\n2008|Eyrolles|Uml 2 Par La Pratique|Pascal Roques|9782212851984\n20180104|Springer Nature|Grundkurs Software-Engineering mit UML|Stephan Kleuker|9783658199692\n20050620|O'Reilly Media, Inc.|UML 2.0 in a Nutshell|Dan Pilone; Neil Pitman|9780596552312\n20060502|Springer Nature|Guide to Applying the UML|Sinan Si Alhir|9780387215136\n20050620|O'Reilly Media, Inc.|UML 2.0 in a Nutshell|Dan Pilone|9780596518295\n2004|Springer-Verlag New York, LLC|Component-based Software Testing With Uml|Hans-Gerhard Gross|9783642058820\n20081003|Taylor & Francis|Practical UML Statecharts in C/C|Miro Samek|9781482249262\n1999|Republic Of Texas Pr|Iterative Uml Development Using Visual C++ 6.0|Patrick Sheridan; Jean M. Sekula|9781556227028\n20140207|McGraw-Hill India|Object Oriented Analysis and Design Using UML|D Jeya Mala; S Geetha|9789332900950\n2020|Emereo|UML Tool A Complete Guide - 2020 Edition|Gerardus Blokdyk|9781867456551\n|Springer International Publishing :|Uml @ Classroom: An Introduction To Object-oriented Modeling|Seidl, Martina (author.)|9783319127415\n20100416|McGraw-Hill UK|Object-Oriented Systems Analysis and Design Using UML|BENNETT|9780077139711\n2016-09-22|LAP LAMBERT Academic Publishing|The Role of UML in OOP towards Software Development|Ignatius Ogbaga|9783659957697\n1998|McGraw-Hill Companies, The|Classical and Object-Oriented Software Engineering W/ Uml and C++|Stephen R. Schach and Steven R. Schach|9780072901689\n20031002|Springer Nature|UML 2003 -- The Unified Modeling Language, Modeling Languages and Applications|Perdita Stevens; ‎Jon Whittle; ‎Grady Booch|9783540452218\n2005-05-13|Wiley Global Education UK|Object-Oriented Analysis and Design: Understanding System Development with UML 2.0|Mike O'Docherty|9781118782422\n20030802|Springer Nature|UML 2002 - The Unified Modeling Language: Model Engineering, Concepts, and Tools|JeanMarc Jézéquel; Stephen Cook; Heinrich Hussmann|9783540458005\n20030630|Springer Nature|UML 2001 - The Unified Modeling Language. Modeling Languages, Concepts, and Tools|Martin Gogolla; ‎Cris Kobryn|9783540454410\n01/2021|Pearson Italia S.p.A.|Applicare UML e i pattern: Analisi e progettazione orientata agli oggetti|Craig Larman|9788891924193\n2010|Springer-Verlag New York, LLC|Software Engineering Techniques Applied to Agricultural Systems: An Object-Oriented and UML Approach|Papajorgji and Petraq J. and Pardalos and Panos M.|9781441939265\n12/2013|Elsevier S & T|Modeling and Analysis of Real-Time and Embedded Systems with UML and MARTE: Developing Cyber-Physical Systems|Selic, Bran; Gérard, Sébastien|9780124166561 year|title|doi|citations|influentialCitations|authors|paperId\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\n2013|Initiating a Benchmark for UML and OCL Analysis Tools|10.1007/978-3-642-38916-0_7|26|8|Martin Gogolla and Fabian Büttner and Jordi Cabot|3985616774895434adfc2d49697d2489957f04d0\n2010|Computing product configurations via UML and integer linear programming|10.1504/IJMASSC.2010.037650|22|3|Andreas A. Falkner and Ingo Feinerer and G. Salzer and Gottfried Schenner|98d9fc2f207f0f12590c29de2d3d6289fc1bc0a2\n2009|Using a fUML Action Language to Construct UML Models|10.1109/SYNASC.2009.49|21|0|Codrut-Lucian Lazar and I. Lazar and B. Pârv and S. Motogna and I. Czibula|f5185e27d11904d88fd52e882068bdcfc0cdd0b4\n2012|Testing for concurrency in UML diagrams|10.1145/2347696.2347712|20|4|M. Shirole and Rajeev Kumar|2c73c213540bd0e834638ad97240461b611d6f52\n2012|Automated PLC Software Testing using adapted UML Sequence Diagrams|10.3182/20120523-3-RO-2023.00148|20|0|Benjamin Kormann and Dmitry Tikhonov and B. Vogel‐Heuser|ac2d76ebaeb0667c589f0141e744fbb7220decb1\n2000|Graphical Programming Using UML and SDL|10.1109/2.889090|19|1|M. Björkander|046831bad52c573c68c32b3aec351e0916f6322f\n2002|Case study: implementing a web based auction system using UML and component-based programming|10.1109/CMPSAC.2002.1044554|17|0|F. Sheldon and Kshamta Jerath and Young-Jik Kwon and Young-Wook Baik|a21b9a721907a5e8564320738545b95a7e9b31f2\n2007|OCL4X: An Action Semantics Language for UML Model Execution|10.1109/COMPSAC.2007.158|14|0|Ke Jiang and Lei Zhang and S. Miyake|c65dab293f3d8f49b59642d49065d644a7491b98\n2019|Automatic Code Generation From UML State Chart Diagrams|10.1109/ACCESS.2018.2890791|13|0|S. E. V. and P. Samuel|92101096bdb4895fd8edb871f44d5626d8df5435\n2016|Empirically evaluating OCL and Java for specifying constraints on UML models|10.1007/s10270-014-0438-9|12|2|T. Yue and Shaukat Ali|eda014e24f753702fcb4d04a03a207e89a97047f\n2015|SysML and UML models usage in Knowledge Based MDA process|10.5755/J01.EEE.21.2.5629|12|0|R. Butleris and Audrius Lopata and Martas Ambraziunas and Ilona Veitaite and S. Masteika|6f8b3ecbe871892733c20dc6f2d783c971d411ec\n2003|A new tools for human resource management in e-business: combining UML language, reference architectures and Web programming|10.1109/INDIN.2003.1300265|12|2|M. Cioca and S. Buraga|76fbc93029f4eeca0a36bdba11845c4ab2960726\n2014|UML with meaning: executable modeling in foundational UML and the Alf action language|10.1145/2663171.2663187|12|2|E. Seidewitz|8ff2093585b56adc12065b4f7241b314e99ed339\n2009|Modeling Aspect-Oriented Programming with UML Profile|10.1109/ETCS.2009.314|11|1|Jingjun Zhang and Yuejuan Chen and Guangyuan Liu|88f5b26a8006db3098d63309c52e555e7258a5e8\n2008|OCL as the Query Language for UML Model Execution|10.1007/978-3-540-69389-5_36|10|0|P. Habela and Krzysztof Kaczmarski and Krzysztof Stencel and K. Subieta|c47b03d9ee363e852142b927932421897589716f\n2007|An Executable UML with OCL-based Action Semantics Language|10.1109/APSEC.2007.21|9|0|Ke Jiang and Lei Zhang and S. Miyake|3323610f7e4b3be24bda5475bffd667354e5ab96\n2014|Investigation and evaluation of UML Action Languages|10.5220/0004699902640273|8|0|O. Badreddin and T. Lethbridge and Andrew Forward|0fb478dfd06f85035f884d368b5e938bc7466e0d\n2000|Graphical programming using UML and SDL|10.1109/2.889090|8|0|M. Bjorkander|cab61fd0727b94564d7f263ca98b149d7bfc96db\n2018|Augmented halal food traceability system: analysis and design using UML|10.1088/1757-899X/337/1/012050|7|0|Y. V. Usman and A. Fauzi and T. Irawadi and T. Djatna|b48acd02055d3917edbfad05c274e4dee07aa511\n2016|On the automated translational execution of the action language for foundational UML|10.1007/s10270-016-0556-7|7|1|Federico Ciccozzi|2ba136bd935e0cb1cedc6605f8828e8466885ee1\n2017|Cognitive Behaviors Modeling Using UML Profile: Design and Experience|10.1109/ACCESS.2017.2760060|6|0|Zhi Zhu and Yonglin Lei and Yifan Zhu and H. Sarjoughian|d33808dc57450bf30ff34a25670bd51c57671ab9\n2014|Tool independent code generation for the UML closing the gap between proprietary models and the standardized UML model|10.5220/0004870701170125|5|0|Arne Noyer and Padma Iyenghar and E. Pulvermüller and Florian Pramme and Joachim Engelhardt and Benjamin Samson and G. Bikker|f76605af8053547ff2b2e0a79b3e023998c4d47c\n2008|Reason on UML Diagrams with Answer Set Programming|10.1109/CSSE.2008.1091|5|0|Wenjun Deng and Yiwen Liang|06d54f5f6c5ae56d634169ab4ec5ab81183e2447\n2017|Similarity Assessment of UML Sequence Diagrams Using Dynamic Programming|10.1007/978-3-319-70010-6_25|5|1|Alhassan Adamu and W. Zainon|b7bbc1c9dc9cde03067e357ed2d9163657ffbcf9\n2013|Web Service Composition: From UML to Optimization|10.1109/ICSSI.2013.35|4|0|Ching-seh Wu and Ibrahim Khoury|7311d80a235d0e31a374d04e71e002c18c923550\n2017|Synchronized UML diagrams for object-oriented program comprehension|10.1109/ICCSE.2017.8085455|4|0|Jeong Yang and Young Lee and Deep Gandhi and Sruthi Ganesan Valli|4e0bb18695bf99c07817b67b6c708bc70f623664\n2020|Using UML for Learning How to Design and Model Cyber-Physical Systems|10.1109/RITA.2020.2978416|4|1|L. Ordínez and Gabriel M. Eggly and Matías Micheletto and R. Santos|7175df53be4d2dd327fd4fe354f08f66b577ca6e\n2014|Using Model Checking Approach for Grading the Semantics of UML Models|10.15242/iie.e0114567|3|0|Hazim S. AlRawashdeh and S. Idris and A. Zin|51911c10c0b83b4956e52c8a0c64685860d7df72\n2014|The Method of D-Case Development Using HAZOP Analysis on UML Models|10.1007/978-3-319-11854-3_54|3|0|Feng Ding and Shuichiro Yamamoto and Nda Abrahim|3ab46a9430f536e5042a721847bec2d6a41e01a3\n2018|Modeling multi software product lines using UML|10.1145/3233027.3236400|3|0|M. R. Setyautami and Daya Adianto and A. Azurat|3d1e6b5a38e29d45c12697e45c1882a3b24b16a7\n2020|Ontology-based transformation and verification of uml class model|10.34028/iajit/17/5/9|3|0|Abdul Hafeez Khan and Syed Abbas and A. Rehman|405e8d653e10d7f07f4f45b9f94637e0cf1c71d2\n2016|Automatic model translation to UML from software product lines model using UML profile|10.1109/ICACSIS.2016.7872758|2|0|R. Muhammad and M. R. Setyautami|6f021d6632214ae7d93bbaa76492e75b8c833cbd\n2016|A controlled experiment for evaluating the comprehensibility of UML Action Languages|10.5220/0005657700520064|2|0|O. Badreddin and M. Elaasar and A. Hamou-Lhadj|cac68cf50c5acbfa8a8e8c02740481c581b5f29c\n2001|Should UML be used for declarative programming?|10.1145/773184.773185|2|0|David A. Schmidt|19220959373738444b208da91f193b94e82cfc4a\n2018|AUTOMATIC CODE GENERATION FROM UML DIAGRAMS: THE STATE-OF-THE-ART|10.4314/SWJ.V13I4|2|0|M. I. Mukhtar and B. Galadanci|bffa2d1fd67d91d5610e085f0211498da637f5d6\n2011|Metamodel and UML Profile for Functional Programming Languages|10.1007/978-3-642-21393-9_18|2|0|Marcin Szlenk|6c83038f3418ed1114e3a01e28f57ecf1f6df2e1\n2021|Ontology-Based Verification of UML Class Model XOR Constraint and Dependency Relationship Constraints|10.32604/IASC.2021.015071|2|0|Asadullah Shaikh and A. Hafeez and M. Elmagzoub and Abdullah Alghamdi and Ansar Siddique and B. Shahzad|5c4b9aea7527c7853be387826b1f966337ffa283 title|year|author|goodreadsId|rating|ratings|reviews\nUML Distilled: A Brief Guide to the Standard Object Modeling Language|1997|Martin Fowler|82025|3.78|1229|60\nUML for Java Programmers|2003|Robert C. Martin|858735|3.63|35|1\nMenggunakan UML, Unified Modeling Language|2011|Prabowo Pudjo Widodo|21554454|4.03|110|8\nUML 2 for Dummies|2003|Michael Jesse Chonoles|225827|3.58|52|4 marko Marko 2014 18 textMarkup https://markojs.com/ 0 v5.20.9 276 1 9 24109 true 0 https://github.com/marko-js/marko textMarkup 12 12 101 0 markojs text htmlmixed text/html text.marko markup 2014 2024 2014 211 641 13293 57 false 40 2016 2018 3 5 2014 2025 6397 173 8146 40 216160 2015 https://github.com/marko-js marko javascript markdown html typescript json svg xml yaml css true 15591 0 27 false 5 true text United States $ var name = 'Frank'; $ var colors = ['red', 'green', 'blue'];
Hello ${name}!

${color}

No colors!
https://github.com/marko-js/marko 0 0 markojs.com Marko https://github.com/marko-js/marko-tmbundle Marko vba VBA 1993 22 pl 0 277 0 24103 true 0 pl 194 200 28503 vb6 or visual basic 6 or visual basic for applications text vb text/x-vb source.vbnet programming false Visual Basic for Applications 1993 quickbasic visual-basic excel-app autocad-app basic microsoft-basic visual-basic.net vbscript jscript csharp visual-studio-editor Visual Basic for Applications (VBA) is an implementation of Microsoft's event-driven programming language Visual Basic 6, which was discontinued in 2008, and its associated integrated development environment (IDE). Although Visual Basic is no longer supported or updated by Microsoft, VBA itself got upgraded in 2010 with the introduction of Visual Basic for Applications 7 in Microsoft Office applications. Visual Basic for Applications enables building user-defined functions (UDFs), automating processes and accessing Windows API and other low-level functionality through dynamic-link libraries (DLLs). It supersedes and expands on the abilities of earlier application-specific macro programming languages such as Word's WordBasic. It can be used to control many aspects of the host application, including manipulating user interface features, such as menus and toolbars, and working with custom user forms or dialog boxes. As its name suggests, VBA is closely related to Visual Basic and uses the Visual Basic Runtime Library. However, VBA code normally can only run within a host application, rather than as a standalone program. VBA can, however, control one application from another using OLE Automation. For example, VBA can automatically create a Microsoft Word report from Microsoft Excel data that Excel collects automatically from polled sensors. VBA can use, but not create, ActiveX/COM DLLs, and later versions add support for class modules. VBA is built into most Microsoft Office applications, including Office for Mac OS X (except version 2008), and other Microsoft applications, including Microsoft MapPoint and Microsoft Visio. VBA is also implemented, at least partially, in applications published by companies other than Microsoft, including ArcGIS, AutoCAD, CorelDraw, LibreOffice, Reflection, SolidWorks, and WordPerfect. 2002 726 576 817 32778 Microsoft bas cls frm frx vba 3650 511 23 https://learn.microsoft.com/en-us/office/vba/api/overview/ text https://github.com/antlr/grammars-v4/tree/master/vba/vba6 http://www.rosettacode.org/wiki/Category:VBA ' true true https://en.wikipedia.org/wiki/Visual_Basic_for_Applications 270 5 VBA VBA year|publisher|title|authors|isbn13\n2009|Pearson|Introduction to VBA for Excel|Chapra, Steven|9780132396677\n2013|Wiley|Excel 2013 Power Programming with VBA|Walkenbach, John|9781118490396\n2011|Wiley|Credit Risk Modeling using Excel and VBA|Löeffler, Gunter and Posch, Peter N.|9780470660928\n2004|For Dummies|Access VBA Programming For Dummies|Simpson, Alan|9780764574115\n2012|Packt Publishing|Excel Programming with VBA Starter|Robert Martin|9781849688444\n2007|Wiley|Excel 2007 Power Programming with VBA|Walkenbach, John|9780470044018\n2004|Wiley|Excel 2003 Power Programming with VBA (Book & CD-ROM)|Walkenbach, John|9780764540721\n1998|O'Reilly Media|VB & VBA in a Nutshell: The Language: The Language (In a Nutshell (O'Reilly))|Lomax, Paul|9781565923584\n2004|McGraw-Hill Education|Excel VBA Macro Programming|Shepherd, Richard|9780072231441\n2004|McGraw-Hill Education|Access VBA Programming|Brown, Charles and Petrusha, Ron|9780072231977\n2007|Cengage Learning PTR|Microsoft Access VBA Programming for the Absolute Beginner|Vine, Michael|9781598633931\n2005|Sybex|Mastering VBA|Hart-Davis|9780782144369\n2011|Chefetz LLC|VBA Programming for Microsoft Project '98 through 2010 with an Introduction to VSTO|Rod Gill|9781934240212\n2004|For Dummies|Excel VBA Programming For Dummies|Walkenbach, John|9780764574122\n1997|Sybex|Access 97 Macro & VBA Handbook|Novalis, Susann|9780782119770\n2007|Que Publishing|VBA and Macros for Microsoft Office Excel 2007|Jelen, Bill and Syrstad, Tracy|9780789736826\n2002|Cengage Learning PTR|Microsoft Access VBA Programming for the Absolute Beginner|Vine, Michael|9781592000395\n2004|Que Publishing|VBA and Macros for Microsoft Excel|Jelen, Bill|9780789731296\n2005|Cengage Learning PTR|Microsoft Access VBA Programming for the Absolute Beginner, Second Edition|Vine, Michael|9781592007233\n2004|Sybex|Mastering Excel 2003 Programming with VBA|Hansen, Steven M. and Sybex|9780782142815\n2009|Jones & Bartlett Learning|Excel 2007 VBA Programming with XML and ASP (Wordware Applications Library)|Korol, Julitta|9781598220438\n2007|Que Publishing|VBA for the 2007 Microsoft Office System|Mcfedries, Paul|9780789736673\n2009|McGraw-Hill Education|Word 2007 Macros & VBA Made Easy (Made Easy Series)|Hart-Davis, Guy|9780071614795\n2004|Que Publishing|Absolute Beginner's Guide to VBA|McFedries, Paul|9780789730763\n2001|Prentice Hall|Vba For Autocad 2002: Writing Autocad Macros|Jeffrey E. Clark|9780130652010\n2001|Course Technology Ptr (Sd)|Course ILT: Microsoft Excel 2002: VBA Programming|Technology, Course|9780619069544\n2000|Sybex|Mastering VBA 6|Hart-Davis|9780782126365\n2005|Jones & Bartlett Learning|Excel 2003 VBA Programming With XML And ASP|Korol, Julitta|9781556222252\n2009|McGraw Hill|Word 2007 Macros & VBA Made Easy (Made Easy Series)|Hart-Davis, Guy|9780071614801\n2010|ANAYA MULTIMEDIA|Excel 2010: Programación con VBA / Power Programmingwith VBA (Spanish Edition)|Walkenbach, John|9788441528284\n2011|Wrox|Access 2007 VBA Programmer's Reference|Hennig, Teresa and Cooper, Rob and Griffith, Geoffrey L. and Stein, Armen|9781118058527\n2019||Excel Vba Programming By Examples|Thanh Tran|9781081431211\n1999|John Wiley &Sons|Excel 2000 VBA Programmers Reference|Green, John|9780764544019\n2019|Independently published|Excel VBA: The Ultimate Beginner's Guide to Learn VBA Programming Step by Step|A. Williams, David|9781073361083\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\n2000|Wrox|Beginning Access 2000 VBA|Smith, Robert and Sussman, Dave|9780764543838\n20060412|Independent Publishers Group (Chicago Review Press)|From VBA to VSTO|Dr. Gerard M. Verschuuren|9781615473175\n2002|Crisp Pub Inc|Excel 2002: Vba Programming : Student Manual|TECHNOLOGY, COURSE|9780619175474\n2016|Wiley India Pvt. Ltd|Excel 2016 Power Programming With Vba|Michael; Kusleika, Dick Alexander|9788126560608\n20110826|Cengage Learning US|VBA for Modelers: Developing Decision Support Systems|S. Christian Albright|9781285225678\n|Wiley|Microsoft Excel 2013 Power Programming with VBA|John Walkenbach|9788126542420\n2018-11-06T00:00:01Z|For Dummies|Excel VBA Programming For Dummies (For Dummies (Computer/Tech))|Alexander, Michael and Walkenbach, John|9781119518174\n2019|Sybex|Mastering VBA for Microsoft Office 365|Mansfield, Richard|9781119579380\n2019|Wiley|Excel 2019 Power Programming with VBA|Alexander, Michael and Kusleika, Dick|9781119514923\n2018|For Dummies|Excel VBA Programming For Dummies|Alexander, Michael and Walkenbach, John|9781119518242\n2010|McGraw Hill|Microsoft Access 2010 VBA Macro Programming|Shepherd, Richard|9780071738583\n2021|For Dummies|Excel VBA Programming For Dummies|Kusleika, Dick|9781119843092\n2016-02-08T00:00:01Z|John Wiley & Sons|Excel 2016 Power Programming with VBA (Mr. Spreadsheet's Bookshelf)|Alexander, Michael and Kusleika, Richard|9781119067726\n2010|Que Publishing|VBA and Macros: Microsoft Excel 2010 (MrExcel Library)|Jelen, Bill and Syrstad, Tracy|9780789743145\n2022|Holy Macro! Books|Programming PowerPoint With VBA Straight to the Point|Sanchez, Eduardo N|9781615471638\n2013|For Dummies|Excel VBA Programming for Dummies: Third Edition|Walkenbach, John|9781118490372\n2019|Wiley|Excel 2019 Power Programming with VBA|Alexander, Michael and Kusleika , Dick|9781119514916\n2019|In Easy Steps Limited|Excel VBA in easy steps|McGrath, Mike|9781840788242\n2006|O'Reilly Media|Programming Excel with VBA and .NET: Solve Real-World Problems with Excel|Webb, Jeff and Saunders, Steve|9780596007669\n2001|Sybex|VBA Developer's Handbook, 2nd Edition|Ken Getz and Mike Gilbert|9780782129786\n2010|Wiley|Excel 2010 Power Programming with VBA|Walkenbach, John|9780470475355\n2002-04-02T00:00:01Z|Cengage Learning PTR|Microsoft Excel VBA Programming for the Absolute Beginner|Birnbaum, Duane|9781931841047\n2013|Sybex|Mastering VBA for Microsoft Office 2013|Mansfield, Richard|9781118695128\n2016|Wiley|Excel 2016 Power Programming with VBA (Mr. Spreadsheet's Bookshelf)|Alexander, Michael and Kusleika, Richard|9781119067627\n2019-07-14T00:00:01Z|Independently published|VBA for Beginners: An Introduction to Learn VBA Programming with Tutorials and Hands-On Examples|Metzler, Nathan|9781080611485\n2007|For Dummies|VBA For Dummies|Mueller, John Paul|9780470046500\n2019|In Easy Steps Limited|Excel VBA in easy steps, 3rd edition|McGrath, Mike|9781840788716\n2015|Cengage Learning|VBA for Modelers: Developing Decision Support Systems with Microsoft Office Excel|Albright, S. Christian|9781305537644\n2015|Que Publishing|Excel 2016 VBA and Macros (MrExcel Library)|Jelen, Bill and Syrstad, Tracy|9780789755858\n2015|John Wiley &Sons|Excel Vba Programming For Dummies, 4e|Walkenbach, John|9781119077398\n2016|Sybex|Mastering VBA for Microsoft Office 2016|Mansfield, Richard|9781119225409\n2010|McGraw-Hill Education|Microsoft Access 2010 VBA Macro Programming|Shepherd, Richard|9780071738576\n1999|O'Reilly Media|Writing Word Macros: An Introduction to Programming Word using VBA|Steven Roman, PhD|9781565927254\n2004|Wrox|Excel 2003 VBA Programmer's Reference|Kimmel, Paul T. and Bullen, Stephen and Green, John and Bovey, Rob and Rosenberg, Robert|9780764556609\n2018-06-29T00:00:01Z|CreateSpace Independent Publishing Platform|Excel VBA: A Step-By-Step Guide To Learn And Master Excel VBA Programming|Smith, Hein|9781722122126\n2003|Que Publishing|Microsoft Office Access 2007 VBA|Diamond, Scott B. and Spaulding, Brent|9780132714136\n2006|MSProjectExperts|VBA Programming for Microsoft Office Project Versions 98 through 2007 (Emp Learning)|Rod Gill|9780975982877\n2022|For Dummies|Excel VBA Programming For Dummies (For Dummies (Computer/Tech))|Kusleika, Dick|9781119843078\n2009|Jones & Bartlett Learning|Numerical Methods with VBA Programming|Hiestand, James|9780763749644\n2010-05-24T00:00:01Z|For Dummies|Excel VBA Programming For Dummies|Walkenbach, John|9780470503690\n2013|Wiley|Excel 2013 Power Programming with VBA (Mr. Spreadsheet's Bookshelf Book 15)|Walkenbach, John|9781118490402\n2007|Cengage Learning PTR|Microsoft Excel VBA Programming for the Absolute Beginner|Birnbaum, Duane and Vine, Michael|9781598633948\n2011|Microsoft Press|Microsoft Access 2010 VBA Programming Inside Out|Couch, Andrew|9780735664906\n2011|Microsoft Press|Microsoft Access 2010 VBA Programming Inside Out|Couch, Andrew|9780735659872\n2018|Independently published|Excel VBA: A Step-By-Step Comprehensive Guide on Advanced Excel VBA Programming Techniques and Strategies|Bradley, Peter|9781791561086\n2013|Sybex|Mastering VBA for Microsoft Office 2013|Mansfield, Richard|9781118786307\n2007|For Dummies|Access 2007 VBA Programming For Dummies|Stockman, Joseph C. and Simpson, Alan|9780470046531\n2001|Sybex|Mastering AutoCAD VBA|Cottingham, Marion|9780782128710\n2019|Independently published|Excel Programming: The Ultimate Collection to Learn Excel VBA & Excel Macros Step by Step|A. Williams, David|9781676827481\n2005|Addison-Wesley Professional|Professional Excel Development: The Definitive Guide to Developing Applications Using Microsoft Excel and VBA|Bullen, Stephen and Bovey, Rob and Green, John|9780321262509\n2004|Que Publishing|Automating Microsoft Access with VBA|Gunderloy, Mike and Harkins, Susan Sales|9780789732446\n2007|For Dummies|Excel 2007 VBA Programming For Dummies|Walkenbach, John|9780470046746\n2013-03-13T00:00:00.000Z|Wiley|Excel 2013 Power Programming with VBA (Mr. Spreadsheet's Bookshelf Book 14)|Walkenbach, John|9781118491829\n2007|Wiley|Structured Finance Modeling with Object-Oriented VBA|Tick, Evan|9780470098592\n2009|McGraw-Hill Education|Excel 2007 VBA Macro Programming|Shepherd, Richard|9780071627009\n2011|Cengage Learning PTR|Microsoft Access VBA Programming for the Absolute Beginner|Vine, Michael|9781133788959\n2019-05-17T00:00:01Z|Independently published|EXCEL VBA: A Step by Step Guide to Learn EXCEL VBA Programming for Absolute Beginners|Academy, Elite Tech|9781099162503\n2019-01-01T00:00:01Z|Independently published|Expert @ Excel: 3 BOOKS IN 1: For beginners, Pivot Tables and VBA Programming|Reed, Daniel|9781792002656\n2018-10-19T00:00:01Z|CreateSpace Independent Publishing Platform|Excel VBA: Top Tips, Tricks, Timesavers, and Common Mistakes in VBA Programming|Smith, Mr Hein|9781729528150\n2017||VBA for Excel: Programming VBA Macros: The Easy Introduction for Beginners and Non-Programmers|Patterson, Andrew J.|9781370048649\n2018|Independently published|How to Learn Microsoft Access VBA Programming Quickly!|Besedin, Andrei|9781977016294\n2018-10-23T00:00:01Z|Independently published|Expert @ Excel VBA Programming: A Step-By-Step Guide To Learn And Master Excel VBA Programming To Get Ahead @ Work, Business And Personal Finances|Reed, Daniel and Reed, Daniel|9781729153109\n2007|Wrox|Excel 2007 VBA Programmer's Reference|John Green and Stephen Bullen and Rob Bovey and Michael Alexander|9780470046432\n2004|Que Publishing|Absolute Beginner's Guide to VBA|McFedries, Paul|9780131389984\n2007|Wrox|Beginning Access 2007 VBA|Gosnell, Denise M.|9780470046845\n2004|McGraw-Hill Education|Excel VBA Macro Programming|Shepherd, Richard|9780072263695\n2008|Jones & Bartlett Learning|Computing with Excel and VBA|Krishan, S.I.|9780763756680\n2008|Sybex|Mastering VBA for Microsoft Office 2007|Mansfield, Richard|9780470279595\n2019|Independently published|Excel VBA: Ultimate Excel VBA Programming Step By Step Guide to Go from Beginner to Expert|Ironside, William|9781081242756\n2004|Que Publishing|VBA and Macros for Microsoft Excel|Syrstad, Tracy and Jelen, Bill|9780132714785\n2006|Holy Macro! Books|Holy Macro! It's 2,500 Excel VBA Examples: Every Snippet of Excel VBA Code You'll Ever Need|Herber, Hans and Jelen, Bill and Urtis, Tom|9781932802184\n2004|Que Publishing|Automating Microsoft Access with VBA|Gunderloy, Mike and Harkins, Susan Sales|9780789745507\n2018-11-01T00:00:01Z|Independently published|Expert@Excel : Pivot Tables and VBA Programming: Bundle: 2 Books in 1: A Step-By-Step Guide To Learn And Master Pivot Tables and VBA Programming To Get Ahead @ Work, Business And Personal Finances|Reed, Daniel|9781729165690\n1999|*M&T Press|Microsoft Excel 2000 Power Programming with VBA|Walkenbach, John|9780764532634\n2009|Jones & Bartlett Learning|Word 2007 Document Automation With VBA And VSTO|Driza, Scott|9781598220476\n2017-06-12T00:00:01Z|CreateSpace Independent Publishing Platform|Excel VBA Programming for Beginners: Excel VBA 2013. Make it Easy. Practical Guide|Torrance, Charlie|9781546832881\n2007|Que|Microsoft Office Access 2007 VBA|Diamond, Scott and Spaulding, Brent|9780789737311\n2011|Wrox|Excel VBA 24-Hour Trainer|Urtis, Tom|9780470890691\n2003|Course Technology PTR|Microsoft Excel VBA Professional Projects|Birnbaum, Duane|9781592000654\n2019-03-22T00:00:01Z|Routledge|An Introduction to Excel VBA Programming|Gan, Guojun|9780367261283\n1999|Sybex|Access 2000 VBA Handbook|Novalis, Susann|9780782123241\n2018-09-29T00:00:01Z|CreateSpace Independent Publishing Platform|Beginning Microsoft Excel VBA Programming for Accountants: A Practical and Project Based Approach|Harlan, Mr. Derek|9781981190959\n2004|McGraw-Hill Education|Excel VBA Macro Programming|Shepherd, Richard|9780071506823\n2019-03-17T00:00:01Z|Independently published|Excel VBA : A Step-by-Step Simplified Guide to Excel VBA Programming Techniques, Data Reporting, Business Analysis and Tips and Tricks for Effective Strategies|Bradley, Peter|9781799246428\n2005|Visual|Master Visually Excel 2003 VBA Programming|Kelly, Julia|9780764579738\n2003|Wiley|Access?2003 Power Programming with VBA|Taylor, Allen G. and Andersen, Virginia|9780764525889\n2018-10-09T00:00:01Z|Independently published|Excel VBA: Programming For Complete Beginners, Step-By-Step Illustrated Guide to Mastering Excel VBA|Skates, William B.|9781726852067\n1999|Apress|Outlook 2000 VBA Programmers Reference|Gifford, Dwayne|9781861002532\n2017-04-07T00:00:01Z|Chapman and Hall/CRC|An Introduction to Excel VBA Programming: with Applications in Finance and Insurance|Gan, Guojun|9781138197152\n2019|Independently published|Expert @ Excel: VBA Programming and Power BI: Step-By-Step Guide To Learn And Master Pivot Tables and VBA Programming To Get Ahead @ Work, Business And Personal Finances|Reed, Daniel|9781090881854\n1999|Wrox Pr Inc|Beginning Access 2000 Vba|Smith, Robert|9781861001764\n1999|CMP|AutoCAD VBA Programming Tools and Techniques : Exploiting the Power of VBA in AutoCAD 2000|Gibb, John and Kramer, Bill|9780879305741\n2001|Sybex|Access 2002 VBA Handbook|Novalis, Susann and Jones, Dana|9780782140132\n|Pearson Education|Brilliant Excel VBA Programming. Ken Bluttman|Ken Bluttman,Curtis Frye|9780273771975\n1999|Apress|Word 2000 VBA Programmers Reference|MacKenzie, Duncan and Martins, Felipe|9781861002556\n2007|Que Publishing|VBA for the 2007 Microsoft Office System|McFedries Paul|9780132714808\n2005|Cengage Learning PTR|Microsoft Excel VBA Programming for the Absolute Beginner, Second Edition|Birnbaum, Duane|9781592007295\n2006|Addison-Wesley Professional|Visual Studio 2005 Tools for Office for Mere Mortals: A VBA Developer's Guide to Managed Code in Microsoft Office|McGrath, Kathleen and Stubbs, Paul|9780132701716\n2003|Wrox|Beginning Access 2002 VBA|Smith, Robert and Sussman, Dave and Blackburn, Ian and Colby, John and Horner, Mark and Reid, Martin and Turley, Paul and Watson, Helmut|9780764544026\n2001|For Dummies|VBA For Dummies (For Dummies (Computers))|Cummings, Steve|9780764508561\n2001|*M&T Press|Excel 2002 Power Programming with VBA (EXCEL POWER PROGRAMMING WITH VBA)|Walkenbach, John|9780764547997\n1997-09-01T00:00:01Z|Apress|Beginning Access 97 Vba Programming|Smith, Robert and Sussman, David|9781861000866\n1998|Hungry Minds Inc|Vba for Dummies|Cummings, Steve|9780764502583\n2013|CreateSpace Independent Publishing Platform|Beginning Excel VBA Programming: A concise guide to developing Excel VBA Applications and Macros|Technologies, Iducate Learning|9781490360829\n2000|Apress|Definitive Guide to Excel VBA|Michael Kofler|9781893115798\n2001|Prentice Hall|Office XP Development with VBA|Aitken, Peter G.|9780130654175\n2000|Wordware|Learn Word 2000 Vba Document Automation|Driza, Scott|9781556227516\n2005-09-28T00:00:01Z|Made Simple|VBA For Excel Made Simple (Made Simple Programming)|Darlington, Keith|9780750660976\n2014-04-27T00:00:01Z|CreateSpace Independent Publishing Platform|VBA Programming in Excel: Learn With Examples|Thomas, Mrs Susan|9781499283358\n2003|Wrox Press|Beginning Access 2002 Vba|Smith, Richard and Sussman, Dave and Blackburn, Ian and Colby, John and Homer, Mark and Reid, Martin and Turley, Paul and Watson, Helmut and Blackburn, Ian and Horner, Mark and Smith, Robert|9781861008213\n2003|Wordware Publishing, Inc.|Learn Microsoft Excel 2002: VBA Programming with XML and ASP|Korol, Julitta|9781556227615\n2011-06-10T00:00:01Z|Crisp Pub Inc|Excel 2010: VBA Programming (Ilt)|Tremblay, Don|9781426029219\n2010|Djoef Publishing|VBA Programming in Business Economics|WÃÂ¸hlk, Sanne|9788757422672\n2001-11T|Peer Information|Excel 2002 VBA Programmers Reference|Bovey, Rob and Rosenberg, Robert|9781861005700\n2012-01-10t00:00:01z|Createspace Independent Publishing Platform|Access Vba Programming Interview Questions You'll Most Likely Be Asked|Publishers, Vibrant|9781468170894\n1999-08-25T00:00:01Z|For Dummies|VBA For Dummies (For Dummies Series)|Cummings, Steve|9780764505676\n1996|Wiley|Excel for Windows 95 Power Programming with VBA|Walkenbach, John|9780764530012\n2000|Pearson|Developing Solutions with Office 2000 Components and VBA|AITKEN|9780130263056\n2004-06-07T00:00:01Z|ANAYA MULTIMEDIA|Excel 2003 Programacion con VBA / Excel 2003 Power Programming With VBA (Programación) (Spanish Edition)|Walkenbach, John|9788441517134\n2004-02-01T00:00:01Z|Crisp Pub Inc|Excel 2003: VBA Programming (Course ILT)|Course Technology|9780619204105\n2004|Crisp Pub Inc|Course ILT Access 2003: VBA Programming|Course Technology|9780619203832\n2006-03-01T00:00:01Z|Axzo Press|Access 2003: VBA Programming, 2nd Edition, Student Manual (ILT)|Axzo Press|9781423913535\n2005|TBS|Mastering VBA|Hart-Davis, Guy|9788126506705\n2005|Anaya Multimedia-Anaya Interactiva|Excel 2002: Programacion Con Vba/programming With Vba (Spanish Edition)|Walkenbach, John|9788441513495\n2007|ANAYA MULTIMEDIA|Excel 2007: Programación con VBA / Power Programming With VBA (Spanish Edition)|Walkenbach, John|9788441522985\n2019-07-03T00:00:01Z|Peter Bradley|Excel VBA - Intermediate Lessons in Excel VBA Programming for Professional Advancement|Bradley, Peter|9781393228288\n2010|Tata Mcgraw-hill Education|Excel 2007 Vba Macro Prog.|Shepherd|9780070703483\n1996|Apress|Beginning Access 95 Vba Programming|Smith, Robert and Sussman, David|9781874416647\n2011|Wiley & Sons, Incorporated, John|Excel Vba Programming For Dummies|John Walkenbach|9781118054352\n2022|Independently published|EXCEL POWER PROGRAMMING WITH VBA & MACROS|BINN, CARTY|9798807092823\n|India Professional|Microsoft Access 2010 VBA Macro Programming|Shepherd, Richard|9780071076685\n2007|John Wiley & Sons|Excel 2007 Power Programming With Vba|John Walkenbach|9780470151303\n19981001|O'Reilly Media, Inc.|VB & VBA in a Nutshell: The Language|Paul Lomax|9780596519919\n|Bpb Publications|Learn Excel 2002 Vba Programming With Xml Asp||9788176567824\n2014|Cengage Learning|Microsoft Excel Vba Programming For The Absolute Beginner|Duane Birnbaum|9781592007301\n2010|Electronics Industry Pub. Date :2010-12-1|Excel 2010 VBA Programming and Practice - (with CD 1)|LUO GANG JUN. ZHANG LAN XIN. HUANG ZHAO YANG.|9787121120398\n2014|清华大学出版社|Excel application with VBA programming in Economic Management (Second Edition)(Chinese Edition)|XU JUN CHANG GUI YING|9787302368977\n2013|Tsinghua University Press|EXCEL VBA programming applications and the Ministry of Education Practical IT personnel training in economic management textbook series(Chinese Edition)|XU JUN|9787302332091\n2018|Andrei Besedin|Vba Bible|Andrei Besedin|9781980850618\n1999||Beginning Vba Programming|Steve Danielson / Joe Sutphin / Mike Sussman|9781861002860\n2004|Mcgraw-hill Osborne Media|Access Vba Programming|Brown, Charles and Petrusha, Ron|9780070594081\n2006|John Wiley & Sons|Mastering Autocad Vba|Marion Cottingham|9780782152821\n2004-08-18|Wiley|Excel 2002 VBA|Rob Bovey and Stephen Bullen and John Green and Robert Rosenberg|9780764558597\n20061114|Springer Nature|AutoCAD 2006 VBA|Joe Sutphin|9781430200697\n2007-04-09|Wiley|VBA For Dummies|John Paul Mueller|9780470126998\n2011|Crisp Learning|Excel 2010: Vba Programming|Axzo Press|9781426029226\n20060412|Independent Publishers Group (Chicago Review Press)|From VBA to VSTO|Dr. Gerard M. Verschuuren|9781932802603\n2004-08-18|Wiley|Beginning Access 2002 VBA|Robert Smith and Dave Sussman and Ian Blackburn and John Colby and Mark Horner and Martin Reid and Paul Turley and Helmut Watson|9780764558788\n2007|Crisp Pub Inc|Word 2003: Vba Programming|Michael Springer|9781418890711\n|Course Technology Inc|Word 2003 Vba Programming||9780619205379\n2015|Sybex|Autocad Platform Customization: Vba|Lee Ambrosius|9781118798935\n2019|Independently Published|Excel Vba And Excel Macros: Mastering Excel Vba, Tips And Tricks Of Vba Programming And Mastering Excel Macros|Smith and Hein|9781071154335\n20161207|Morgan & Claypool Publishers|Excel VBA for Physicists|Bernard V Liengme|9781681744629\n20130307|Pearson International Content|Brilliant Excel VBA Programming|Curtis Frye|9780273772903\n20080529|Springer Nature|Pro Excel 2007 VBA|Jim DeMarco|9781430205807\n2001|Crisp Pub Inc|Course Ilt: Microsoft Vba Programming|Course Technology|9780619068202\n2015-03-23|Wiley Professional Development (P&T)|Excel VBA 24-Hour Trainer|Tom Urtis|9781118991404\n2013|John Wiley & Sons|Excel Vba Programming For Dummies|John Walkenbach|9781118490389\n2001|Axzo Press|Vba Programming, Instructor's Edition (ilt)|Axzo Press|9780619068219\n|Wiley|Excel 2007 Vba Programmer's Reference||9780470046432\n2004|In Easy Steps Limited|Excel Vba In Easy Steps|Robinson and Ed|9780760757321\n2015|John Wiley & Sons|Excel Vba Programming For Dummies|John Walkenbach|9781119077442\n||Excel Vba Programming For Dummies|John Walkenbach|9780764578526\n2011|Wiley|Excel VBA 24-hour trainer|Urtis, Tom.|9780470890691\n20091122|McGraw-Hill Professional|Excel 2007 VBA Macro Programming|Richard Shepherd|9780071627016\n2002|Kendall Hunt Pub Co|Introduction To Programming Using Vba|James Bates|9780787299859\n2005|John Wiley & Sons Inc|Excel Vba Programming For Dummies|Craig D. Knuckles|9780471730583\n04/25/2014|Jones & Bartlett Learning|Computing with Excel and VBA|Oakland University S.I. Krishan|9781449625368\n2011-08-10|Wiley|Excel 2007 VBA Programmer's Reference|John Green and Stephen Bullen and Rob Bovey and Michael Alexander|9781118169360\n20020625|O'Reilly Media, Inc.|Writing Excel Macros with VBA|Steven Roman, PhD|9780596516963\n20020625|O'Reilly Media, Inc.|Writing Excel Macros with VBA|Steven Roman, PhD|9780596555238\n2021-12-20|Wiley|Excel VBA Programming For Dummies|Dick Kusleika|9781119843085\n2004-08-26|Wiley|Access VBA Programming For Dummies|Alan Simpson|9780764578564\n20080101|Springer Nature|Definitive Guide to Excel VBA|Michael Kofler|9781430208617\n20121018|Packt Publishing|Excel Programming with VBA Starter|Robert Martin|9781849688451\n08/2009|Jones & Bartlett Learning|Numerical Methods with VBA Programming|The University of Tennessee at Chattanooga James Hiestand|9781449616229\n20080101|Springer Nature|Definitive Guide to Excel VBA|Michael Kofler|9781430206668\n2014||Engineering Analysis & Modeling With Excel Vba|Matthew E. Moran|9781495295188\n2013-08-19|Wiley Professional Development (P&T)|Mastering VBA for Microsoft Office 2013|Richard Mansfield|9781118750223\n2009|John Wiley & Sons Inc|Access X Power Programming With Vba|Taylor Allen G.|9780470046586\n1999|San Francisco, Ca : Miller Freeman Books, 1999.|Autocad Vba Programming: Tools And Techniques|John Gibb and Bill Kramer|9781929629671\n2013|Wiley & Sons, Limited, John|Excel 2013 Power Programming With Vba|John Walkenbach|9781118491805\n2002|Eni Publishing|It Resources, Vba Programming Access 2002|Michele Amelot|9782746015340\n|Wiley|Excel 2007 Vba Programming For Dummies|Walkenbach, John and Pieterse, Jan P. Nederveen|9780470142363\n02/2016|Wiley Professional Development (P&T)|Excel 2016 Power Programming with VBA|Michael Alexander, Richard Kusleika|9781119067566\n18-09-2020|Packt Publishing|VBA Automation for Excel 2019 Cookbook|Mike Van Niekerk|9781789616330\n2007|For Dummies|Access 2007 Vba Programming For Dummies|Joseph C. Stockman and Alan Simpson|9780470148044\n2015-11-13|Createspace Independent Publishing Platform|Excel Vba Programming: Learn Excel Vba Programming Fast And Easy! (programming Is Easy) (volume 9)|Matthew Matthew Gimson|9781519269263\n20060425|O'Reilly Media, Inc.|Programming Excel with VBA and .NET|Jeff Webb; Steve Saunders|9781449379056\n2011-07-05|Wiley|Excel 2007 Power Programming with VBA|John Walkenbach|9781118050682\n20170508|Taylor & Francis|An Introduction to Excel VBA Programming|Guojun Gan|9781315280677\n2010-04-09|Wiley|Excel 2010 Power Programming with VBA|John Walkenbach|9780470625507\n20060425|O'Reilly Media, Inc.|Programming Excel with VBA and .NET|Jeff Webb|9780596518202\n2011-02-08|Wiley|Excel 2007 VBA Programming For Dummies|John Walkenbach|9781118050804\n2000|Wordware Publishing Inc.|Learn MS Excel 2000 VBA Programming|Julitta Korol|9781556227035\n2011-02-08|Wiley|Access 2007 VBA Programming For Dummies|Joseph C. Stockman and Alan Simpson|9781118050750\n2001|Crisp Pub Inc|Course Ilt: Microsoft Word 2000: Vba Programming|Course Technology|9780619054328\n2001|Crisp Pub Inc|Course Ilt: Microsoft Excel 2000: Vba Programming|Course Technology|9780619022662\n2017-01-04|In Easy Steps Limited|Excel VBA in easy steps, 2nd Ed|Mike McGrath|9781840787702\n2007|John Wiley & Sons|Excel 2003 Power Programming With Vba Set|John Walkenbach|9780470231555\n2011-07-28|Wiley|Structured Finance Modeling with Object-Oriented VBA|Evan Tick|9781118160664\n2022-02-21|tredition|SAP interface programming with RFC and VBA|Karl Josef Hensel|9783347574793\n2011-12-28|Wiley|Professional Financial Computing Using Excel and VBA|Donny C. F. Lai and Humphrey K. K. Tung and Michael C. S. Wong and Stephen Ng|9781118179086\n2019|Independently Published|Excel Vba : A Step-by-step Comprehensive Guide On Excel Vba Programming Tips And Tricks For Effective Strategies|Peter Bradley|9781795358293\n2007|Axzo Press|Excel 2007: Vba Programming + Certblaster, Instructor's Edition (ilt)|Axzo Press|9781423951087\n2009|Jones & Bartlett Publishers|Excel 2007 Vba Programming With Xml And Asp|Julitta Korol|9780763782764\n2007|Axzo Press|Excel 2007: Vba Programming + Certblaster, Student Manual (ilt)|Axzo Press|9781423951070\n2018|Createspace Independent Publishing Platform|Excel Macros: Vba Programming For Beginners Part 1|Vijay Kumar|9781986624756\n1997|John Wiley & Sons Inc|Microsoft Office 97 Programming With Vba For Dummies|Karen Jaskolka and Mike Gilbert|9780764501821\n2007|Cengage Learning|Microsoft Access Vba Programming For The Absolute Beginner|Michael Vine|9781598637540\n2008|Holy Macro! Books|Access 2007 Vba Made Accessible (visual Training Series)|Dr. Gerard Verschuuren|9781932802399\n|Indianapolis, In : Premier Press, 2002.|Microsoft Excel Vba Programming For The Absolute Beginner||9780585439853\n2006||Excel 2003: Vba Programming, 2nd Edition, Instructor's Edition|Axzo Press|9781418890698\n2006-08-30|Wiley|Advanced Modelling in Finance using Excel and VBA|Mary Jackson and Mike Staunton|9780470061664\n2007|John Wiley & Sons|Excel 2007 Power Programming With Vba (mr. Spreadsheet's Bookshelf)|John Walkenbach|9780555034408\n2004|Crisp Pub Inc|Ms Office Excel 2003 Vba Programming Course Ilt Manual|Y Ilt Course Technology|9780619204129\n2006|Axzo Press|Excel 2003: Vba Programming, 2nd Edition, Student Manual (ilt)|Axzo Press|9781418890681\n1999|Microsoft Press|Microsoft Access 2000 Vba Fundamentals/mastering Set (training Kit)|Evan Callahan and Microsoft Press|9780735608146\n2007|Axzo Press|Excel 2007: Vba Programming + Certblaster, Student Manual With Data (ilt)|Axzo Press|9781423951094\n2018-09-10|Monday Sadiku|Excel Vba Programming: Automating Excel Through Visual Basic For Application|Steven Bright|9781393703150\n|Plano, Tex. : Wordware Pub., C2003.|Learn Microsoft Excel 2002 Vba Programming With Xml And Asp|Julitta Korol|9780585448312\n2006|Axzo Press|Excel 2003: Vba Programming, 2nd Edition, Student Manual With Data (ilt)|Axzo Press|9781418890704\n|Cram101|Studyguide For Numerical Methods With Vba Programming By James Hiestand, Isbn 9780763749644|Cram101 Textbook Reviews and James Hiestand|9781618126832\n2002||Microsoft Excel Vba Programming For The Absolute Beginner (for The Absolute Beginner (series).)|Duane Birnbaum|9788120320536 VBA vba engineer year|title|doi|citations|influentialCitations|authors|paperId\n2007|Implementing Large-Scale Optimization Models in Excel Using VBA|10.1287/inte.1060.0256|13|0|L. LeBlanc and Michael R. Galbreth|2787f44c655cc1e4e6afe553ed569ed6734ecfe4\n2000|Definitive Guide to Excel VBA|10.1007/978-1-4302-0861-7|9|0|M. Kofler|d986402a56cb4b7a4db85d1beb8684a1d6a214c0\n2006|Teaching Engineering Analysis Using VBA for Excel|10.18260/1-2-370-38838|5|1|T. Chambers|6392ad290b4ee6877eaf00775febce967bbc94b4\n2015|Life Cycle Cost Prediction for Rolling Stocks in Maintenance Phase Based on VBA Language Program|10.14257/IJSH.2015.9.3.22|4|0|Jiamin Fang and Lin Ji|def1989130b8031bab240fe1bc7c5eac6e0b37bc\n2015|The design and implementation of the Examination System Based on the Word — VBA|10.1109/ICMIC.2015.7409453|1|0|Z. Peiping and Dai Zucheng|f18f10722ebf7002129b1a5fcc70e3f5f5d4bddd title|year|author|goodreadsId|rating|ratings|reviews\nExcel VBA Programming For Dummies|2004|John Walkenbach|6785493|3.90|353|20\nExcel 2010 Power Programming with VBA|2010|John Walkenbach|13303701|4.05|216|12\nExcel 2007 VBA Programming for Dummies|1996|John Walkenbach|148782|3.77|120|2\nVBA For Dummies|2003|John Paul Mueller|1003621|3.00|20|2\nVB & VBA in a Nutshell: The Language|1998|Paul Lomax|397693|3.44|50|3\nMicrosoft Excel 2013 Power Programming with VBA|2013|John Walkenbach|22367313|4.23|86|5\nExcel 2003 Power Programming with VBA|2004|John Walkenbach|25595828|3.85|53|5\nBeginning Excel VBA Programming|2011|Iducate Learning Technologies|27034221|3.32|34|0\nAccess 2007 VBA Programming for Dummies|2007|Joseph C. Stockman|908222|3.50|30|0\nExcel VBA Macro Programming|2004|Richard Shepherd|586790|3.17|12|0\nAccess VBA Programming for Dummies|2004|Alan Simpson|1082527|3.72|18|1 emacs-lisp Emacs Lisp 1985 Richard Stallman 35 pl lisp 0 278 3 24093 2009 true 0 pl 12880 16754 .abbrev_defs .emacs .emacs.desktop .gnus .spacemacs .viper Cask Project.ede _emacs abbrev_defs 1305 11 "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""" elisp or emacs lisp commonlisp text/x-common-lisp source.emacs.lisp programming false e/EmacsLisp.el 101 2016 2018 3 1 emacslisp lisp.py 1985 lisp common-lisp emacs-editor c unix bourne-shell perl scheme "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." 2002 85 154 262 10392 GNU Project el emacs emacsdesktop el el el elc true 1645 0 https://exercism.org/tracks/emacs 38 1 https://tio.run/#emacs-lisp https://www.gnu.org/software/emacs/manual/html_mono/elisp.html text Emacs Lisp https://repl.it/languages/elisp https://elpa.gnu.org/ emacs25 United States "(message ""Hello World"") " "(print ""Dude!"") " EmacsLisp (defun switch-to-next-window-in-split () (set-window-buffer (next-window) (other-buffer))) (advice-add 'split-window-vertically :before #'switch-to-next-window-in-split) EmacsLisp ; print """" true true false true false true https://en.wikipedia.org/wiki/Emacs_Lisp 0 0 https://hopl.info/showlanguage.prx?exp=2009 Emacs Lisp Emacs Lisp https://github.com/Alhadis/language-emacs-lisp Emacs Lisp sagemath Sage 2005 30 pl http://www.sagemath.org/ 0 https://www.sagemath.org/download.html 279 3 10 24086 true 1 sympy pl 83 84 499 0 python python text/x-python source.python programming false 415 2015 2018 1 13 Sage 2007 2005 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 "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." 2006 179 269 846 4012438 University of Washington sage sagews html rust javascript markdown svg yaml css toml typescript json true 1116 0 41 false https://doc.sagemath.org/html/en/index.html https://doc.sagemath.org/html/en/faq/faq-general.html text United States Sage "# -*- coding: utf-8 -*- # # Funciones en Python/Sage para el trabajo con polinomios con una # incógnita (x). # # Copyright (C) 2014-2015, David Abián # # This program is free software: you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the Free # Software Foundation, either version 3 of the License, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, but WITHOUT # ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or # FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for # more details. # # You should have received a copy of the GNU General Public License along with # this program. If not, see . def pols (grado=-1, K=GF(2), mostrar=False): """"""Devuelve la lista de polinomios constantes y no constantes de coeficientes mónicos y grado igual o menor que el especificado. Si el grado indicado no es válido, devuelve una lista vacía. """""" lpols = [] if not grado.is_integer(): grado = grado.round() if grado >= 0: var('x') xs = vector([(x^i) for i in range(grado+1)]) V = VectorSpace(K,grado+1) lpols = [cs*xs for cs in V] if mostrar: for pol in lpols: print pol return lpols def polsNoCtes (grado=-1, K=GF(2), mostrar=False): """"""Devuelve la lista de polinomios no constantes de coeficientes mónicos y grado igual o menor que el especificado. Si el grado indicado no es válido, devuelve una lista vacía. """""" lpols = [] if not grado.is_integer(): grado = grado.round() if grado >= 0: var('x') xs = vector([(x^i) for i in range(grado+1)]) for cs in K^(grado+1): if cs[:grado] != vector(grado*[0]): # no constantes lpols += [cs*xs] if mostrar: for pol in lpols: print pol return lpols def polsMismoGrado (grado=-1, K=GF(2), mostrar=False): """"""Devuelve la lista de polinomios de coeficientes mónicos del grado especificado. Si el grado indicado no es válido, devuelve una lista vacía. """""" lpols = [] if not grado.is_integer(): grado = grado.round() if grado >= 0: var('x') xs = vector([(x^(grado-i)) for i in [0..grado]]) for cs in K^(grado+1): if cs[0] != 0: # polinomios del mismo grado lpols += [cs*xs] if mostrar: for pol in lpols: print pol return lpols def excluirReducibles (lpols=[], mostrar=False): """"""Filtra una lista dada de polinomios de coeficientes mónicos y devuelve aquellos irreducibles. """""" var('x') irreds = [] for p in lpols: fp = (p.factor_list()) if len(fp) == 1 and fp[0][1] == 1: irreds += [p] if mostrar: for pol in irreds: print pol return irreds def vecPol (vec=random_vector(GF(2),0)): """"""Transforma los coeficientes dados en forma de vector en el polinomio que representan. Por ejemplo, con vecPol(vector([1,0,3,1])) se obtiene x³ + 3*x + 1. Para la función opuesta, véase polVec(). """""" var('x') xs = vector([x^(len(vec)-1-i) for i in range(len(vec))]) return vec*xs def polVec (p=None): """"""Devuelve el vector de coeficientes del polinomio dado que acompañan a la incógnita x, de mayor a menor grado. Por ejemplo, con polVec(x^3 + 3*x + 1) se obtiene el vector (1, 0, 3, 1). Para la función opuesta, véase vecPol(). """""" cs = [] if p != None: var('x') p(x) = p for i in [0..p(x).degree(x)]: cs.append(p(x).coefficient(x,i)) cs = list(reversed(cs)) return vector(cs) def completar2 (p=0): """"""Aplica el método de completar cuadrados en parábolas al polinomio dado de grado 2 y lo devuelve en su nueva forma. Si el polinomio dado no es válido, devuelve 0. Por ejemplo, con complCuad(3*x^2 + 12*x + 5) se obtiene 3*(x + 2)^2 - 7. """""" var('x') p(x) = p.expand() if p(x).degree(x) != 2: p(x) = 0 else: cs = polVec(p(x)) p(x) = cs[0]*(x+(cs[1]/(2*cs[0])))^2+(4*cs[0]*cs[2]-cs[1]^2)/(4*cs[0]) return p(x) " https://riju.codes/sagemath "print(""Hello, world!"")" https://twitter.com/sagemath sage: E2 = EllipticCurve(CC, [0,0,-2,1,1]) sage: E2 Elliptic Curve defined by y^2 + (-2.00000000000000)*y = x^3 + 1.00000000000000*x + 1.00000000000000 over Complex Field with 53 bits of precision sage: E2.j_invariant() 61.7142857142857 # false true true false http://www.sagemath.org/ https://en.wikipedia.org/wiki/SageMath 2 2 sagemath.org Sage https://github.com/MagicStack/MagicPython 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 Sage 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 dtrace DTrace 2005 26 pl http://dtrace.org/ 3 280 4 24085 true 3 berkeleydb iterm2 pony pl 1907 2080 534 0 dtrace-script dtrace c_cpp clike text/x-csrc source.c programming false d/DTrace.d 359 2005 2018 3 23 2010 2010 solaris freebsd linux c assembly-language java erlang javascript perl php python ruby tcl mysql postgresql 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. 2004 141 92 300 1179136 DTrace is a comprehensive dynamic tracing framework created by Sun Microsystems for troubleshooting kernel and application problems on production systems in real time. DTrace is a comprehensive dynamic tracing framework created by Sun Microsystems for troubleshooting kernel and application problems on production systems in real time. Sun Microsystems DTrace is a comprehensive dynamic tracing framework created by Sun Microsystems for troubleshooting kernel and application problems on production systems in real time. d d 926 0 31 d text United States # Syscall count by syscall dtrace -n 'syscall:::entry { @num[probefunc] = count(); }' # Syscall count by process dtrace -n 'syscall:::entry { @num[pid,execname] = count(); }' "#!/usr/sbin/dtrace -qs BEGIN { printf(""Hello World""); exit(0); } " "/* * This software is in the public domain. * * $Id: counts.d 10510 2005-08-15 01:46:19Z kateturner $ */ #pragma D option quiet self int tottime; BEGIN { tottime = timestamp; } php$target:::function-entry @counts[copyinstr(arg0)] = count(); } END { printf(""Total time: %dus\n"", (timestamp - tottime) / 1000); printf(""# calls by function:\n""); printa(""%-40s %@d\n"", @counts); } " "# New processes with arguments dtrace -n 'proc:::exec-success { trace(curpsinfo->pr_psargs); }' # Files opened by process dtrace -n 'syscall::open*:entry { printf(""%s %s"",execname,copyinstr(arg0)); }' # Syscall count by program dtrace -n 'syscall:::entry { @num[execname] = count(); }' # Syscall count by syscall dtrace -n 'syscall:::entry { @num[probefunc] = count(); }' # Syscall count by process dtrace -n 'syscall:::entry { @num[pid,execname] = count(); }' # Disk size by process dtrace -n 'io:::start { printf(""%d %s %d"",pid,execname,args[0]->b_bcount); }' # Pages paged in by process dtrace -n 'vminfo:::pgpgin { @pg[execname] = sum(arg0); }'" DTrace /* */ printf """" true true true false true https://en.wikipedia.org/wiki/DTrace 2 0 dtrace.org DTrace https://github.com/textmate/c.tmbundle DTrace 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 regex Regular Expressions 1951 Stephen Kleene 17 queryLanguage 0 281 2 24082 true 0 queryLanguage 58614 0 regexp or regex text source.regexp data false 68 2016 2017 4 1 1994 unix perl sed awk ascii snobol grep vi emacs-editor tcl postgresql unicode raku peg sgml pcre php java python linux vim javascript ruby c lisp utf-8 isbn "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." 2001 3569 2228 2877 25717 University of Wisconsin-Madison regexp regex https://cheatsheets.zip/regex 23343 0 17 1 text United States \b(\d*1[1-3]th|\d*0th|(?:(?!11st)\d)*1st|\d*2nd|(?:(?!13rd)\d*)3rd|\d*[4-9]th)\b https://reddit.com/r/regex Hello World contains a character other than a, b, and c. false false false https://en.wikipedia.org/wiki/Regular_expression 0 0 https://github.com/Alhadis/language-regexp Regular Expression squirrel Squirrel 2003 Alberto Demichelis 41 pl http://squirrel-lang.org/ 2 282 5 8 24082 true 2 cloc squirrel https://github.com/albertodemichelis/squirrel pl 284 433 1513 0 c_cpp clike text/x-c++src source.nut programming false s/Squirrel.nut 359 2005 2018 1 23 2015 2024 304 53 148 2 26166 2005 2003 javascript lua python minid ruby 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. 2005 65 39 173 2819069 https://sourceforge.net/p/squirrel/bugs nut nut nut nut restructuredtext cpp squirrel make cmake c yaml python true 600 0 54 1 true nut https://tio.run/#squirrel http://squirrel-lang.org/squirreldoc/ text https://github.com/antlr/grammars-v4/tree/master/squirrel Squirrel http://www.rosettacode.org/wiki/Category:Squirrel squirrel3 Italy Squirrel "#!/usr/bin/squirrelsh // Hello world in Squirrel printl(""Hello, world!"");" "print(""Hello World"");" "//example from http://www.squirrel-lang.org/#documentation local table = { a = ""10"" subtable = { array = [1,2,3] }, [10 + 123] = ""expression index"" } local array=[ 1, 2, 3, { a = 10, b = ""string"" } ]; foreach (i,val in array) { ::print(""the type of val is""+typeof val); } ///////////////////////////////////////////// class Entity { constructor(etype,entityname) { name = entityname; type = etype; } x = 0; y = 0; z = 0; name = null; type = null; } function Entity::MoveTo(newx,newy,newz) { x = newx; y = newy; z = newz; } class Player extends Entity { constructor(entityname) { base.constructor(""Player"",entityname) } function DoDomething() { ::print(""something""); } } local newplayer = Player(""da playar""); newplayer.MoveTo(100,200,300); " https://riju.codes/squirrel "print(""Hello, world!\n"") " https://twitter.com/squirrellang "class BaseVector { constructor(...) { if(vargv.len() >= 3) { x = vargv[0]; y = vargv[1]; z = vargv[2]; } } x = 0; y = 0; z = 0; } class Vector3 extends BaseVector { function _add(other) { if(other instanceof ::Vector3) return ::Vector3(x+other.x,y+other.y,z+other.z); else throw ""wrong parameter""; } function Print() { ::print(x+"",""+y+"",""+z+""\n""); } } local v0 = Vector3(1,2,3) local v1 = Vector3(11,12,13) local v2 = v0 + v1; v2.Print();" Squirrel https://github.com/albertodemichelis/squirrel // print """" true true true false true https://en.wikipedia.org/wiki/Squirrel_(programming_language) 0 0 Squirrel squirrel-lang.org Squirrel https://github.com/textmate/c.tmbundle Squirrel mercury Mercury 1995 Zoltan Somogyi 33 pl http://www.mercurylang.org 1 283 3 24081 2226 true 1 plasma pl 594 646 715 0 mmi prolog source.mercury programming false m/Mercury.m 31 2014 2015 10 1 2011 1995 autocode mercurial ia-32 arm unix linux solaris freebsd android prolog hope haskell c java csharp erlang assembly-language cil vim emacs-editor eclipse-editor curry alice standard-ml oz visual-prolog 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). 2001 74 83 260 19726 University of Melbourne m m moo m m c true 939 0 38 1 https://mercurylang.org/documentation/documentation.html text 4418 http://www.rosettacode.org/wiki/Category:Mercury Australia ":- module hello. :- interface. :- import_module io. :- pred main(io::di, io::uo) is det. :- implementation. main(!IO) :- io.write_string(""Hello World\n"", !IO). " "% ""Hello World"" in Mercury. % This source file is hereby placed in the public domain. -fjh (the author). :- module hello. :- interface. :- import_module io. :- pred main(io::di, io::uo) is det. :- implementation. main(!IO) :- io.write_string(""Hello, world\n"", !IO). " https://www.reddit.com/r/mercury ":- module fib. :- interface. :- import_module io. :- pred main(io::di, io::uo) is det. :- implementation. :- import_module int. :- func fib(int) = int. fib(N) = (if N =< 2 then 1 else fib(N - 1) + fib(N - 2)). main(!IO) :- io.write_string(""fib(10) = "", !IO), io.write_int(fib(10), !IO), io.nl(!IO). % Could instead use io.format(""fib(10) = %d\n"", [i(fib(10))], !IO)." Mercury % io.write_string """" true true true false true https://en.wikipedia.org/wiki/Mercury_(programming_language) 0 16 https://hopl.info/showlanguage.prx?exp=2226 Mercury mercurylang.org Mercury https://github.com/sebgod/mercury-tmlanguage Mercury 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 wenyan 文言文編程語言 2019 Lingdong Huang 17 pl https://wy-lang.org/ https://wy-lang.org/spec.html 0 0.4.0 284 1 10 24078 true 0 https://github.com/wenyan-lang/wenyan pl 2019 2024 249 1098 19514 203 false Chinese wenyan 2019 2023 1039 67 163 45 83795 https://wy-lang.org/ide.html 文言文編程語言 A programming language for the ancient Chinese. 文言文編程語言 A programming language for the ancient Chinese. 文言文編程語言 A programming language for the ancient Chinese. typescript markdown javascript json html yaml svg css make toml javascript python ruby true 22877 0 30 1 false 0 true 吾有一數。曰三。名之曰「甲」。為是「甲」遍。吾有一言。曰「「問天地好在。」」。書之。云云。 https://github.com/wenyan-lang/wenyan 0 0 ink ink 2015 Joseph Humfrey 20 esolang http://www.inklestudios.com/ink 0 v1.1.1 285 3 7 24076 true 0 https://github.com/inkle/ink esolang 2016 2024 2015 116 483 3991 327 false i/Ink.ink 2015 2025 1553 84 146 10 32966 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. 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. https://github.com/inkle 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. ink csharp markdown xml json powershell bourne-shell yaml true 5526 0 27 1 false 1 true text 3033 United Kingdom - I looked at Monsieur Fogg * ... and I could contain myself no longer. 'What is the purpose of our journey, Monsieur?' 'A wager,' he replied. * * 'A wager!'[] I returned. He nodded. * * * 'But surely that is foolishness!' * * * 'A most serious matter then!' - - - He nodded again. * * * 'But can we win?' 'That is what we will endeavour to find out,' he answered. * * * 'A modest wager, I trust?' 'Twenty thousand pounds,' he replied, quite flatly. * * * I asked nothing further of him then[.], and after a final, polite cough, he offered nothing more to me. <> * * 'Ah[.'],' I replied, uncertain what I thought. - - After that, <> * ... but I said nothing[] and <> - we passed the day in silence. - -> END Hello World https://riju.codes/ink std := load('../../../opt/ink/std') str := load('../../../opt/ink/str') log := std.log log('Hello, world!') https://twitter.com/inklestudios Ink https://github.com/inkle/ink 0 0 expect Expect 1990 19 pl http://core.tcl.tk/expect/index 23 286 2 24074 1622 true 23 ad-hoc beef borgo cir cmake crmsh dern ec ecl flow hhvm icarus invokator java menhir micropython oil plasma poke racket reko-decompiler skip wonkey pl false 1990 tcl unix regex python ruby perl 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. 2004 198 52 273 1161030 www.tcl.tk/community/coreteam true 1011 0 21 exp text 2323 Various "# Assume $remote_server, $my_user_id, $my_password, and $my_command were read in earlier # in the script. # Open a telnet session to a remote server, and wait for a username prompt. spawn telnet $remote_server expect ""username:"" # Send the username, and then wait for a password prompt. send ""$my_user_id\r"" expect ""password:"" # Send the password, and then wait for a shell prompt. send ""$my_password\r"" expect ""%"" # Send the prebuilt command, and then wait for another shell prompt. send ""$my_command\r"" expect ""%"" # Capture the results of the command into a variable. This can be displayed, or written to disk. set results $expect_out(buffer) # Exit the telnet session, and wait for a special end-of-file character. send ""exit\r"" expect eof" "#timeout is a predefined variable in expect which by default is set to 10 sec #spawn_id is another default variable in expect. #It is good practice to close spawn_id handle created by spawn command set timeout 60 spawn ssh $user@machine while {1} { expect { eof {break} ""The authenticity of host"" {send ""yes\r""} ""password:"" {send ""$password\r""} ""*\]"" {send ""exit\r""} } } wait close $spawn_id" # true true false https://en.wikipedia.org/wiki/Expect 3 0 https://hopl.info/showlanguage.prx?exp=1622 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 smtp SMTP 1982 Jon Postel 15 protocol 0 287 1 24073 true 2 nntp tmtp protocol false Simple Mail Transfer Protocol smtp 1982 ftp http tls tcp udp ascii mime utf-8 mbox doi 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. 2001 2662 794 1436 27675 https://datatracker.ietf.org/doc/html/rfc788 USC Viterbi School of Engineering 13330 0 15 1 https://www.rfc-editor.org/rfc/rfc5321 na 9812 United States S: 220 smtp2.example.com ESMTP Postfix C: EHLO bob.example.com S: 250-smtp2.example.com Hello bob.example.org [192.0.2.201] S: 250-SIZE 14680064 S: 250-PIPELINING S: 250 HELP https://en.wikipedia.org/wiki/Simple_Mail_Transfer_Protocol 1 0 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 wolfram Wolfram Language 1988 Stephen Wolfram 33 pl https://www.wolfram.com/language/ 0 288 3 24070 true 0 pl false w/WolframLanguage.wl 721 4 wolframlanguage https://www.wolframcloud.com/ 1988 mathematica-editor apl c lisp pascal prolog simula smalltalk julia mathematica unity-engine The Wolfram Language, a general multi-paradigm programming language developed by Wolfram Research, is the programming language of mathematical symbolic computation program Mathematica and the Wolfram Programming Cloud. It emphasizes symbolic computation, functional programming, and rule-based programming and can employ arbitrary structures and data. It includes built-in functions for generating and running Turing machines, creating graphics and audio, analyzing 3D models, matrix manipulations, and solving differential equations. It is extensively documented. The Wolfram language was released for the Raspberry Pi in 2013 with the goal of making it free for all Raspberry Pi users. It was controversially included in the recommended software bundle that the Raspberry Pi Foundation provides for beginners. Plans to port the Wolfram language to the Intel Edison were announced after the board's introduction at CES 2014. There was also a short lived proposal to make Wolfram libraries compatible with the Unity game engine, giving game developers access to the language's high level functions. 2013 199 123 156 40205956 Wolfram Research nb m wl wl nb m wl false 1626 0 40 1 text "(* Hello world in Wolfram Language *) CloudDeploy[""Hello World""]" "Print[""Hello World""]; " https://reddit.com/r/wolframlanguage https://riju.codes/wolframlanguage "Print[""Hello, world!""] " WolframLanguage https://www.meetup.com/topics/wolfram (* *) Print """" true false true true true false true true https://github.com/mmatera/iwolfram https://en.wikipedia.org/wiki/Wolfram_Language 2 0 Wolfram title|year|author|goodreadsId|rating|ratings|reviews\nAn Elementary Introduction to the Wolfram Language|2015|Stephen Wolfram|47752634|4.22|63|9\nHands-On Start to Wolfram Mathematica: And Programming with the Wolfram Language|2015|Cliff Hastings|46155341|4.29|14|2 pov-ray-sdl POV-Ray SDL 1991 Chris Cason 26 pl 0 v3.8.0-x.tokenizer.9996595 289 1 26 24069 true 0 https://github.com/POV-Ray/povray pl 482 493 3 0 pov-ray or povray text source.pov-ray sdl programming 2013 2024 2013 99 282 1334 207 false 12 POVRay graphics.py 2013 2024 1035 23 11792 190 2085034 Persistence of Vision Raytracer Pty. Ltd pov inc pov inc cpp c html xml ini bourne-shell make m4 markdown pascal yaml ada assembly-language cmake csharp css perl smalltalk sas awk python wasm powershell javascript diff php true 2404 0 55 1 false 3 true text United States http://www.povray.org/documentation/view/3.6.0/224/ "// This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License. // To view a copy of this license, visit http://creativecommons.org/licenses/by-sa/3.0/ or send a // letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. // Persistence Of Vision Ray Tracer Include File // File: water.inc // Desc: water for 'balcony.pov' demonstration scene // Date: July/August 2001 // Auth: Christoph Hormann // Updated: 09Aug2008 (jh) for v3.7 distribution /*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*/ #if (version < 3.7) #version 3.5; #end #include ""functions.inc"" #declare RMF=function{ f_ridged_mf(x, y, z, 0.07, 2.2, 7, 0.6, 0.9, 1)} #declare M_Watx4 = material { texture { pigment { color rgbt <0.2, 0.22, 0.21, 0.94> } finish { diffuse 0.0 ambient -0.2 reflection { 0.0, 0.95 fresnel on } conserve_energy specular 0.4 roughness 0.007 } normal{ function { RMF(x, y, z) } 0.8 scale 0.3 } } interior { ior 1.31 fade_distance 5 fade_power 1001.0 fade_color <0.02, 0.20, 0.06> } } plane { z, -1 material { M_Watx4 } hollow on } plane { z, -12.0 texture { pigment { color rgb 0 } finish { ambient 0.0 diffuse 0.0 } } hollow on } /*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*/" POVRay https://github.com/POV-Ray/povray // /* */ true true true true true false 0 0 POV-Ray SDL https://github.com/c-lipka/language-povray POV-Ray SDL openscad OpenSCAD 2010 Marius Kintel and Clifford Wolf 31 pl cad 3d http://www.openscad.org 0 290 3 23 24069 true 1 csg https://github.com/openscad/openscad pl 1469 1781 10989 3 "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""" scad source.scad programming false 12 2011 2017 2 2 2009 2025 12480 312 3508 80 505908 2010 opengl linux freebsd ia-32 dxf 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. 2010 100 126 132 25778048 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. 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. https://opencollective.com/openscad 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. scad scad cpp svg bourne-shell json xml qt cmake markdown python yaml diff c javascript html css objective-cpp glsl yacc lex make nix bash dockerfile true 1034 0 58 https://web.libera.chat/?channel=#openscad 2 false scad text http://www.rosettacode.org/wiki/Category:Openscad Norway https://en.wikipedia.org/wiki/OpenSCAD " cube(5); x = 4+y; rotate(40) square(5,10); translate([10,5]) { circle(5); square(4); } rotate(60) color(""red"") { circle(5); square(4); } color(""blue"") { translate([5,3,0]) sphere(5); rotate([45,0,45]) { cylinder(10); cube([5,6,7]); } }" https://floss.social/@OpenSCAD // Simple sphere in OpenSCAD sphere( r=10 ); https://riju.codes/openscad "echo(""Hello, world!""); " https://github.com/openscad/openscad // true true false https://en.wikipedia.org/wiki/OpenSCAD 2 0 OpenSCAD https://github.com/tbuser/openscad.tmbundle 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 OpenSCAD hack Hack 2014 Julien Verlaguet and Alok Menghrajani and Drew Paroski 36 pl http://hacklang.org/ 0 291 5 24068 true 0 pl 2993 3242 68473 2 "author name avatar url language languageColor stars forks currentPeriodStars description\nfacebook fbctf https://github.com/facebook.png https://github.com/facebook/fbctf Hack #878787 5992 1205 31 ""Platform to host Capture the Flag competitions""" php php application/x-httpd-php source.hack programming false h/Hack.hh 509 2005 2018 28 28 33 2013 2014 php ocaml java csharp scala haskell actionscript html parrot-vm Hack is a programming language for the HipHop Virtual Machine (HHVM), created by Facebook as a dialect of PHP. The language implementation is open-source, licensed under the BSD License. Hack allows programmers to use both dynamic typing and static typing. This kind of a type system is called gradual typing, which is also implemented in other programming languages such as ActionScript. Hack's type system allows types to be specified for function arguments, function return values, and class properties; however, types of local variables are always inferred and cannot be specified. 2014 243 156 209 42257880 Facebook hack hh hhi php hh true 1436 19 43 3 https://docs.hhvm.com/hack/ text 8412 http://www.rosettacode.org/wiki/Category:Hack > function main(): void { echo ""Hello, world!\n""; }" https://twitter.com/hacklang bit sequence table *) ftbl : ARRAY [0..255] OF CARDINAL; (* frequncey table *) wBf,rb1,rb2 : CARDINAL; wbc,rbc,smc : INTEGER; chid : IOChan.ChanId; END; lclDataTp = POINTER TO lclDataT; charp = POINTER TO CHAR; VAR did : IOLink.DeviceId; ldt : lclDataTp; PROCEDURE Shf(a:CARDINAL; b : INTEGER) : CARDINAL; (* shl a,b (or shr) *) BEGIN RETURN SYSTEM.CAST(CARDINAL,SYSTEM.SHIFT(SYSTEM.CAST(BITSET,a),b)); END Shf; PROCEDURE wrDword(a:CARDINAL); (* write 4 bytes to file *) BEGIN IOChan.RawWrite(ldt^.chid,SYSTEM.ADR(a),4); END wrDword; PROCEDURE rdDword() : CARDINAL; (* read 4 bytes from file *) VAR a,z : CARDINAL; BEGIN a:=0; IOChan.RawRead(ldt^.chid,SYSTEM.ADR(a),4,z); RETURN a; END rdDword; PROCEDURE wrSmb(ch : CHAR); (* write bit sequence for code ch *) VAR v,h : CARDINAL; b,c : INTEGER; BEGIN WITH ldt^ DO v:=htbl[ORD(ch)].vl; c:=htbl[ORD(ch)].cnt; IF c+wbc<=32 THEN wBf:=Shf(wBf,c); wBf:=wBf+v; wbc:=wbc+c; IF wbc=32 THEN wrDword(wBf); wBf:=0; wbc:=0; END; RETURN; END; b:=c+wbc-32; h:=Shf(v,-b); wBf:=Shf(wBf,32-wbc)+h; wrDword(wBf); wBf:=v-Shf(h,b); wbc:=b; END; END wrSmb; PROCEDURE flush(); (* write data in buffer *) BEGIN WITH ldt^ DO wBf:=Shf(wBf,32-wbc); wrDword(wBf); END; END flush; PROCEDURE getSym() : CHAR; (* find code for first bit sequence in buffer *) VAR t,i : CARDINAL; b : INTEGER; BEGIN WITH ldt^ DO IF rbc<=32 THEN rb2:=rdDword(); t:=Shf(rb2,-rbc); IF rbc=32 THEN t:=0; END; rb1:=rb1+t; rb2:=Shf(rb2,32-rbc); IF rbc=0 THEN rb2:=0; END; rbc:=rbc+32; END; FOR i:=0 TO 255 DO t:=Shf(rb1,htbl[i].cnt-32); IF t=htbl[i].vl THEN rb1:=Shf(rb1,htbl[i].cnt); b:=32-htbl[i].cnt; t:=Shf(rb2,-b); rb1:=rb1+t; rb2:=Shf(rb2,32-b); rbc:=rbc+b-32; RETURN CHR(i); END; END; END; END getSym; PROCEDURE Insert(s : smbTp); (* insert new character in Huffman's tree *) VAR cr : smbTp; BEGIN WITH ldt^ DO IF tRoot=NIL THEN cr:=tRoot; tRoot:=s; s^.next:=cr; RETURN; ELSIF tRoot^.n<=s^.n THEN cr:=tRoot; tRoot:=s; s^.next:=cr; RETURN; END; cr:=tRoot; WHILE (cr^.next<>NIL) & (cr^.next^.n>s^.n) DO cr:=cr^.next; END; s^.next:=cr^.next; cr^.next:=s; END; END Insert; PROCEDURE BuildTree(); (* build Huffman's tree *) VAR cr,ocr,ncr : smbTp; BEGIN WITH ldt^ DO LOOP ocr:=NIL; cr:=tRoot; WHILE cr^.next^.next<>NIL DO ocr:=cr; cr:=cr^.next; END; NEW(ncr); ncr^.n:=cr^.n+cr^.next^.n; ncr^.left:=cr; ncr^.right:=cr^.next; IF ocr<>NIL THEN ocr^.next:=NIL; Insert(ncr); ELSE tRoot:=NIL; Insert(ncr); EXIT; END; END; END; END BuildTree; PROCEDURE BuildTable(cr: smbTp; vl,n: CARDINAL); (* build table: code -> bit sequence *) BEGIN WITH ldt^ DO IF cr^.left=NIL THEN htbl[ORD(cr^.ch)].vl:=vl; htbl[ORD(cr^.ch)].cnt:=n; DISPOSE(cr); RETURN; END; vl:=vl*2; BuildTable(cr^.left,vl,n+1); BuildTable(cr^.right,vl+1,n+1); DISPOSE(cr); END; END BuildTable; PROCEDURE clcTab(); (* build code/bitseq. table from frequency table *) VAR i : CARDINAL; s : smbTp; BEGIN WITH ldt^ DO tRoot:=NIL; FOR i:=0 TO 255 DO NEW(s); s^.ch:=CHR(i); s^.n:=ftbl[i]; s^.left:=NIL; s^.right:=NIL; s^.next:=NIL; Insert(s); END; BuildTree(); BuildTable(tRoot,0,0); END; END clcTab; PROCEDURE iniHuf(); VAR i : CARDINAL; BEGIN WITH ldt^ DO FOR i:=0 TO 255 DO ftbl[i]:=1; END; wBf:=0; wbc:=0; rb1:=0; rb2:=0; rbc:=0; smc:=0; clcTab(); END; END iniHuf; PROCEDURE RawWrite(x: IOLink.DeviceTablePtr; buf: SYSTEM.ADDRESS; len: CARDINAL); VAR i : CARDINAL; ch : CHAR; cht : charTap; BEGIN IF len = 0 THEN RETURN; END; ldt:=SYSTEM.CAST(lclDataTp,x^.cd); cht:=SYSTEM.CAST(charTap,buf); WITH ldt^ DO FOR i:=0 TO len-1 DO ch:=cht^[i]; wrSmb(ch); IF ch = 377C THEN wrSmb(ch); END; ftbl[ORD(ch)]:=ftbl[ORD(ch)]+1; smc:=smc+1; IF smc=rbldFrq THEN clcTab(); smc:=0; END; END; END; x^.result:=IOChan.ReadResult(ldt^.chid); END RawWrite; PROCEDURE RawRead(x: IOLink.DeviceTablePtr; buf: SYSTEM.ADDRESS; blen: CARDINAL; VAR len: CARDINAL); VAR i : CARDINAL; cht : charTap; ch : CHAR; BEGIN ldt:=SYSTEM.CAST(lclDataTp,x^.cd); cht:=SYSTEM.CAST(charTap,buf); IF (blen=0) OR (x^.result<>IOConsts.allRight) THEN len:=0; RETURN; END; WITH ldt^ DO FOR i:=0 TO blen-1 DO ch:=getSym(); IF ch = 377C THEN ch:=getSym(); IF ch = 0C THEN x^.result:=IOConsts.endOfInput; len:=i; cht^[i]:=0C; RETURN; END; END; cht^[i]:=ch; ftbl[ORD(ch)]:=ftbl[ORD(ch)]+1; smc:=smc+1; IF smc=rbldFrq THEN clcTab(); smc:=0; END; END; len:=blen; END; END RawRead; PROCEDURE CreateAlias(VAR cid: ChanId; io: ChanId; VAR res: OpenResults); VAR x : IOLink.DeviceTablePtr; BEGIN IOLink.MakeChan(did,cid); IF cid = IOChan.InvalidChan() THEN res:=ChanConsts.outOfChans ELSE NEW(ldt); IF ldt=NIL THEN IOLink.UnMakeChan(did,cid); res:=ChanConsts.outOfChans; RETURN; END; x:=IOLink.DeviceTablePtrValue(cid,did,IOChan.notAvailable,""""); ldt^.chid:=io; x^.cd:=ldt; x^.doRawWrite:=RawWrite; x^.doRawRead:=RawRead; res:=ChanConsts.opened; iniHuf(); x^.result:=IOConsts.allRight; END; END CreateAlias; PROCEDURE DeleteAlias(VAR cid: ChanId); VAR x : IOLink.DeviceTablePtr; BEGIN x:=IOLink.DeviceTablePtrValue(cid,did,IOChan.notAvailable,""""); ldt:=x^.cd; IF ldt^.rbc=0 THEN wrSmb(377C); wrSmb(0C); flush(); END; DISPOSE(ldt); IOLink.UnMakeChan(did,cid); END DeleteAlias; BEGIN IOLink.AllocateDeviceId(did); END HuffChan. " Modula-2 ABS EXCL LONGINT REAL BITSET FALSE LONGREAL SIZE BOOLEAN FLOAT MAX TRUE CAP HALT MIN TRUNC CARDINAL HIGH NIL VAL CHAR INC ODD CHR INCL ORD DEC INTEGER PROC Modula 2 (* *) WriteString """" TRUE FALSE true true false true false true false true true false true https://en.wikipedia.org/wiki/Modula-2 1 0 https://hopl.info/showlanguage.prx?exp=817 Modula-2 Modula-2 https://github.com/harogaston/Sublime-Modula-2 year|publisher|title|authors|isbn13\n1985|Springer-Verlag|Programming in Modula-2 (Texts and monographs in computer science)|Wirth, Niklaus|9780387150789 Modula-2 modula-2 developer hjson Hjson 2014 Christian Zangl 24 dataNotation https://hjson.github.io/ 0 294 1 8 24060 true 0 https://github.com/hjson/hjson dataNotation 2014 2024 2014 29 57 2647 24 false 2014 2025 257 22 253 5 11948 2015 Hjson is a syntax extension to JSON. It's NOT a proposal to replace JSON or to incorporate it into the JSON spec itself. It's intended to be used like a user interface for humans, to read and edit before passing the JSON data to the machine. Hjson is a syntax extension to JSON. It's NOT a proposal to replace JSON or to incorporate it into the JSON spec itself. It's intended to be used like a user interface for humans, to read and edit before passing the JSON data to the machine. https://github.com/hjson Hjson is a syntax extension to JSON. It's NOT a proposal to replace JSON or to incorporate it into the JSON spec itself. It's intended to be used like a user interface for humans, to read and edit before passing the JSON data to the machine. json html markdown javascript css xml svg bash true 2842 0 36 1 false text Austria { # hash style comments # (because it's just one character) // line style comments // (because it's like C/JavaScript/...) /* block style comments because it allows you to comment out a block */ # Everything you do in comments, # stays in comments ;-} } https://github.com/hjson/hjson # /* */ true true true false 0 0 hjson.org emojicode Emojicode 2016 Theo Weidmann 22 pl http://www.emojicode.org/ 0 v0.8.4 295 2 10 24058 true 0 https://github.com/emojicode/emojicode pl 2015 2024 2016 49 159 3244 21 false e/Emojicode.emojic 2016 2023 1401 27 3975 28 230518 2015 https://github.com/emojicode emojic html javascript cpp cmake css markdown c python bourne-shell yaml true 3750 0 32 1 false 0 true https://tio.run/#emojicode text http://www.rosettacode.org/wiki/Category:Emojicode Unknown 🏁 🍇 😀 🔤Hello World🔤❗️ 🍉 https://riju.codes/emojicode 🏁 🍇 😀 🔤Hello, world!🔤❗️ 🍉 https://twitter.com/real_emojicode Emojicode https://github.com/emojicode/emojicode 2 0 emojicode.org 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 aws AWS 2006 15 cloud https://aws.amazon.com/ 0 296 0 24057 false 0 cloud false 454966 887 Amazon Web Services 2006 login azure redis mysql postgresql android google-cloud 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. 2005 2390 1102 1093 1691376 Amazon 263168 2512 15 text United States https://twitter.com/awscloud https://www.meetup.com/topics/aws https://en.wikipedia.org/wiki/Amazon_Web_Services 2 0 aws.amazon.com aws 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 gogs-editor gogs-editor 2014 Joe Chen 16 editor https://gogs.io/ 0 v0.13.0 297 0 15 24057 false 0 https://github.com/gogs/gogs editor 2014 2024 2014 1017 4842 44623 929 false 2014 2025 6195 599 2098 200 205259 https://try.gogs.io/user/login Gogs is a painless self-hosted Git service Gogs is a painless self-hosted Git service https://github.com/gogs Gogs is a painless self-hosted Git service go javascript html ini bourne-shell markdown yaml less svg css json dockerfile xml toml sql true 59750 0 31 1 false 0 true https://gogs.io/docs China https://github.com/gogs/gogs 0 0 gogs.io gap GAP 1986 gap 33 pl http://www.gap-system.org/ 0 11.5.3 298 3 29 24054 2668 true 0 https://github.com/gap-system/gap pl 3657 4082 3760 0 text source.gap programming 2015 2024 1996 37 161 781 495 false 10 2010 2018 9 3 Groups, Algorithms and Programming algebra.py 1996 2025 10871 76 5016 431 2354046 2000 1986 c unix sagemath GAP (Groups, Algorithms and Programming) is a computer algebra system for computational discrete algebra with particular emphasis on computational group theory. 2016 1 66 1 262144 RWTH Aachen University g gap gd gi tst g gd gi gap c assembly-language gdscript xml bourne-shell m4 cpp make markdown perl tex ada csharp yaml python html pascal cmake vim-script javascript yacc lisp lex sas fortran-77 css ruby csv ini true 1567 0 63 1 false 11 true https://tio.run/#gap text 4114 http://www.rosettacode.org/wiki/Category:GAP Germany GAP "gap> START_TEST(""Test of factor groups and natural homomorphisms""); gap> G:=HeisenbergPcpGroup(2); Pcp-group with orders [ 0, 0, 0, 0, 0 ] gap> H:=Subgroup(G,[G.2,G.3,G.4,G.5]); gap> K:=G/H; gap> NaturalHomomorphism(K); gap> A:=Subgroup(H, [G.3]); Pcp-group with orders [ 0 ] gap> B:=Subgroup(Subgroup(G,[G.1,G.4,G.5]), [G.4]); Pcp-group with orders [ 0 ] gap> Normalizer(A,B); Pcp-group with orders [ 0 ] gap> # The following used to trigger the error ""arguments must have a common parent group"" gap> Normalizer(B,A); Pcp-group with orders [ 0 ] gap> STOP_TEST( ""factor.tst"", 10000000); " GAP https://riju.codes/gap "Print(""Hello, world!\n""); " https://twitter.com/gap_system gap> G:=SmallGroup(8,1); # Set G to be a group of order 8. gap> i:=IsomorphismPermGroup(G); # Find an isomorphism from G to a group of permutations gap> Image(i,G); # The image of G under I - these are the generators of im G. Group([ (1,5,3,7,2,6,4,8), (1,3,2,4)(5,7,6,8), (1,2)(3,4)(5,6)(7,8) ]) gap> Elements(Image(i,G)); # All the elements of im G. [ (), (1,2)(3,4)(5,6)(7,8), (1,3,2,4)(5,7,6,8), (1,4,2,3)(5,8,6,7), (1,5,3,7,2,6,4,8), (1,6,3,8,2,5,4,7), (1,7,4,5,2,8,3,6), (1,8,4,6,2,7,3,5) ] https://github.com/gap-system/gap # true true false https://en.wikipedia.org/wiki/GAP_(programming_language) 3 0 https://hopl.info/showlanguage.prx?exp=2668 gap-system.org GAP https://github.com/dhowden/gap-tmbundle year|publisher|title|authors|isbn13\n2012|O'Reilly Media|HTML5 and JavaScript Web Apps: Bridging the Gap Between the Web and the Mobile Web|Hales, Wesley|9781449320515\n1992|Psychology Press|The Symbolic And Connectionist Paradigms: Closing The Gap (cognitive Science Series : Technical Monographs And Edited Collection)|Dinsmore, John|9780805810806\n1995|Spectra|Chaos and Order: The Gap Into Madness (The Gap Cycle)|Donaldson, Stephen R.|9780553572537 GAP lil Lil 2022 John Earnest 69 pl arrayLang http://beyondloom.com/tools/trylil.html 0 299 1 12 24051 true 0 https://github.com/JohnEarnest/Decker pl 2022 2024 33 51 949 2 false Learning In Layers 2022 2025 788 22 219 5 48810 http://beyondloom.com/tools/trylil.html 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. 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. https://beyondloom.com/decker/ 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. markdown bourne-shell javascript c xml html vim-script awk make yaml lisp nix true 1126 0 154 sql lua k q sql lua hypercard 1 false https://beyondloom.com/decker/lil.html United States on mode a do # line comment r:() each x in a r[x]:1+r[x] end first extract key orderby value desc from r end floor cos sin tan exp ln sqrt count first last sum min max raze prod range keys list rows cols table typeof flip mag unit heading split fuse dict take drop in join cross parse format unless limit like window each in while on do end if elseif else where by orderby asc desc select extract update from insert with into send local https://github.com/JohnEarnest/Decker # """" : false true true false false false true true false false false false true true true true false true true false true false true false true false true true true false true false true false false false true false false false true false false true true true 0 0 ron Ron 2015 Juniper Tyree 22 dataNotation https://docs.rs/ron 0 v0.8.1 300 1 4 24050 true 0 https://github.com/ron-rs/ron dataNotation 2015 2024 2015 26 118 3238 31 false Rusty Object Notation 2015 2025 711 75 118 6 27835 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. 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. https://github.com/ron-rs 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. rust markdown yaml toml true 3669 0 29 1 false 0 true https://github.com/antlr/grammars-v4/tree/master/ron Finland "GameConfig( // optional struct name window_size: (800, 600), window_title: ""PAC-MAN"", fullscreen: false, mouse_sensitivity: 1.4, key_bindings: { ""up"": Up, ""down"": Down, ""left"": Left, ""right"": Right, // Uncomment to enable WASD controls /* ""W"": Up, ""A"": Down, ""S"": Left, ""D"": Right, */ }, difficulty_options: ( start_difficulty: Easy, adaptive: false, ), )" https://github.com/ron-rs/ron // /* */ true true true false 0 0 pygments Pygments 2006 Georg Brandl 16 library https://pygments.org/ 0 2.18.0 301 0 123 24049 true 3 ace highlightjs prismjs https://github.com/pygments/pygments library 2019 2024 2006 38 650 1767 470 false 2006 2025 7047 926 2681 29 1621248 https://pygments.org/demo/ 2007 Pygments is a generic syntax highlighter suitable for use in code hosting, forums, wikis or other applications that need to prettify source code. Pygments is a generic syntax highlighter suitable for use in code hosting, forums, wikis or other applications that need to prettify source code. https://github.com/pygments Pygments is a generic syntax highlighter suitable for use in code hosting, forums, wikis or other applications that need to prettify source code. python html restructuredtext scala graphql prolog ruby javascript lisp c cpp haskell yaml xml dtd make bash sed bourne-shell scheme standard-ml java clojure xquery php ada raku actionscript css groovy assembly-language json pascal tex nim haxe fortran-90 coffeescript lean toml clean nemerle perl powershell erlang d ini idl agda odin sql handlebars gdscript gherkin visual-basic glsl go mathematica smalltalk cobol crystal ocaml racket c-shell f-sharp rust vim-script logtalk xhtml julia csharp visual-basic.net zig brainfuck fennel lua elixir autohotkey r chapel fortran-77 vhdl hlsl objective-c xbase awk solidity pig idris nix qml saltstack reason mako cmake clojurescript meson markdown coldfusion kotlin swift elm rexx jsx liquid wasm xtend slim jcl logos cuda protobuf java-server-pages xslt apl dart asp.net gradle thrift dockerfile puppet coq forth true 4645 0 145 codemirror monaco highlightjs ace sublime-syntax tmlanguage 1 false 2 true Germany https://github.com/pygments/pygments 0 0 pygments.org turtle Turtle 2011 17 dataNotation 0 302 3 24048 true 4 n-triples notation3 notation3 trig-syntax dataNotation 137 0 text turtle text/turtle source.turtle data false 128 2013 2015 2 2 rdf.py 2011 rdf sparql xml utf-8 Terse RDF Triple Language (Turtle) is a syntax and file format for expressing data in the Resource Description Framework (RDF) data model. Turtle syntax is similar to that of SPARQL, an RDF query language. RDF represents information using semantic triples, which comprise a subject, predicate, and object. Each item in the triple is expressed as a Web URI. Turtle provides a way to group three URIs to make a triple, and provides ways to abbreviate such information, for example by factoring out common portions of URIs. For example: . 2006 542 189 124 6723738 ttl ttl typescript 2930 0 17 https://www.w3.org/TR/turtle/ text 9688 https://github.com/antlr/grammars-v4/tree/master/turtle "@prefix rdf: . @prefix dc: . @prefix ex: . dc:title ""RDF/XML Syntax Specification (Revised)"" ; ex:editor [ ex:fullname ""Dave Beckett""; ex:homePage ] ." "@prefix rdf: . @prefix dc: . @prefix ex: . dc:title ""RDF/XML Syntax Specification (Revised)"" ; ex:editor [ ex:fullname ""Dave Beckett""; ex:homePage ] ." Turtle " ""RDF/XML Syntax Specification (Revised)"" . _:bnode . _:bnode ""Dave Beckett"" . _:bnode ." https://github.com/stardog-union/stardog-language-servers/tree/master/packages/turtle-language-server true true https://en.wikipedia.org/wiki/Turtle_(syntax) 0 8 https://github.com/peta/turtle.tmbundle Turtle year|title|doi|citations|influentialCitations|authors|paperId\n2000|Here, there and everywhere - on the recurring use of turtle graphics in CS1|10.1145/359369.359375|43|1|M. Caspersen and H. Christensen|b71e2aea52609b20c645fccbd9ab3188aacd785a\n1976|The TV Turtle a Logo graphics system for raster displays|10.1145/800143.804735|6|1|H. Lieberman|ff6ec76822273609702a9d7ed8e95eb7018f6565\n2019|Using Programming Languages and Geographic Information System to Determine Spatial and Temporal Variability in a Green Turtle Foraging Population on Liuchiu Island, Taiwan.|10.6620/ZS.2019.58-18|5|0|Wan-Hwa Cheng and Ying-Tin Chan and Haisen Hong and B. Johnson and I. Cheng|9beb73cf867a46c69e48555a0e3c67b65f8e4687\n1978|Teaching young children to program in a LOGO turtle computer culture|10.1145/964041.964045|3|1|C. Solomon|69ea35d26b3dbdeb602e12244418e0c007825a92\n1991|Turtle goes to college: intrinsic representations and graphical integration|10.1080/0020739910220409|3|0|Uzi Armon and U. Leron|01e483adc5078537ee3fe85b2525e3d349b5c07c\n1991|Turtle walk through functional language|10.1145/122179.122188|2|0|Putnik Zoran and Budimac Zoran and Ivanović Mirjana|e71f3bb8f309712fe1076ea11b2f572587102ada\n1991|Turtle walk through functional language|10.1145/122179.122188|1|0|Z. Putnik and Z. Budimac and M. Ivanović|8457662dd608e1e948fa677c2eeb1c487fbbd25d\n2020|A Simplified Introduction to Virus Propagation Using Maple's Turtle Graphics Package Suitable for Children|10.1007/978-3-030-81698-8_22|1|0|E. Roanes-Lozano and E. Roanes-Macías|c6e114ae7fa24d578012dda3597b738c5e80fcaf yasnippet YASnippet 2008 Zhang Chiyuan 21 textMarkup http://joaotavora.github.com/yasnippet/ 0 0.14.0 303 2 5 24043 true 0 https://github.com/joaotavora/yasnippet textMarkup 261 264 403 snippet or yas text source.yasnippet markup 2011 2024 2008 75 313 2767 145 false 101 2016 2018 2 1 2008 2025 1443 76 39 6 9739 yasnippet lisp markdown css yaml make true 3984 0 27 1 false 0 true text # -*- mode: snippet -*- # name: fun # key: fun # expand-env: ((yas-indent-line 'fixed)) # -- ${1:function-name} :: ${2:type} $1 ${3:arguments} $0 "# name: Read stdin # key: stdin # group: es6 # -- new Promise(resolve => { let input = """"; process.stdin.setEncoding(""UTF8""); process.stdin.on(""readable"", () => { const chunk = process.stdin.read(); null !== chunk ? input += chunk : resolve(input); }) }).then(data => { $1 });" https://github.com/joaotavora/yasnippet # true true false 0 0 YASnippet https://github.com/Alhadis/language-emacs-lisp YASnippet algol-60 ALGOL 60 1960 John Backus and Friedrich L. Bauer and Julien Green and Charles Katz and John McCarthy and Peter Naur and Alan Perlis and Heinz Rutishauser and Klaus Samelson and Adriaan van Wijngaarden and Bernard Vauquois and Joseph Henry Wegstein and Michael Woodger 21 pl 0 304 3 24041 1807 true 6 algol-w espol modula oberon pascal simula pl false a/ALGOL 60.algol60 1960 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 "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." 2004 248 884 130 692878 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. 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. International Federation for Information Processing 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. 1260 0 35 13 http://www.algol60.org/4documentation.htm text https://github.com/antlr/grammars-v4/tree/master/algol60 procedure Absmax(a) Size:(n, m) Result:(y) Subscripts:(i, k); value n, m; array a; integer n, m, i, k; real y; comment The absolute greatest element of the matrix a, of size n by m, is transferred to y, and the subscripts of this element to i and k; begin integer p, q; y := 0; i := k := 1; for p := 1 step 1 until n do for q := 1 step 1 until m do if abs(a[p, q]) > y then begin y := abs(a[p, q]); i := p; k := q end end Absmax "BEGIN FILE F(KIND=REMOTE); EBCDIC ARRAY E[0:11]; REPLACE E BY ""HELLO WORLD""; WRITE(F, *, E); END. " 'PROGRAM' (HELLO) 'BEGIN' 'COMMENT' OPEN QUOTE IS '(', CLOSE IS ')', PRINTABLE SPACE HAS TO BE WRITTEN AS % BECAUSE SPACES ARE IGNORED; WRITE TEXT('('HELLO%WORLD')'); 'END' 'FINISH' ALGOL 60 WRITE """" true false true https://en.wikipedia.org/wiki/ALGOL_60 5 0 https://hopl.info/showlanguage.prx?exp=1807 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 systemverilog SystemVerilog 2002 37 pl 0 305 2 24040 true 0 pl 872 1052 9972 0 verilog verilog text/x-systemverilog source.systemverilog programming false 4 hdl.py 2002 verilog vhdl openvera java c property-specification-language axiom 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. 2005 225 305 385 2540686 Synopsys sv svh vh sv svh header file 1345 0 288 http://courses.eees.dei.unibo.it/LABMPHSENG/wp-content/uploads/2016/02/SystemVerilog_3.1a.pdf text https://github.com/antlr/grammars-v4/tree/master/verilog/systemverilog systemverilog http://www.rosettacode.org/wiki/Category:SystemVerilog function integer log2; input integer x; begin x = x-1; for (log2 = 0; x > 0; log2 = log2 + 1) x = x >> 1; end endfunction systemverilog class eth_frame; // Definitions as above covergroup cov; coverpoint dest { bins bcast[1] = {48'hFFFFFFFFFFFF}; bins ucast[1] = default; } coverpoint f_type { bins length[16] = { [0:1535] }; bins typed[16] = { [1536:32767] }; bins other[1] = default; } psize: coverpoint payload.size { bins size[] = { 46, [47:63], 64, [65:511], [512:1023], [1024:1499], 1500 }; } sz_x_t: cross f_type, psize; endgroup endclass 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 // /* */ true true true true true true true true true true true true true false true true https://en.wikipedia.org/wiki/SystemVerilog 9 3 SystemVerilog https://github.com/TheClams/SystemVerilog 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 SystemVerilog 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 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 kaitai kaitai 2016 Mikhail Yakshin 20 idl http://kaitai.io/ 0 306 1 3 24039 true 0 https://github.com/kaitai-io/kaitai_struct idl 2016 2024 2016 96 193 3922 491 false 2016 2024 997 17 24 1 515 https://ide.kaitai.io/ 2016 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. 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. http://kaitai.io/ 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. ksy markdown bourne-shell yaml true 4520 0 25 protobuf 1 false Various http://kaitai.io/ meta: id: tcp_segment endian: be seq: - id: src_port type: u2 - id: dst_port type: u2 - id: seq_num type: u4 - id: ack_num type: u4 https://twitter.com/kaitai_io https://github.com/kaitai-io/kaitai_struct 0 0 kaitai.io applescript Applescript 1993 41 pl https://developer.apple.com/library/content/documentation/AppleScript/Conceptual/AppleScriptX/AppleScriptX.html 0 307 4 24039 1830 true 0 pl 3803 4075 3425 0 osascript osascript applescript source.applescript programming false a/AppleScript.scpt 198 2006 2017 7 12 scripting.py 1993 hypertalk rexx hypercard ios xpath javascript perl python ruby tcl "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." 2002 200 496 791 88392 Apple scpt scptd AppleScript applescript scpt scpt applescript scpt scptd AppleScript false 1221 6 52 hypertalk applescript https://developer.apple.com/library/archive/documentation/AppleScript/Conceptual/AppleScriptLangGuide/introduction/ASLR_intro.html text http://www.rosettacode.org/wiki/Category:AppleScript United States "-- ""Hello World"" in AppleScript: display dialog ""Hello World"" " "display dialog ""Hello World"" " "(* Get User Name This script uses UI element scripting to get the name for the current user. If ""Enable access for assistive devices"" is not checked, this script will open the Universal Access System Preference and ask the user to check the checkbox. Copyright 2007 Apple Inc. You may incorporate this Apple sample code into your program(s) without restriction. This Apple sample code has been provided ""AS IS"" and the responsibility for its operation is yours. You are not permitted to redistribute this Apple sample code as ""Apple sample code"" after having made changes. If you're going to redistribute the code, we require that you make it clear that the code was descended from Apple sample code, but that you've made changes. *) tell application ""System Preferences"" activate set current pane to pane ""com.apple.preferences.users"" end tell tell application ""System Events"" if UI elements enabled then tell tab group 1 of window ""Accounts"" of process ""System Preferences"" click radio button 1 delay 2 get value of text field 1 end tell else tell application ""System Preferences"" activate set current pane to pane ""com.apple.preference.universalaccess"" display dialog ""UI element scripting is not enabled. Check \""Enable access for assistive devices\"""" end tell end if end tell" AppleScript "tell application ""Finder"" set anyNumber to my (random number from 5 to 50) end tell" AppleScript -- (* *) display dialog """" true true true true true true true true false true https://en.wikipedia.org/wiki/AppleScript 15 1 https://hopl.info/showlanguage.prx?exp=1830 Applescript AppleScript https://github.com/textmate/applescript.tmbundle 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 AppleScript applescript developer year|title|doi|citations|influentialCitations|authors|paperId\n2007|AppleScript|10.1145/1238844.1238845|19|1|W. Cook|04216be6bacdea717c7ac6e2838f4227884626a3 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 mgmt mgmt 2015 James Shubin 20 pl https://purpleidea.com/tags/mgmtconfig/ 0 0.0.26 308 1 14 24037 true 0 https://github.com/purpleidea/mgmt pl 2015 2024 2015 97 308 3473 158 false 2015 2025 2174 105 1322 10 30687 https://github.com/purpleidea/mgmt/issues go yaml bourne-shell markdown svg make python bash dockerfile yacc lisp smarty puppet restructuredtext true 4504 0 35 1 false 0 true Canada https://fosdem.org/2020/schedule/event/mgmtconfigmore/ "import ""datetime"" $is_friday = datetime.weekday(datetime.now()) == ""friday"" file ""/srv/files/"" { state => $const.res.file.state.exists, mode => if $is_friday { # this updates the mode, the instant it changes! ""0550"" } else { ""0770"" }, }" https://twitter.com/purpleidea https://github.com/purpleidea/mgmt # true true false 2 0 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 rexx Rexx 1979 Mike Cowlishaw 40 pl 5 309 4 24036 868 true 5 jal-compiler mal pawn-scripting-language pawn pygments pl 69 71 263 0 arexx regina rexx text source.rexx programming false r/Rexx.rexx 13 2014 2017 4 2 scripting.py 1979 arexx netrexx object-rexx pl-i algol cms-exec exec-2 perl assembly-language tcl python java linux unix solaris visual-basic jscript "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." 2012 43 91 3 25572284 IBM cmd exec rexx rex rexx pprx rex rexx rexx rex rx arexx cmd exec rexx rex http://pldb.info/blog/mikecowlishaw-interview.html 435 40 50 1 pprx rexx https://tio.run/#rexx https://www.ibm.com/docs/en/zos/2.1.0?topic=guide-learning-rexx-language text https://github.com/antlr/grammars-v4/tree/master/rexx REXX http://www.rosettacode.org/wiki/Category:REXX regina-rexx United Kingdom Rexx "<>= Say ""Hello World"" " "/* rexx */ PARSE ARG filnamn IF filnamn='' THEN DO filnamn='raw' filnamn='font.shapes' end IF ~open(fil,filnamn,r) THEN EXIT 10 pixwidth=48 ebwidth=pixwidth/8 pixheight=48 depth=4 SAY ""Skriver utfil..."" CALL open utfil,""RAM:utfil"",W CALL skriv pixwidth,2 CALL skriv pixheight,2 CALL skriv depth,2 CALL skriv ebwidth,2 bltsize=Right(C2B(D2C(pixheight)),10,""00"") bltsize=bltsize || Right(C2B(D2C(ebwidth)),6,""00"") /* SAY bltsize */ CALL skriv C2D(B2C(bltsize)),2 CALL skriv 0,4 /* xhandle, yhandle*/ CALL skriv 0,4 /* datapekare */ CALL skriv 0,4 /* cookiepekare */ CALL skriv ebwidth*pixheight,2 /* onebpmem */ CALL skriv ebwidth*pixheight+pixheight*2,2 /* onebpmemx */ CALL skriv ebwidth*pixheight*depth,2 /* allbpmem */ CALL skriv ebwidth*pixheight*depth+pixheight*2*depth,2 /* allbpmemx */ CALL skriv 0,2 /* padding */ CALL Close utfil EXIT skriv: say ""Skriver $""D2X(arg(1)) ""(""arg(2) ""byte)"" call writech utfil,right(D2C(ARG(1)),ARG(2),""00""x) return visacookie: rad=copies('00'x,pixheight*ebwidth) say ""Initierar bitmap till"" pixheight*ebwidth*depth say ""Ett bitplan ="" pixheight*ebwidth bmap.='' say ""laser in"" do bitplan=1 to depth say ""laser plan"" bitplan rad=bitor(rad,readch(fil,pixheight*ebwidth)) end ln=1 say ""skriver ut"" do for pixheight say c2b(substr(rad,ln,bredd/8)) ln=ln+bredd/8 end return" Rexx https://riju.codes/rexx "say ""Hello, world!"" " ChangeCodePage: procedure /* protect SIGNAL settings */ signal on syntax name ChangeCodePage.Trap return SysQueryProcessCodePage() ChangeCodePage.Trap: return 1004 /* windows-1252 on OS/2 */ Rexx /* */ say """" true false true true false true https://en.wikipedia.org/wiki/REXX 19 4 https://hopl.info/showlanguage.prx?exp=868 REXX REXX https://github.com/mblocker/rexx-sublime 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 REXX rexx engineer 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 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 ceylon Ceylon 2011 Gavin King 48 pl https://ceylon-lang.org/ http://ceylon-lang.org 0 1.2.1-osgi 310 5 18 24036 true 0 https://github.com/eclipse/ceylon pl 85 167 336 0 text source.ceylon programming 2015 2024 2017 41 62 396 1027 false c/Ceylon.ceylon 29 2013 2017 1 6 jvm.py 2017 2020 40307 12 13362 189 766608 2011 2011 jvm javascript java scala smalltalk ml lisp maven-pom typescript dart fantom "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." 2011 72 33 218 31483631 Red Hat ceylon ceylon ceylon ceylon ceyloncite web ceylon java javascript xml xslt bourne-shell gradle markdown html groovy css dtd json ini bash make asciidoc perl yaml true 1176 0 72 jvm 1 false 1 true https://tio.run/#ceylon https://ceylon-lang.org/documentation/current/ text http://www.rosettacode.org/wiki/Category:Ceylon Ceylon "// Hello world in Ceylon print(""Hello, World!"");" "shared void hello() { print(""Hello World""); } " """Test function for Ceylon"" by (""Enrique"") shared void test() { print(""test""); } ""Test class for Ceylon"" shared class Test(name) satisfies Comparable { shared String name; shared actual String string = ""Test ``name``.""; shared actual Comparison compare(Test other) { return name<=>other.name; } } " Ceylon https://riju.codes/ceylon "shared void run() { print(""Hello, world!""); } " https://twitter.com/ceylonlang "/* The classic Hello World program */ shared void run() { print(""Hello, World!""); }" Ceylon https://github.com/jvasileff/vscode-ceylon https://github.com/eclipse/ceylon https://ceylon-lang.org/code/source/ // /* */ print """" true true true true true true true true true false true true true https://en.wikipedia.org/wiki/Ceylon_(programming_language) 0 0 Ceylon ceylon-lang.org Ceylon https://github.com/jeancharles-roger/ceylon-sublimetext Ceylon azure Microsoft Azure 2010 15 cloud https://azure.microsoft.com 0 311 0 24035 false 0 cloud false 131967 386 2010 linux php python ftp mercurial json redis rest xml visual-studio-editor eclipse-editor aws google-cloud "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." 2008 1843 815 1288 19961416 Microsoft false 154044 1448 15 text United States https://twitter.com/azure https://www.meetup.com/topics/microsoft-azure https://en.wikipedia.org/wiki/Microsoft_Azure 1 0 azure.microsoft.com azure title|year|author|goodreadsId|rating|ratings|reviews\nProgramming Microsoft Azure Service Fabric||Haishi Bai|47765433|3.35|20|3 powerbuilder PowerBuilder 2010 25 pl 2 312 3 24035 true 2 gforth serious pl 14 17 747 0 text none programming false p/PowerBuilder.psr 2010 csharp json xml sql 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. 2005 189 65 539 1611118 SAP pbt sra sru srw psr 965 0 35 pbt sra srf srm srs sru srw text https://github.com/antlr/grammars-v4/tree/master/powerbuilder http://www.rosettacode.org/wiki/Category:Powerbuilder Germany "// The MIT License (MIT) // Copyright (c) 2016 dario ureña // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the ""Software""), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED ""AS IS"", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE // SOFTWARE. // Source: https://github.com/darioaxel/PowerScriptToKDMTransformer/blob/173c3949d5684150c34f7405f0689310eade0362/resources/basics/TestPBT.pbt Save Format v3.0(19990112) @begin Projects 0 ""myproject\\myprojectlib.pbl""; @end; appname ""myproject""; applib ""myproject\\myproject.pbl""; LibList ""myproject\\myproject.pbl;myproject\\lib\\logger\\logger.pbl;myproject\\lib\\payroll\\payroll.pbl;myproject\\lib\\contract\\contract.pbl;myproject\\lib\\common\\common.pbl;""; type ""pb"";" "MessageBox(""Hello World"") " UPDATE my_employee SET STATUS = 'A'; IF sqlca.sqlcode<>0 THEN ... PowerBuilder // MessageBox """" true true true false true https://en.wikipedia.org/wiki/PowerBuilder 36 0 PowerBuilder 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 PowerBuilder 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 twig Twig 2009 29 template https://twig.symfony.com/ 4 313 2 2 24035 true 4 ace drupal netbeans-editor packagist-pm https://github.com/mitsuhiko/twig template 626 811 5791 0 twig twig text/x-twig text.html.twig markup 2008 2024 2008 6 3 37 0 false 86 2010 2016 13 templates.py 2008 2008 9 3 15 1 3355 2009 php jinja django eclipse-editor emacs-editor sublime-editor textmate-editor vim smarty Twig is a template engine for the PHP programming language. Its syntax originates from Jinja and Django templates. It's an open source product licensed under a BSD License and maintained by Fabien Potencier. The initial version was created by Armin Ronacher. Symfony2 PHP framework comes with a bundled support for Twig as its default template engine. 2010 59 22 89 30042663 twig php html true 616 0 67 false twig text twig twig "{% extends ""base.html"" %} {% block navigation %}
{% for item in navigation %}
{% if item.level == 2 %} {% endif %} {{ item.caption|upper }}
{% endfor %}
{% endblock navigation %}" Twig "{% extends ""base.html"" %} {% block navigation %}
{% for item in navigation %}
{% if item.level == 2 %} {% endif %} {{ item.caption|upper }}
{% endfor %}
{% endblock navigation %}" apply autoescape block deprecated do embed extends flush for from if import include macro sandbox set use verbatim with endapply endautoescape endblock endembed endfor endif endmacro endsandbox endset endwith true false https://github.com/mitsuhiko/twig {# #} true false true true true true true https://en.wikipedia.org/wiki/Twig_(template_engine) 0 0 twig.symfony.com Twig https://github.com/Anomareh/PHP-Twig.tmbundle Twig aspectj AspectJ 2001 Eric Bodden 43 pl http://www.eclipse.org/aspectj/ 1 314 4 24035 7055 true 1 netbeans-editor pl 734 793 671 0 text source.aspectj programming false a/Aspectj.aj 21 2015 2017 2 2 jvm.py 2001 java eclipse-editor emacs-editor isbn 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. 2003 88 100 172 237214 Eclipse Foundation aj aj aj aj aj true 661 0 50 1 aj text https://github.com/antlr/grammars-v4/tree/master/aspectj AspectJ http://www.rosettacode.org/wiki/Category:AspectJ aspectj Canada "System.out.println(""Hello World"");" "package com.blogspot.miguelinlas3.aspectj.cache; import java.util.Map; import java.util.WeakHashMap; import org.aspectj.lang.JoinPoint; import com.blogspot.miguelinlas3.aspectj.cache.marker.Cacheable; /** * This simple aspect simulates the behaviour of a very simple cache * * @author migue * */ public aspect CacheAspect { public pointcut cache(Cacheable cacheable): execution(@Cacheable * * (..)) && @annotation(cacheable); Object around(Cacheable cacheable): cache(cacheable){ String evaluatedKey = this.evaluateKey(cacheable.scriptKey(), thisJoinPoint); if(cache.containsKey(evaluatedKey)){ System.out.println(""Cache hit for key "" + evaluatedKey); return this.cache.get(evaluatedKey); } System.out.println(""Cache miss for key "" + evaluatedKey); Object value = proceed(cacheable); cache.put(evaluatedKey, value); return value; } protected String evaluateKey(String key, JoinPoint joinPoint) { // TODO add some smart staff to allow simple scripting in @Cacheable annotation return key; } protected Map cache = new WeakHashMap(); } " AspectJ https://riju.codes/aspectj "public class Main { public static void main(String[] args) { System.out.println(""Hello, world!""); } } " pointcut set() : execution(* set*(..) ) && this(Point); Aspectj // /* */ System.out.println """" true true true true true true true true true false true https://en.wikipedia.org/wiki/AspectJ 17 37 https://hopl.info/showlanguage.prx?exp=7055 AspectJ AspectJ https://github.com/pchaigno/sublime-aspectj 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 AspectJ 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 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 yii Yes It Is 2006 Qiang Xue 16 framework http://www.yiiframework.com/ 0 2.0.49 315 0 12 24031 false 0 https://github.com/yiisoft/yii2 framework 2012 2024 2011 1071 6923 14225 519 false Yes It Is 2011 2025 20676 1632 2397 84 468616 2008 2006 php wsdl isbn "Yii is an open source, object-oriented, component-based MVC PHP web application framework. Yii is pronounced as ""Yee"" or [ji:] and in Chinese it means ""simple and evolutionary"" and it can be an acronym for ""Yes It Is!""." 2010 107 299 313 28540539 php markdown xml sql json yaml javascript html dockerfile bourne-shell svg css true 37183 0 28 1 false 2 true text https://twitter.com/yiiframework https://github.com/yiisoft/yii2 https://en.wikipedia.org/wiki/Yii 0 0 yiiframework.com x86-assembly x86 Assembly 1972 19 assembly 1 316 3 24029 true 1 sectorc assembly 61156 0 Assembly gas or gnu asm or unix asm assembly_x86 source.x86 programming false 107 2014 2017 2 2 x86 1972 assembly-language x86-isa mmx unix nasm gas x86 assembly language is a family of backward-compatible assembly languages, which provide some level of compatibility all the way back to the Intel 8008 introduced in April 1972. x86 assembly languages are used to produce object code for the x86 class of processors. Like all assembly languages, it uses short mnemonics to represent the fundamental instructions that the CPU in a computer can understand and follow. Compilers sometimes produce assembly code as an intermediate step when translating a high level program into machine code. Regarded as a programming language, assembly coding is machine-specific and low level. Assembly languages are more typically used for detailed and time critical applications such as small real-time embedded systems or operating system kernels and device drivers. 2003 426 165 732 214948 s ms 2350 0 https://exercism.org/tracks/x86 20 true https://docs.oracle.com/cd/E19253-01/817-5477/817-5477.pdf text " .cstring LC0: .ascii ""Hello World\0"" .text .globl _main _main: LFB3: pushq %rbp LCFI0: movq %rsp, %rbp LCFI1: leaq LC0(%rip), %rdi call _puts movl $0, %eax leave ret LFE3: .section __TEXT,__eh_frame,coalesced,no_toc+strip_static_syms+live_support EH_frame1: .set L$set$0,LECIE1-LSCIE1 .long L$set$0 LSCIE1: .long 0x0 .byte 0x1 .ascii ""zR\0"" .byte 0x1 .byte 0x78 .byte 0x10 .byte 0x1 .byte 0x10 .byte 0xc .byte 0x7 .byte 0x8 .byte 0x90 .byte 0x1 .align 3 LECIE1: .globl _main.eh _main.eh: LSFDE1: .set L$set$1,LEFDE1-LASFDE1 .long L$set$1 LASFDE1: .long LASFDE1-EH_frame1 .quad LFB3-. .set L$set$2,LFE3-LFB3 .quad L$set$2 .byte 0x0 .byte 0x4 .set L$set$3,LCFI0-LFB3 .long L$set$3 .byte 0xe .byte 0x10 .byte 0x86 .byte 0x2 .byte 0x4 .set L$set$4,LCFI1-LCFI0 .long L$set$4 .byte 0xd .byte 0x6 .align 3 LEFDE1: .subsections_via_symbols" https://riju.codes/x86 " .text .globl main main: movq $1, %rax movq $1, %rdi leaq message(%rip), %rsi movq $14, %rdx syscall movq $60, %rax movq $0, %rdi syscall .data message: .string ""Hello, world!\n"" " cmp eax, ebx jne do_something ; ... do_something: ; do something here ; true true true false https://en.wikipedia.org/wiki/X86_assembly_language 0 0 https://github.com/calculuswhiz/Assembly-Syntax-Definition Unix Assembly oberon Oberon 1986 Niklaus Wirth 35 pl http://www.projectoberon.com/ 0 317 2 24026 1415 true 1 oberon-2 pl false 2011 1986 modula-2 oberon-2 zonnon go nim algol euler pascal modula ada linux solaris lex yacc x86-isa obliq visual-studio-editor 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. 2001 100 128 388 22496 Eidgenössische Technische Hochschule Zürich http://pldb.info/blog/niklausWirth.html 810 0 41 algol-60 1 https://people.inf.ethz.ch/wirth/Oberon/Oberon07.Report.pdf http://www.projectoberon.net/txt/FAQ.txt text https://github.com/antlr/grammars-v4/tree/master/oberon Switzerland Oberon https://www.reddit.com/r/Oberon https://riju.codes/oberon "MODULE Main; IMPORT Out; BEGIN Out.String(""Hello, world!""); Out.Ln; END Main. " MODULE Rectangles; IMPORT Figures; TYPE Rectangle* = POINTER TO RectangleDesc; RectangleDesc* = RECORD (Figures.FigureDesc) x, y, w, h : INTEGER; END; PROCEDURE Draw* (r : Rectangle); BEGIN (* ... *) END Draw; (* Other procedures here *) PROCEDURE Handle* (f: Figure; VAR msg: Figures.Message); VAR r : Rectangle; BEGIN r := f(Rectangle); IF msg IS Figures.DrawMsg THEN Draw(r) ELSIF msg IS Figures.MarkMsg THEN Mark(r) ELSIF msg IS Figures.MoveMsg THEN Move(r, msg(Figures.MoveMsg).dx, msg(Figures.MoveMsg).dy) ELSE (* ignore *) END END Handle; PROCEDURE New* (VAR r : Rectangle); BEGIN NEW(r); Figures.Init(r, Handle); END New; END Rectangles. Oberon (* *) Out.String ' := true true true true true false true https://en.wikipedia.org/wiki/Oberon_(programming_language) 0 21 https://hopl.info/showlanguage.prx?exp=1415 Oberon projectoberon.com applescript engineer 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 qbasic QBasic 1991 27 pl 0 318 1 24025 true 0 pl false q/QBasic.bas Quick Beginners All purpose Symbolic Instruction Code basic.py 1991 quickbasic gw-basic qb64 microsoft-small-basic linux freebsd 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. 2001 378 385 921 23712097 Microsoft bas BAS bas false 1910 0 64 https://hwiegman.home.xs4all.nl/qbasic3.html text https://repl.it/languages/qbasic http://www.rosettacode.org/wiki/Category:QBasic United States " PRINT ""Hello World"" " QBasic QBasic 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 PRINT """" true true true true true true https://en.wikipedia.org/wiki/QBasic 28 0 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 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 c2 C2 2012 Bas van den Berg 33 pl http://www.c2lang.org/ 0 319 0 8 24024 true 1 c3 https://github.com/c2lang/c2compiler pl 2013 2024 2013 42 48 687 16 false 2013 2025 2784 22 1380 12 116370 2012 cpp pascal cmake yaml bourne-shell markdown c vim-script true 855 0 43 c c3 1 false The Netherlands https://github.com/c2lang/c2compiler true true true true false true true false false false true true true false true true true true true true true 0 0 c2lang.org owl OWL 2004 18 xmlFormat 0 320 2 24023 4934 true 2 bossam owl-dl xmlFormat 524 642 199 0 xml text.xml data false 97 2004 2018 1 12 One World Language 2004 rdf xml html axiom turtle sql prolog uml 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. 2003 443 506 706 248001 W3C owl 2435 0 18 https://www.w3.org/TR/owl-guide/ text United States " ]> v.1.4. Added Food class (used in domain/range of hasIngredient), Added several hasCountryOfOrigin restrictions on pizzas, Made hasTopping invers functional version 1.5 v.1.5. Removed protege.owl import and references. Made ontology URI date-independent 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/) Americana rdf:type owl:Ontology . :Tea rdf:type owl:Class . false https://en.wikipedia.org/wiki/Web_Ontology_Language 8 20 https://hopl.info/showlanguage.prx?exp=4934 Web Ontology Language https://github.com/textmate/xml.tmbundle year|publisher|title|authors|isbn13\n2011|Morgan Kaufmann|Semantic Web for the Working Ontologist: Effective Modeling in RDFS and OWL|Allemang, Dean and Hendler, James|9780123859655\n2008|Morgan Kaufmann|Semantic Web for the Working Ontologist: Effective Modeling in RDFS and OWL|Allemang, Dean and Hendler, James|9780123735560\n1997|Manning Pubns Co|Core Owl 5.0: Owl Internals for Advanced Programmers|Neward, Ted|9781884777509\n2020-12-18T00:00:01Z|Apress|Ontologies with Python: Programming OWL 2.0 Ontologies with Python and Owlready2|Jean-Baptiste, Lamy|9781484265512\n2011|Morgan Kaufmann|Semantic Web for the Working Ontologist: Effective Modeling in RDFS and OWL|Allemang, Dean and Hendler, James|9780123859662\n2020|Apress|Ontologies with Python: Programming OWL 2.0 Ontologies with Python and Owlready2|Jean-Baptiste, Lamy|9781484265529 Web Ontology Language year|title|doi|citations|influentialCitations|authors|paperId\n2004|OWL Pizzas: Practical Experience of Teaching OWL-DL: Common Errors & Common Patterns|10.1007/978-3-540-30202-5_5|365|26|A. Rector and N. Drummond and M. Horridge and J. Rogers and H. Knublauch and R. Stevens and Hai Wang and C. Wroe|9b4b59789aa92386ccc13964339b71fc348a4b7a\n2006|Can OWL and Logic Programming Live Together Happily Ever After?|10.1007/11926078_36|148|11|B. Motik and I. Horrocks and R. Rosati and U. Sattler|4b6727c71efc34d393f567c48647dab45abadc15\n2008|ELP: Tractable Rules for OWL 2|10.1007/978-3-540-88564-1_41|129|7|M. Krötzsch and S. Rudolph and P. Hitzler|de3b00f44b0bd830254747790326d7288342fcaa\n2011|Using OWL ontologies for adaptive patient information modelling and preoperative clinical decision support|10.1007/s10115-010-0351-7|52|4|Matt-Mouley Bouamrane and A. Rector and M. Hurrell|e5a5b24e46bfabe8569dde67275e7968cdb471b7\n2008|Integrating Object-Oriented and Ontological Representations: A Case Study in Java and OWL|10.1007/978-3-540-88564-1_9|46|1|Colin Puleston and B. Parsia and James A. Cunningham and A. Rector|aa4c6ec72d5690f7e9c0e21aaa74d7817f860a60\n2007|Translating OWL and semantic web rules into prolog: Moving toward description logic programs|10.1017/S1471068407003249|37|1|Ken Samuel and L. Obrst and S. Stoutenburg and Karen Fox and Paul Franklin and Adrian Johnson and K. Laskey and D. Nichols and Steve Lopez and Jason Peterson|fe8f8b351ee0bbe273742e0dc9373c080d9863c5\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\n2010|Experience of Using OWL Ontologies for Automated Inference of Routine Pre-operative Screening Tests|10.1007/978-3-642-17749-1_4|20|1|Matt-Mouley Bouamrane and A. Rector and M. Hurrell|a8a00b39aeaf314a245ed804a83933019f0916bd\n2004|An Extension to OWL with General Rules|10.1007/978-3-540-30504-0_12|12|0|Jing Mei and Shengping Liu and A. Yue and Zuoquan Lin|57629ca0fcb754c0b3822f1f78181ea06defe407\n2006|Frequent Pattern Discovery from OWL DLP Knowledge Bases|10.1007/11891451_26|10|0|J. Józefowska and Agnieszka Lawrynowicz and T. Lukaszewski|4b9ce005761e0f29ffd872a7a67c9aa8b3020958\n2011|Zhi# - OWL Aware Compilation|10.1007/978-3-642-21064-8_22|10|0|A. Paar and Denny Vrandečić|f5ad00b924d1bbdacfd3fe471ca9c21227dce0fd\n1983|The design of OWL a language for walking|10.1145/800226.806861|8|0|Marc D. Donner|e280ac7364037fe961acaf16d63612720944663f\n2012|Recent Advances in Integrating OWL and Rules (Technical Communication)|10.1007/978-3-642-33203-6_20|6|0|Matthias Knorr and David Carral and P. Hitzler and Adila Alfa Krisnadhi and F. Maier and Cong Wang|4bc75f103bcff7a6090d16c14ad599cecba54fc7\n2011|Mooop - A Hybrid Integration of OWL and Java|10.1007/978-3-642-22056-2_47|4|1|C. Frenzel and B. Parsia and U. Sattler and B. Bauer|f5d765d5626df880beb35fe280c65035f17adddb\n2016|OntoJIT: Parsing Native OWL DL into Executable Ontologies in an Object Oriented Paradigm|10.1007/978-3-319-54627-8_1|3|0|S. Baset and K. Stoffel|cd9274a89973941ed38044c52ad1f2bdcb25f6a6\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\n2006|Programming Language Inherent Support for Constrained XML Schema Definition Data Types and OWL DL|10.1109/ASE.2006.56|2|0|A. Paar and W. Tichy|50ce71f47a268d4db25deeee35217bf984403985\n2016|Scowl: a Scala DSL for programming with the OWL API|10.21105/JOSS.00023|2|0|J. Balhoff|0e163b6bea8cd698c47661936fee17f6b061f637\n2009|OWL that can Choose to Inherit and Hide it Too|10.1109/ICSC.2009.96|1|0|S. Hosain and H. Jamil|177b9c75727edd97da6cf8be31034c6f9c60578f\n2016|Semantic-Web Architecture for Electronic Discharge Summary Based on OWL 2.0 Standard|10.5455/aim.2016.24.182-185|1|0|Shahram Tahmasebian and M. Langarizadeh and M. Ghazisaeidi and R. Safdari|eef0e3fd0fab65ed880806a15bf87f773faadc69 title|year|author|goodreadsId|rating|ratings|reviews\nOwl: Representing Information Using the Web Ontology Language|2004|Lee W. Lacy|1653014|3.11|9|0\nOWL : Representing Information Using the Web Ontology Language|2005|Lee W. Lacy|27295675|4.00|1|0 tea-pm tea 2021 Max Howell 17 packageManager https://tea.xyz/ 0 v1.1.6 321 0 7 24017 false 0 https://github.com/teaxyz/cli packageManager 2021 2024 2021 80 1359 8817 63 false 2021 2025 1129 64 59 2 7485 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. 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. tea inc 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. typescript yaml markdown json toml bourne-shell dockerfile true 12960 0 25 homebrew-pm 1 false 1 true United States https://tea.xyz/white-paper/ https://twitter.com/teaxyz_ https://github.com/teaxyz/cli 0 0 numpy NumPy 1995 Travis Oliphant 25 library http://www.numpy.org/ 0 322 1 2 24016 true 0 library 0 Python text python text/x-python none programming false Numeric python.py 2000 2005 python c jython scipy matlab simulink matplotlib cython 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. 2003 427 108 379 381782 https://github.com/numpy numpy numpyw numsc python c https://cheatsheets.zip/numpy true 2156 0 27 1 false text Various NumPy https://twitter.com/numpy_team >>> # # # Pure iterative Python # # # >>> 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]] >>> qPoint = [4,5,3] >>> minIdx = -1 >>> minDist = -1 >>> for idx, point in enumerate(points): # iterate over all points dist = sum([(dp-dq)**2 for dp,dq in zip(point,qPoint)])**0.5 # compute the euclidean distance for each point to q if dist < minDist or minDist < 0: # if necessary, update minimum distance and index of the corresponding point minDist = dist minIdx = idx >>> print 'Nearest point to q: ', points[minIdx] Nearest point to q: [3, 4, 4] >>> # # # Equivalent NumPy vectorization # # # >>> import numpy as np >>> 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]]) >>> qPoint = np.array([4,5,3]) >>> minIdx = np.argmin(np.linalg.norm(points-qPoint,axis=1)) # compute all euclidean distances at once and return the index of the smallest one >>> print 'Nearest point to q: ', points[minIdx] Nearest point to q: [3 4 4] true true true true true true https://en.wikipedia.org/wiki/NumPy 1 0 numpy.org NumPy title|year|author|goodreadsId|rating|ratings|reviews\nSciPy and NumPy: An Overview for Developers|2012|Eli Bressert|19175991|2.96|47|10 codeql CodeQL 2018 Pavel Avgustinov 17 queryLanguage https://codeql.github.com/ 0 323 1 52 24013 true 0 https://github.com/github/codeql queryLanguage 23 25 3559 ql text source.ql programming 2018 2024 2018 234 1474 7389 1129 false 2018 2025 81423 565 55176 429 798031 CodeQL let's you query code as if it were data. CodeQL let's you query code as if it were data. GitHub CodeQL let's you query code as if it were data. ql ql qll java yaml javascript python markdown csharp cpp go starlark c typescript ruby kotlin restructuredtext swift rust json xml html bourne-shell gradle toml mustache jsx erb asp.net csv razor ejs css svg ini scss diff make bash java-server-pages protobuf lua thrift powershell scheme perl raml cmake lisp vim-script xhtml handlebars graphql sql objective-c true 12378 0 70 1 false https://github.com/antlr/grammars-v4/tree/master/codeql https://www.cyberark.com/resources/threat-research-blog/make-memcpy-safe-again-codeql "from DataFlow::PathNode source, DataFlow::PathNode sink, UnsafeDeserializationConfig conf where conf.hasFlowPath(source, sink) select sink.getNode().(UnsafeDeserializationSink).getMethodAccess(), source, sink, ""Unsafe deserialization of $@."", source.getNode(), ""user input""" https://github.com/github/codeql 0 0 CodeQL CodeQL hlsl HLSL 2002 24 shadingLanguage 9 324 2 24012 false 9 cmake dynamo-visual-language elena emscripten lobster monkeyx opencv pygments spiderbasic shadingLanguage 1527 1654 2093 0 text source.hlsl programming false 5 2017 2017 5 2 graphics.py 2000 opengl cg The High-Level Shader Language or High-Level Shading Language (HLSL) is a proprietary shading language developed by Microsoft for the Direct3D 9 API to augment the shader assembly language, and went on to become the required shading language for the unified shader model of Direct3D 10 and higher. HLSL is analogous to the GLSL shading language used with the OpenGL standard. It is very similar to the Nvidia Cg shading language, as it was developed alongside it. HLSL shaders can enable profound speed and detail increases as well as many special effects in both 2d and 3d computer graphics.HLSL programs come in five forms: pixel shaders (fragment in GLSL), vertex shaders, geometry shaders, compute shaders and tessellation shaders (Hull and Domain shaders). A vertex shader is executed for each vertex that is submitted by the application, and is primarily responsible for transforming the vertex from object space to view space, generating texture coordinates, and calculating lighting coefficients such as the vertex's tangent, binormal and normal vectors. When a group of vertices (normally 3, to form a triangle) come through the vertex shader, their output position is interpolated to form pixels within its area; this process is known as rasterisation. Each of these pixels comes through the pixel shader, whereby the resultant screen colour is calculated. Optionally, an application using a Direct3D 10/11/12 interface and Direct3D 10/11/12 hardware may also specify a geometry shader. This shader takes as its input some vertices of a primitive (triangle/line/point) and uses this data to generate/degenerate (or tessellate) additional primitives or to change the type of primitives, which are each then sent to the rasterizer. D3D11.3 and D3D12 introduced Shader Model 5.1 and later 6.0. 2005 84 70 292 2338657 Microsoft hlsl cginc fx fxh hlsli hlsl hlsli 640 0 30 cg cginc fxh hlsl hlsli shader text United States https://docs.microsoft.com/en-us/windows/desktop/direct3dhlsl/dx-graphics-hlsl // The entry point and target profile are needed to compile this example: // -T ps_6_6 -E PSMain struct PSInput { float4 position : SV_Position; float4 color : COLOR0; }; float4 PSMain(PSInput input) : SV_Target0 { return input.color * input.color; } float alpha = 1.f; texture tex; sampler tex_sampler = sampler_state { Texture = (tex); MipFilter = LINEAR; MinFilter = LINEAR; MagFilter = LINEAR; AddressU = WRAP; AddressV = WRAP; }; struct VS_OUTPUT { float4 pos : POSITION; float2 tex : TEXCOORD1; }; VS_OUTPUT vertex(float4 ipos : POSITION, float2 tex : TEXCOORD0) { VS_OUTPUT Out; Out.pos = ipos; Out.tex = tex * 2; return Out; } float4 pixel(VS_OUTPUT In) : COLOR { return tex2D(tex_sampler, In.tex) * alpha; } technique blur_ps_vs_2_0 { pass P0 { VertexShader = compile vs_2_0 vertex(); PixelShader = compile ps_2_0 pixel(); } } HLSL HLSL true true true true true true true https://en.wikipedia.org/wiki/High-Level_Shading_Language 8 0 HLSL https://github.com/tgjones/shaders-tmLanguage year|publisher|title|authors|isbn13\n2012|O'Reilly Media|HLSL and Pixel Shaders for XAML Developers: A Comprehensive Guide to Creating HLSL Pixel Shaders for WPF and Silverlight Applications|Ritscher, Walt|9781449319847\n20120703|O'Reilly Media, Inc.|HLSL and Pixel Shaders for XAML Developers|Walt Ritscher|9781449325022\n20130613|Packt Publishing|HLSL Development Cookbook|Doron Feinstein|9781849694216\n20120703|O'Reilly Media, Inc.|HLSL and Pixel Shaders for XAML Developers|Walt Ritscher|9781449325015\n20140503|Pearson Technology Group|Real-Time 3D Rendering with DirectX and HLSL|Paul Varcholik|9780133570113 HLSL title|year|author|goodreadsId|rating|ratings|reviews\nHLSL and Pixel Shaders for XAML Developers|2012|Walt Ritscher|19180540|3.57|7|2\nHlsl and Pixel Shaders for Xaml Developers|2012|Walt Ritscher|41933416|0.0|0|0\nReal-Time 3D Rendering with DirectX and HLSL: A Practical Guide to Graphics Programming (Game Design)|2014|Paul Varcholik|26545302|4.50|2|0 ecl ECL 2000 26 pl http://hpccsystems.com/ 0 325 2 32 24012 true 0 https://github.com/hpcc-systems/HPCC-Platform pl 25 25 234 0 text ecl text/x-ecl source.ecl programming 2011 2024 78 303 569 481 false 1 ecl.py 2011 2025 41299 193 13641 307 3194799 2010 2000 linux prolog pascal sql clarion 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. 2012 1 19 1 31108124 LexisNexis Risk Solutions Group ecl eclxml ecl xml cpp cmake javascript typescript xslt yaml markdown css xsd html bourne-shell json java python perl dockerfile bash restructuredtext make c svg yacc lex hcl expect ini pascal assembly-language awk scheme ring true 1948 0 61 false text ecl http://www.rosettacode.org/wiki/Category:ECL United States /* * Multi-line comment */ #option ('slidingJoins', true); namesRecord := RECORD string20 surname; string10 forename; integer2 age; integer2 dadAge; integer2 mumAge; END; namesRecord2 := record string10 extra; namesRecord; end; namesTable := dataset('x',namesRecord,FLAT); namesTable2 := dataset('y',namesRecord2,FLAT); integer2 aveAgeL(namesRecord l) := (l.dadAge+l.mumAge)/2; integer2 aveAgeR(namesRecord2 r) := (r.dadAge+r.mumAge)/2; // Standard join on a function of left and right output(join(namesTable, namesTable2, aveAgeL(left) = aveAgeR(right))); //Several simple examples of sliding join syntax output(join(namesTable, namesTable2, left.age >= right.age - 10 and left.age <= right.age +10)); output(join(namesTable, namesTable2, left.age between right.age - 10 and right.age +10)); output(join(namesTable, namesTable2, left.age between right.age + 10 and right.age +30)); output(join(namesTable, namesTable2, left.age between (right.age + 20) - 10 and (right.age +20) + 10)); output(join(namesTable, namesTable2, aveAgeL(left) between aveAgeR(right)+10 and aveAgeR(right)+40)); //Same, but on strings. Also includes age to ensure sort is done by non-sliding before sliding. output(join(namesTable, namesTable2, left.surname between right.surname[1..10]+'AAAAAAAAAA' and right.surname[1..10]+'ZZZZZZZZZZ' and left.age=right.age)); output(join(namesTable, namesTable2, left.surname between right.surname[1..10]+'AAAAAAAAAA' and right.surname[1..10]+'ZZZZZZZZZZ' and left.age=right.age,all)); //This should not generate a self join output(join(namesTable, namesTable, left.age between right.age - 10 and right.age +10)); ECL D := DATASET([{'ECL'},{'Declarative'},{'Data'},{'Centric'},{'Programming'},{'Language'}],{STRING Value;}); https://github.com/hpcc-systems/HPCC-Platform // /* */ true true true false https://en.wikipedia.org/wiki/ECL,_data-centric_programming_language_for_Big_Data 1 0 hpccsystems.com ECL https://github.com/hpcc-systems/ecl-tmLanguage year|publisher|title|authors|isbn13\n||Ecl Programming Language|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133156937 ECL glsl GLSL 1992 25 shadingLanguage 3d 34 326 1 24010 false 34 ace beef blender-app cat cloc curv ec factor flow9 flua flutter forsp fp3 glms imhex lever lwjgl manim monkeyx odin open-shading-language opencv openscad paraview php pygments pytorch r3 spiderbasic taichi v vlc vsxu wonkey shadingLanguage 11708 13882 11778 0 glsl source.glsl programming false 62 2012 2017 14 9 graphics.py 1992 opengl c linux javascript delphi java webgl cg OpenGL Shading Language (abbreviated: GLSL), is a high-level shading language with a syntax based on the C programming language. It was created by the OpenGL ARB (OpenGL Architecture Review Board) to give developers more direct control of the graphics pipeline without having to use ARB assembly language or hardware-specific languages. 2013 46 45 311 2152476 OpenGL Architecture Review Board glsl fp frag frg fs fsh fshader geo geom glslf glslv gs gshader rchit rmiss shader tesc tese vert vrx vsh vshader vert frag geo cpp 450 0 42 comp fp frag frg fsh fshader geo geom glsl glslv gshader tesc tese vert vrx vsh vshader text https://github.com/antlr/grammars-v4/tree/master/glsl http://www.rosettacode.org/wiki/Category:GLSL United States varying vec4 v_color; void main() { gl_FragColor = v_color; } GLSL https://github.com/svenstaro/glsl-language-server true true true true true true true https://en.wikipedia.org/wiki/OpenGL_Shading_Language 2 0 GLSL GLSL https://github.com/euler0/sublime-glsl year|publisher|title|authors|isbn13\n2013|Packt Publishing|GLSL Essentials|Rodriguez, Jacobo|9781849698016\n2013|Packt Publishing|GLSL Essentials|Rodríguez, Jacobo|9781849698009 GLSL scipy SciPy 2001 Travis Oliphant and Pearu Peterson and Eric Jones 16 library https://www.scipy.org/scipylib/index.html 0 v1.13.1 327 0 23 24009 true 0 https://github.com/scipy/scipy library 2011 2024 2001 348 5090 12770 1824 false 2001 2025 37218 1785 3186 178 1233447 2001 python fortran c numpy matplotlib pandas matlab octave scilab sagemath "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." 2003 237 136 254 263472 https://github.com/scipy python restructuredtext fortran-77 c cython meson cpp yaml markdown bourne-shell svg json matlab tex make ini pascal diff toml r css fortran-90 html true 31032 0 41 3 false 1 true text Various https://github.com/scipy/scipy https://en.wikipedia.org/wiki/SciPy 8 0 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 homebrew-pm Homebrew 2009 Max Howell 14 packageManager https://brew.sh/ 0 4.3.1 328 0 14 24007 false 1 tea-pm https://github.com/Homebrew/brew packageManager 2016 2024 2009 713 9456 40327 58 false 2009 2025 43970 1337 2556 101 2013 The Missing Package Manager for macOS. The Missing Package Manager for macOS. https://github.com/Homebrew The Missing Package Manager for macOS. ruby markdown yaml bourne-shell bash json erb swift diff xml dockerfile cmake ini svg true 70034 0 28 1 false 4 true United States https://github.com/Homebrew/brew 0 0 brew.sh progsbase progsbase 2018 Martin F. Johansen 69 pl https://www.progsbase.com/ https://www.progsbase.com/docs/ 0 329 0 24002 true 0 pl false 2017 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. 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. Inductive AS 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. 1001 0 69 1 https://www.progsbase.com/docs/ text https://repo.progsbase.com/repoviewer/ Norway https://www.progsbase.com/featuredpost/progsbase-a-timeless-translatable-and-understandable-programming-system/ https://twitter.com/progsbase false false true false false true false false true true false false false false true true false false false false true false false false false false true false false true true true true true false false false false false false false true false false true true true false true false true true 1 0 progsbase.com year|publisher|title|authors|isbn13\n2022|Amazon KDP|Foundations of computer Science|Johansen, Martin Fagereng|9798836363796 onnx onnx 2017 Junjie Bai 16 binaryDataFormat https://onnx.ai/ 0 v1.16.1 330 0 15 24001 false 0 https://github.com/onnx/onnx binaryDataFormat 2017 2024 2017 437 3638 17369 323 false 2017 2025 3591 388 7607 38 398036 2017 https://github.com/onnx python markdown cpp yaml json protobuf cmake jupyter-notebook toml bourne-shell svg css powershell make javascript true 28673 0 31 1 false 1 true binary United States https://twitter.com/onnxai https://github.com/onnx/onnx 0 0 onnx.ai java-server-pages JSP 1999 15 template 9 331 1 23998 true 9 ace apache-hbase codeql gradle java netbeans-editor pygments smallbasic yawl template 729 0 Java jsp jsp htmlembedded application/x-jsp text.html.jsp programming false 283 2004 2018 21 templates.py 1999 html xml php asp java jvm apache-velocity java-ee-version-history thymeleaf 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. 2002 549 391 1033 42910 Oracle jsp jsp 2965 0 17 jsp jspf https://docs.oracle.com/javaee/5/tutorial/doc/bnajo.html text United States Java Server Page "The value of ""variable"" in the object ""javabean"" is ${javabean.variable}." https://en.wikipedia.org/wiki/JavaServer_Pages 28 1 https://github.com/textmate/java.tmbundle 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 Java Server Pages 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 chatterbot chatterbot 2014 Gunther Cox 16 library https://chatterbot.readthedocs.io 0 1.0.8 332 0 10 23997 true 0 https://github.com/gunthercox/ChatterBot library 2014 2024 2014 544 4424 13975 416 false 2014 2025 1947 114 222 9 46617 salvius python restructuredtext svg html yaml javascript css markdown ini json true 27363 0 26 1 false 1 true text United States https://github.com/gunthercox/ChatterBot 1 0 chatterbot.readthedocs.io title|year|author|goodreadsId|rating|ratings|reviews\nNatural Language Parsing: Chatterbot|2010|Books LLC|15703851|0.0|0|0 cryptol Cryptol 2014 Adam C. Foltzer 28 pl https://galois.com/ 0 3.2.2 333 1 24 23997 true 0 https://github.com/GaloisInc/cryptol pl 2014 2024 2014 54 119 1124 238 false c/Cryptol haskell.py 2014 2025 4817 96 1905 88 286121 2003 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. 2008 10 28 64 20921449 Galois,Inc cry haskell tex python markdown restructuredtext javascript html make yaml bourne-shell c css dockerfile perl svg yacc logos vim-script bash toml diff ini xml powershell true 1649 0 53 1 false 3 true https://tio.run/#cryptol text United States ":set ascii=on ""Hello World""" Cryptol Cryptol https://github.com/GaloisInc/cryptol """" true true true true true true true true https://github.com/GaloisInc/ICryptol https://en.wikipedia.org/wiki/Cryptol 0 0 cuelang Cue 2018 Marcel van Lohuizen 20 dataNotation https://cuelang.org/ 0 v0.4.0 334 1 6 23991 true 0 https://github.com/cuelang/cue dataNotation 2019 2024 2018 50 172 3090 1 false 2018 2021 1527 63 1421 10 50043 https://cuelang.org/play 2018 https://github.com/cue-lang go yaml protobuf json markdown dockerfile true 3671 0 27 1 false 0 true United Kingdom and United States and Switzerland "#Spec: { kind: string name: { first: !="""" // must be specified and non-empty middle?: !="""" // optional, but must be non-empty when specified last: !="""" } // The minimum must be strictly smaller than the maximum and vice versa. minimum?: int & minimum } // A spec is of type #Spec spec: #Spec spec: { knid: ""Homo Sapiens"" // error, misspelled field name: first: ""Jane"" " https://twitter.com/cue_lang https://github.com/cuelang/cue // true true false 0 0 cuelang.org toit Toit 2021 Florian Loitsch and Kasper Lund 29 pl https://toitlang.org 0 https://blog.toit.io/ 335 1 23991 true 0 https://github.com/toitlang/toit pl 2021 2025 23 86 1280 68 false Toit is a modern high-level language designed specifically for microcontrollers. Toit is a modern high-level language designed specifically for microcontrollers. Toit is a modern high-level language designed specifically for microcontrollers. toit true 1540 0 32 2 https://docs.toit.io/language "hi: print ""Hello World!"" greet name: print ""Hello $name!"" main: hi greet ""Kasper""" https://chat.toit.io https://www.reddit.com/r/toitlang/ https://github.com/toitlang/toit // true true true true true true true true true true true true true true 0 0 elvish Elvish 2013 Qi Xiao 18 pl https://elv.sh/ 0 v0.21.0-dev 336 2 15 23984 true 0 https://github.com/elves/elvish pl 2013 2024 2013 110 298 5542 304 false 2013 2025 6817 112 1057 18 45065 https://try.elv.sh/ 2018 Elvish is an expressive programming language and a versatile interactive shell, combined into one seamless package. It runs on Linux, BSDs, macOS and Windows. Elvish is an expressive programming language and a versatile interactive shell, combined into one seamless package. It runs on Linux, BSDs, macOS and Windows. https://github.com/elves Elvish is an expressive programming language and a versatile interactive shell, combined into one seamless package. It runs on Linux, BSDs, macOS and Windows. go markdown html json yaml bourne-shell css toml javascript python make xml typescript svg dockerfile true 6550 0 33 1 false 0 true Unknown if $true { echo good } else { echo bad } https://riju.codes/elvish "echo ""Hello, world!""" https://twitter.com/elvishshell https://github.com/elves/elvish 0 0 elv.sh nltk Natural Language Toolkit 2001 16 library http://www.nltk.org/ 0 3.8.1 337 0 12 23983 true 0 https://github.com/nltk/nltk library 2009 2024 2001 466 2850 13289 290 false 2001 2025 14805 510 498 114 177674 2007 2007 python 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.. 2005 111 36 127 1661566 https://www.nltk.org/team.html python restructuredtext yaml markdown html make ini json jupyter-notebook bourne-shell css xml true 22926 0 28 false 3 true text Various https://github.com/nltk/nltk https://en.wikipedia.org/wiki/Natural_Language_Toolkit 4 0 nltk.org 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 scilab Scilab 1990 32 pl 0 338 4 23968 true 0 pl 7234 13048 3986 0 text source.scilab programming false s/SCILab.scilab 5 2007 2012 3 2 matlab.py 1990 c java fortran freebsd linux matlab octave modelica simulink sagemath 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. 2002 214 147 432 153563 https://gitlab.com/groups/scilab/-/issues sci sce tst scilab sci sce tst true 1290 0 35 https://wiki.scilab.org/Documentation text http://www.rosettacode.org/wiki/Category:Scilab Various "disp(""Hello World"") " disp(%pi); Scilab https://riju.codes/scilab "disp(""Hello, world!"") " // A simple plot of z = f(x,y) t=[0:0.3:2*%pi]'; z=sin(t)*cos(t'); plot3d(t,t,z) SCILab // disp """" true true true true true true false true https://github.com/calysto/scilab_kernel https://en.wikipedia.org/wiki/Scilab 15 10 Scilab https://github.com/textmate/scilab.tmbundle 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 Scilab 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 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 tla TLA+ 1999 Leslie Lamport 25 pl 0 339 2 23967 true 1 quint pl 85 89 680 0 text source.tla programming false 15 2016 2017 2 3 TLA 1999 java latex ascii eclipse-editor isabelle aws azure alloy z-notation TLA+ (pronounced as tee ell a plus, ) is a formal specification language developed by Leslie Lamport. It is used to design, model, document, and verify concurrent systems. TLA+ has been described as exhaustively-testable pseudocode, and its use likened to drawing blueprints for software systems; TLA is an acronym for Temporal Logic of Actions. For design and documentation, TLA+ fulfills the same purpose as informal technical specifications. However, TLA+ specifications are written in a formal language of logic and mathematics, and the precision of specifications written in this language is intended to uncover design flaws before system implementation is underway.Since TLA+ specifications are written in a formal language, they are amenable to finite model checking. The model checker finds all possible system behaviours up to some number of execution steps, and examines them for violations of desired invariance properties such as safety and liveness. TLA+ specifications use basic set theory to define safety (bad things won't happen) and temporal logic to define liveness (good things eventually happen). TLA+ is also used to write machine-checked proofs of correctness both for algorithms and mathematical theorems. The proofs are written in a declarative, hierarchical style independent of any single theorem prover backend. Both formal and informal structured mathematical proofs can be written in TLA+; the language is similar to LaTeX, and tools exist to translate TLA+ specifications to LaTeX documents.TLA+ was introduced in 1999, following several decades of research into a verification method for concurrent systems. A toolchain has since developed, including an IDE and distributed model checker. The pseudocode-like language PlusCal was created in 2009; it transpiles to TLA+ and is useful for specifying sequential algorithms. TLA+2 was announced in 2014, expanding language support for proof constructs. The current TLA+ reference is The TLA+ Hyperbook by Leslie Lamport. 2004 167 22 203 28752673 TLA+ is a formal specification and verification language that helps engineers design, specify, reason about and verify complex, real-life algorithms and software or hardware systems. TLA+ has been successfully used by Intel, Compaq and Microsoft in the design of hardware systems, and has started seeing recent use in large software systems, at Microsoft, Oracle, and most famously at Amazon, where engineers use TLA+ to specify and verify many AWS services. TLA+ is a formal specification and verification language that helps engineers design, specify, reason about and verify complex, real-life algorithms and software or hardware systems. TLA+ has been successfully used by Intel, Compaq and Microsoft in the design of hardware systems, and has started seeing recent use in large software systems, at Microsoft, Oracle, and most famously at Amazon, where engineers use TLA+ to specify and verify many AWS services. TLA+ is a formal specification and verification language that helps engineers design, specify, reason about and verify complex, real-life algorithms and software or hardware systems. TLA+ has been successfully used by Intel, Compaq and Microsoft in the design of hardware systems, and has started seeing recent use in large software systems, at Microsoft, Oracle, and most famously at Amazon, where engineers use TLA+ to specify and verify many AWS services. tla true 1055 0 30 1 https://lamport.azurewebsites.net/tla/learning.html text https://lamport.azurewebsites.net/tla/tla.html "--------------------------- MODULE AsyncInterface --------------------------- EXTENDS Naturals CONSTANT Data VARIABLE chan Values == <<""foo"", ""bar"", ""baz"">> TypeInvariant == chan \in [val: Data, rdy: {0,1}, ack: {0,1}] Init == /\ TypeInvariant /\ chan.ack = chan.rdy Send(d) == /\ chan.rdy = chan.ack /\ chan' = [chan EXCEPT !.val = d, !.rdy = 1 - @] Rcv == /\ chan.rdy # chan.ack /\ chan' = [chan EXCEPT !.ack = 1 - @] Next == (\E d \in Data : Send(d)) \/ Rcv Spec == Init /\ [][Next]_chan THEOREM Spec => []TypeInvariant =============================================================================" "------------------------------ MODULE Elevator ------------------------------ (***************************************************************************) (* This spec describes a simple multi-car elevator system. The actions in *) (* this spec are unsurprising and common to all such systems except for *) (* DispatchElevator, which contains the logic to determine which elevator *) (* ought to service which call. The algorithm used is very simple and does *) (* not optimize for global throughput or average wait time. The *) (* TemporalInvariant definition ensures this specification provides *) (* capabilities expected of any elevator system, such as people eventually *) (* reaching their destination floor. *) (***************************************************************************) EXTENDS Integers CONSTANTS Person, \* The set of all people using the elevator system Elevator, \* The set of all elevators FloorCount \* The number of floors serviced by the elevator system VARIABLES PersonState, \* The state of each person ActiveElevatorCalls, \* The set of all active elevator calls ElevatorState \* The state of each elevator Vars == \* Tuple of all specification variables <> Floor == \* The set of all floors 1 .. FloorCount Direction == \* Directions available to this elevator system {""Up"", ""Down""} ElevatorCall == \* The set of all elevator calls [floor : Floor, direction : Direction] ElevatorDirectionState == \* Elevator movement state; it is either moving in a direction or stationary Direction \cup {""Stationary""} GetDistance[f1, f2 \in Floor] == \* The distance between two floors IF f1 > f2 THEN f1 - f2 ELSE f2 - f1 GetDirection[current, destination \in Floor] == \* Direction of travel required to move between current and destination floors IF destination > current THEN ""Up"" ELSE ""Down"" CanServiceCall[e \in Elevator, c \in ElevatorCall] == \* Whether elevator is in position to immediately service call LET eState == ElevatorState[e] IN /\ c.floor = eState.floor /\ c.direction = eState.direction PeopleWaiting[f \in Floor, d \in Direction] == \* The set of all people waiting on an elevator call {p \in Person : /\ PersonState[p].location = f /\ PersonState[p].waiting /\ GetDirection[PersonState[p].location, PersonState[p].destination] = d} TypeInvariant == \* Statements about the variables which we expect to hold in every system state /\ PersonState \in [Person -> [location : Floor \cup Elevator, destination : Floor, waiting : BOOLEAN]] /\ ActiveElevatorCalls \subseteq ElevatorCall /\ ElevatorState \in [Elevator -> [floor : Floor, direction : ElevatorDirectionState, doorsOpen : BOOLEAN, buttonsPressed : SUBSET Floor]] SafetyInvariant == \* Some more comprehensive checks beyond the type invariant /\ \A e \in Elevator : \* An elevator has a floor button pressed only if a person in that elevator is going to that floor /\ \A f \in ElevatorState[e].buttonsPressed : /\ \E p \in Person : /\ PersonState[p].location = e /\ PersonState[p].destination = f /\ \A p \in Person : \* A person is in an elevator only if the elevator is moving toward their destination floor /\ \A e \in Elevator : /\ (PersonState[p].location = e /\ ElevatorState[e].floor /= PersonState[p].destination) => /\ ElevatorState[e].direction = GetDirection[ElevatorState[e].floor, PersonState[p].destination] /\ \A c \in ActiveElevatorCalls : PeopleWaiting[c.floor, c.direction] /= {} \* No ghost calls TemporalInvariant == \* Expectations about elevator system capabilities /\ \A c \in ElevatorCall : \* Every call is eventually serviced by an elevator /\ c \in ActiveElevatorCalls ~> \E e \in Elevator : CanServiceCall[e, c] /\ \A p \in Person : \* If a person waits for their elevator, they'll eventually arrive at their floor /\ PersonState[p].waiting ~> PersonState[p].location = PersonState[p].destination PickNewDestination(p) == \* Person decides they need to go to a different floor LET pState == PersonState[p] IN /\ ~pState.waiting /\ pState.location \in Floor /\ \E f \in Floor : /\ f /= pState.location /\ PersonState' = [PersonState EXCEPT ![p] = [@ EXCEPT !.destination = f]] /\ UNCHANGED <> CallElevator(p) == \* Person calls the elevator to go in a certain direction from their floor LET pState == PersonState[p] IN LET call == [floor |-> pState.location, direction |-> GetDirection[pState.location, pState.destination]] IN /\ ~pState.waiting /\ pState.location /= pState.destination /\ ActiveElevatorCalls' = IF \E e \in Elevator : /\ CanServiceCall[e, call] /\ ElevatorState[e].doorsOpen THEN ActiveElevatorCalls ELSE ActiveElevatorCalls \cup {call} /\ PersonState' = [PersonState EXCEPT ![p] = [@ EXCEPT !.waiting = TRUE]] /\ UNCHANGED <> OpenElevatorDoors(e) == \* Open the elevator doors if there is a call on this floor or the button for this floor was pressed. LET eState == ElevatorState[e] IN /\ ~eState.doorsOpen /\ \/ \E call \in ActiveElevatorCalls : CanServiceCall[e, call] \/ eState.floor \in eState.buttonsPressed /\ ElevatorState' = [ElevatorState EXCEPT ![e] = [@ EXCEPT !.doorsOpen = TRUE, !.buttonsPressed = @ \ {eState.floor}]] /\ ActiveElevatorCalls' = ActiveElevatorCalls \ {[floor |-> eState.floor, direction |-> eState.direction]} /\ UNCHANGED <> EnterElevator(e) == \* All people on this floor who are waiting for the elevator and travelling the same direction enter the elevator. LET eState == ElevatorState[e] IN LET gettingOn == PeopleWaiting[eState.floor, eState.direction] IN LET destinations == {PersonState[p].destination : p \in gettingOn} IN /\ eState.doorsOpen /\ eState.direction /= ""Stationary"" /\ gettingOn /= {} /\ PersonState' = [p \in Person |-> IF p \in gettingOn THEN [PersonState[p] EXCEPT !.location = e] ELSE PersonState[p]] /\ ElevatorState' = [ElevatorState EXCEPT ![e] = [@ EXCEPT !.buttonsPressed = @ \cup destinations]] /\ UNCHANGED <> ExitElevator(e) == \* All people whose destination is this floor exit the elevator. LET eState == ElevatorState[e] IN LET gettingOff == {p \in Person : PersonState[p].location = e /\ PersonState[p].destination = eState.floor} IN /\ eState.doorsOpen /\ gettingOff /= {} /\ PersonState' = [p \in Person |-> IF p \in gettingOff THEN [PersonState[p] EXCEPT !.location = eState.floor, !.waiting = FALSE] ELSE PersonState[p]] /\ UNCHANGED <> CloseElevatorDoors(e) == \* Close the elevator doors once all people have entered and exited the elevator on this floor. LET eState == ElevatorState[e] IN /\ ~ENABLED EnterElevator(e) /\ ~ENABLED ExitElevator(e) /\ eState.doorsOpen /\ ElevatorState' = [ElevatorState EXCEPT ![e] = [@ EXCEPT !.doorsOpen = FALSE]] /\ UNCHANGED <> MoveElevator(e) == \* Move the elevator to the next floor unless we have to open the doors here. LET eState == ElevatorState[e] IN LET nextFloor == IF eState.direction = ""Up"" THEN eState.floor + 1 ELSE eState.floor - 1 IN /\ eState.direction /= ""Stationary"" /\ ~eState.doorsOpen /\ eState.floor \notin eState.buttonsPressed /\ \A call \in ActiveElevatorCalls : \* Can move only if other elevator servicing call /\ CanServiceCall[e, call] => /\ \E e2 \in Elevator : /\ e /= e2 /\ CanServiceCall[e2, call] /\ nextFloor \in Floor /\ ElevatorState' = [ElevatorState EXCEPT ![e] = [@ EXCEPT !.floor = nextFloor]] /\ UNCHANGED <> StopElevator(e) == \* Stops the elevator if it's moved as far as it can in one direction LET eState == ElevatorState[e] IN LET nextFloor == IF eState.direction = ""Up"" THEN eState.floor + 1 ELSE eState.floor - 1 IN /\ ~ENABLED OpenElevatorDoors(e) /\ ~eState.doorsOpen /\ nextFloor \notin Floor /\ ElevatorState' = [ElevatorState EXCEPT ![e] = [@ EXCEPT !.direction = ""Stationary""]] /\ UNCHANGED <> (***************************************************************************) (* This action chooses an elevator to service the call. The simple *) (* algorithm picks the closest elevator which is either stationary or *) (* already moving toward the call floor in the same direction as the call. *) (* The system keeps no record of assigning an elevator to service a call. *) (* It is possible no elevator is able to service a call, but we are *) (* guaranteed an elevator will eventually become available. *) (***************************************************************************) DispatchElevator(c) == LET stationary == {e \in Elevator : ElevatorState[e].direction = ""Stationary""} IN LET approaching == {e \in Elevator : /\ ElevatorState[e].direction = c.direction /\ \/ ElevatorState[e].floor = c.floor \/ GetDirection[ElevatorState[e].floor, c.floor] = c.direction } IN /\ c \in ActiveElevatorCalls /\ stationary \cup approaching /= {} /\ ElevatorState' = LET closest == CHOOSE e \in stationary \cup approaching : /\ \A e2 \in stationary \cup approaching : /\ GetDistance[ElevatorState[e].floor, c.floor] <= GetDistance[ElevatorState[e2].floor, c.floor] IN IF closest \in stationary THEN [ElevatorState EXCEPT ![closest] = [@ EXCEPT !.floor = c.floor, !.direction = c.direction]] ELSE ElevatorState /\ UNCHANGED <> Init == \* Initializes people and elevators to arbitrary floors /\ PersonState \in [Person -> [location : Floor, destination : Floor, waiting : {FALSE}]] /\ ActiveElevatorCalls = {} /\ ElevatorState \in [Elevator -> [floor : Floor, direction : {""Stationary""}, doorsOpen : {FALSE}, buttonsPressed : {{}}]] Next == \* The next-state relation \/ \E p \in Person : PickNewDestination(p) \/ \E p \in Person : CallElevator(p) \/ \E e \in Elevator : OpenElevatorDoors(e) \/ \E e \in Elevator : EnterElevator(e) \/ \E e \in Elevator : ExitElevator(e) \/ \E e \in Elevator : CloseElevatorDoors(e) \/ \E e \in Elevator : MoveElevator(e) \/ \E e \in Elevator : StopElevator(e) \/ \E c \in ElevatorCall : DispatchElevator(c) TemporalAssumptions == \* Assumptions about how elevators and people will behave /\ \A p \in Person : WF_Vars(CallElevator(p)) /\ \A e \in Elevator : WF_Vars(OpenElevatorDoors(e)) /\ \A e \in Elevator : WF_Vars(EnterElevator(e)) /\ \A e \in Elevator : WF_Vars(ExitElevator(e)) /\ \A e \in Elevator : SF_Vars(CloseElevatorDoors(e)) /\ \A e \in Elevator : SF_Vars(MoveElevator(e)) /\ \A e \in Elevator : WF_Vars(StopElevator(e)) /\ \A c \in ElevatorCall : SF_Vars(DispatchElevator(c)) Spec == \* Initialize state with Init and transition with Next, subject to TemporalAssumptions /\ Init /\ [][Next]_Vars /\ TemporalAssumptions THEOREM Spec => [](TypeInvariant /\ SafetyInvariant /\ TemporalInvariant) =============================================================================" \* (* *) TRUE FALSE true true true true false https://en.wikipedia.org/wiki/TLA+ 3 0 TLA https://github.com/agentultra/TLAGrammar year|publisher|title|authors|isbn13\n20181011|Springer Nature|Practical TLA|Hillel Wayne|9781484238295 TLA title|year|author|goodreadsId|rating|ratings|reviews\nSpecifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers|2002|Leslie Lamport|2164642|4.10|21|2\nPractical Tla+: Design-Driven Programming||Hillel Wayne|63014032|4.50|2|0 scikit-learn Scikit-learn 2007 David Cournapeau 15 library http://scikit-learn.org/stable/ 0 1.5.0 340 0 18 23966 true 0 https://github.com/scikit-learn/scikit-learn library 2010 2024 2010 2141 25184 59038 2085 false 2010 2025 36454 3340 1675 169 521566 2007 python cython c linux numpy scipy nltk tensorflow matplotlib pandas 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. 2011 360 95 126 33490859 https://github.com/scikit-learn python restructuredtext cython yaml bourne-shell meson csv html svg markdown cpp json javascript css c make toml bash true 139752 0 33 1 false 1 true text Various https://github.com/scikit-learn/scikit-learn https://en.wikipedia.org/wiki/Scikit-learn 0 0 click Click 1999 24 pl https://github.com/kohler/click/wiki/Language 0 v2.0.1 341 1 17 23966 true 0 https://github.com/kohler/click pl 115 127 39 0 text source.click programming 2010 2024 1999 77 323 733 140 false 22 2015 2017 2 4 1999 2022 10877 144 1971 26 514530 MIT click cpp c perl bourne-shell make java m4 diff yaml tex markdown dockerfile vim-script xslt yacc dtd xml true 2048 0 44 false 2 true https://click.palletsprojects.com/en/8.1.x/ text 94 United States "rates :: AvailableRates elementclass sr2 { $sr2_ip, $sr2_nm, $wireless_mac, $gateway, $probes| arp :: ARPTable(); lt :: LinkTable(IP $sr2_ip); gw :: SR2GatewaySelector(ETHTYPE 0x062c, IP $sr2_ip, ETH $wireless_mac, LT lt, ARP arp, PERIOD 15, GW $gateway); gw -> SR2SetChecksum -> [0] output; set_gw :: SR2SetGateway(SEL gw); es :: SR2ETTStat(ETHTYPE 0x0641, ETH $wireless_mac, IP $sr2_ip, PERIOD 30000, TAU 300000, ARP arp, PROBES $probes, ETT metric, RT rates); metric :: SR2ETTMetric(LT lt); forwarder :: SR2Forwarder(ETHTYPE 0x0643, IP $sr2_ip, ETH $wireless_mac, ARP arp, LT lt); querier :: SR2Querier(ETH $wireless_mac, SR forwarder, LT lt, ROUTE_DAMPENING true, TIME_BEFORE_SWITCH 5, DEBUG true); query_forwarder :: SR2MetricFlood(ETHTYPE 0x0644, IP $sr2_ip, ETH $wireless_mac, LT lt, ARP arp, DEBUG false); query_responder :: SR2QueryResponder(ETHTYPE 0x0645, IP $sr2_ip, ETH $wireless_mac, LT lt, ARP arp, DEBUG true); query_responder -> SR2SetChecksum -> [0] output; query_forwarder -> SR2SetChecksum -> SR2Print(forwarding) -> [0] output; query_forwarder [1] -> query_responder; data_ck :: SR2SetChecksum() input [1] -> host_cl :: IPClassifier(dst net $sr2_ip mask $sr2_nm, -) -> querier -> data_ck; host_cl [1] -> [0] set_gw [0] -> querier; forwarder[0] -> dt ::DecIPTTL -> data_ck -> [2] output; dt[1] -> Print(ttl-error) -> ICMPError($sr2_ip, timeexceeded, 0) -> querier; // queries querier [1] -> [1] query_forwarder; es -> SetTimestamp() -> [1] output; forwarder[1] //ip packets to me -> SR2StripHeader() -> CheckIPHeader() -> from_gw_cl :: IPClassifier(src net $sr2_ip mask $sr2_nm, -) -> [3] output; from_gw_cl [1] -> [1] set_gw [1] -> [3] output; input [0] -> ncl :: Classifier( 12/0643 , //sr2_forwarder 12/0644 , //sr2 12/0645 , //replies 12/0641 , //sr2_es 12/062c , //sr2_gw ); ncl[0] -> SR2CheckHeader() -> [0] forwarder; ncl[1] -> SR2CheckHeader() -> PrintSR(query) -> query_forwarder ncl[2] -> SR2CheckHeader() -> query_responder; ncl[3] -> es; ncl[4] -> SR2CheckHeader() -> gw; } Idle -> s :: sr2(2.0.0.1, 255.0.0.0, 00:00:00:00:00:01, false, ""12 60 12 1500"") -> Discard; Idle -> [1] s; s[1] -> Discard; s[2] -> Discard; s[3] -> Discard; " https://github.com/kohler/click // true false true true true false 0 0 Click https://github.com/stenverbois/language-click.git Click k K 1993 Arthur Whitney 27 pl arrayLang 0 342 2 23965 2142 true 11 apter-f ck earnest-ok goal klong ktyek lil ngnk slack u xy pl false k/K.k q.py 1993 scheme q apl sql j sql-92 solaris linux 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. 2004 113 42 221 890956 K is like APL, but K restricts itself to the ASCII character set. K is like APL, but K restricts itself to the ASCII character set. Kx Systems K is like APL, but K restricts itself to the ASCII character set. k k 585 0 28 1 https://k.miraheze.org/wiki/Main_Page text 381 http://www.rosettacode.org/wiki/Category:K United States APL/J/K "/ Hello world in K ""Hello world!""" """Hello World\n""" K K / true true true true true true false https://en.wikipedia.org/wiki/K_(programming_language) 0 1 https://hopl.info/showlanguage.prx?exp=2142 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 11ty 11ty 2017 Zach Leatherman 16 staticSiteGenerator https://www.11ty.dev/ 0 https://www.11ty.dev/blog/ 343 0 8 23964 true 0 https://conf.11ty.dev/ https://github.com/11ty/eleventy/ staticSiteGenerator 2017 2024 92 484 16669 396 false 2017 2025 3075 133 872 6 57675 A simpler site generator. Transforms a directory of templates (of varying types) into HTML. A simpler site generator. Transforms a directory of templates (of varying types) into HTML. A simpler site generator. Transforms a directory of templates (of varying types) into HTML. javascript markdown liquid json yaml html scss typescript true 18256 0 24 1 false https://www.11ty.dev/docs/ https://www.youtube.com/c/EleventyVideo https://www.11ty.dev/blog/discord/ https://fosstodon.org/@eleventy https://github.com/11ty/eleventy/ 0 0 keras Keras 2015 François Chollet 15 library https://keras.io/ 0 v3.3.3 344 0 7 23963 true 0 https://github.com/keras-team/keras library 2015 2024 2015 1915 19395 61393 219 false 2015 2025 11606 1455 939 47 245376 2015 2015 python tensorflow ios android 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. 2016 486 51 51650259 https://github.com/keras-team python yaml markdown bourne-shell json javascript toml true 123485 0 22 1 false 3 true United States https://github.com/keras-team/keras https://en.wikipedia.org/wiki/Keras 0 0 keras.io dogescript Dogescript 2013 Zach Bruggeman 26 pl http://dogescript.io 0 2.4.3 345 3 7 23963 true 0 https://github.com/dogescript/dogescript pl 22 26 35 0 text none programming 2013 2024 2013 29 93 1341 8 false d/DogeScript.djs 2013 2022 501 36 633 3 16213 https://github.com/dogescript djs djs javascript markdown json dockerfile html yaml bourne-shell true 1658 0 35 1 false 2 true text Various quiet wow such language very syntax github recognized wow loud such language much friendly rly friendly is true plz console.loge with 'such friend, very inclusive' but plz console.loge with 'no love for doge' wow wow module.exports is language "shh such hello dogescript very next-gen wow difficulty plz console.loge with ""Hello World"" " https://riju.codes/dogescript "plz console.loge with ""Hello, world!"" " https://twitter.com/dogescript DogeScript https://github.com/dogescript/dogescript console.loge """" true true 0 0 dogescript.io Dogescript Dogescript obsidian Obsidian 2020 Shida Li and Erica Xu 16 editor https://obsidian.md/ 0 346 0 3 23960 false 0 https://github.com/obsidianmd/obsidian-releases editor 2020 2024 94 2219 8939 121 false 2020 2025 5695 2121 23 37 63678 https://obsidian.md/roadmap json markdown yaml true 17739 0 20 2 false https://forum.obsidian.md/ https://www.youtube.com/@obsdmd https://discord.gg/obsidianmd https://mas.to/@obsidian https://twitter.com/obsdmd https://github.com/obsidianmd/obsidian-releases https://en.wikipedia.org/wiki/Obsidian_(software) 0 0 idyll idyll 2017 23 pl https://idyll-lang.org/ 0 v2.6.0 347 1 10 23959 true 0 https://github.com/idyll-lang/idyll pl 2017 2024 2017 26 86 2001 58 false 2017 2022 2835 48 1557 61 321572 2017 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. 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. https://github.com/idyll-lang 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. javascript idl json markdown css yaml html svg csv xml true 2309 0 36 false 2 true https://idyll-lang.org/docs Various "[meta title:""How To: Tune a Guitar"" description:""An interactive audio guide with guitars and a little music theory."" twitterHandle:""mathisonian"" shareImageUrl:""https://mathisonian.github.io/idyll/how-to-tune-a-guitar/images/share.png"" shareImageWidth:""1940"" shareImageHeight:""970"" /] [Header title:""Tune a Guitar"" authors:`[{ name: ""Matthew Conlen"", link: ""https://twitter.com/mathisonian"" }, { name: ""Alex Kale"", link: ""https://github.com/kalealex"" }]` /] [var name:""currentFrequency"" value:108 /] [var name:""guitarState"" value:""default"" /] [var name:""fft"" value:` null ` /] [var name:""waveform"" value:` null ` /] [var name:""isInTune"" value:false /] [var name:""clean"" value:false /] [var name:""playRiff"" value:false /] [var name:""playReference"" value:false /] [var name:""detuneGuitar"" value:false /] [var name:""autotuneGuitar"" value:false /] [var name:""playNotes"" value:false /] [var name:""playBeats"" value:false /] [var name:""playScale"" value:false /] [var name:""beatDiff"" value:5 /] [var name:""tunerVisualization"" value:true /] [var name:""targetNote"" value:""E2"" /] [derived name:""targetString"" value:`{ E2: 0, A2: 1, D3: 2, G3: 3, B3: 4, E4: 5 }[targetNote]` /] [Fixed] [Guitar src:""images/svg/guitar.svg"" currentFrequency:currentFrequency state:guitarState targetNote:targetNote fft:fft waveform:waveform playRiff:playRiff isInTune:isInTune clean:clean detuneGuitar:detuneGuitar autotuneGuitar:autotuneGuitar playReference:playReference tunerVisualization:tunerVisualization playNotes:playNotes playScale:playScale playBeats:playBeats beatDiff:beatDiff /] [/Fixed] [section] # A Sad Guitar. Take a second and strum the guitar. It doesn't sound so good, does it? We've just taken it out of storage and *it's all out of tune...* [/section] [section onEnterViewFully:`guitarState = 'headstock'; playScale = false;`] # Electric Tuner to the Rescue. Tune the guitar using the tuner. Click and drag the tuning knobs on the right to tighten and loosen the strings. // Need a reward state to let them know when a string is in tune [Tuner selectedString:targetString currFreq:currentFrequency /] [conditional if:isInTune] Great work, scroll on. [/conditional] [/section] [section onEnterViewFully:`guitarState = null; playScale = false; `] [conditional if:isInTune] # A Sigh of Relief. That sounds so much better! What a difference a few hertz make. Go ahead and play a little something. // audio clip of guitar shredding [div className:""centered""] [button onClick:`playRiff = true `] Play a lick. [/button] [/div] [/conditional] [conditional if:`!isInTune `] # Keep at it. // the text in this section should depend on whether or not the guitar is in tune This doesn't sound in tune quite yet. Scroll back up and try to get all of the tuning knobs to turn green. [/conditional] [/section] [section onEnterViewFully:`guitarState = 'pickups'; playScale = true; `] # How does this thing work? Guitars generate noise through the vibration of their strings. On an electric guitar such as this one, magnetic ""pick-ups"" convert those vibrations into an electrical signal which can then be sent to a tuner or an amplifier. [var name:""waveInView"" value:false /] [WaveVisualizer waveform:waveform inView:waveInView onEnterView:`waveInView = true ` onExitViewFully:`waveInView = false ` /] This signal can be [visualized as a raw waveform](https://pudding.cool/2018/02/waveforms/), but often we want to visualize the frequency instead. The [fourier transform](https://jackschaedler.github.io/circles-sines-signals/dft_introduction.html) is a mathematical function that reveals the audio frequencies hidden in that wave. [var name:""freqInView"" value:false /] [FreqViz fft:fft inView:freqInView onEnterView:`freqInView = true ` onExitViewFully:`freqInView = false ` /] Strum the guitar to see the frequency visualized. [/section] [section onEnterViewFully:`guitarState = null; playReference = false; `] # Tuning by Ear. Now that we've tuned the guitar using a tuner, let's try to tune the guitar by ear. This is more challenging, and it may take you time to master. [/section] [notification onEnterViewFully:` detuneGuitar = true; `] The guitar is out of tune again! [/notification] [section onEnterViewFully:`guitarState = 'headstock'; playReference = true; tunerVisualization = false; `] # Match the Reference. We'll start by tuning to a reference note. When you manipulate the tuners on the right the current note will be played, as will a reference note. [div className:""centered""] [button onClick:` clean = !clean `] [Display value:`clean ? ""Turn distortion on."" : ""Turn distortion off."" ` /] [/button] [/div] This will be easier with a cleaner sound. Match the two sounds to get the guitar in tune. [/section] [section onEnterView:`playReference = false; autotuneGuitar = true; ` ] # Tuning Techniques. ## Harmonic Intervals. // audio clip in text to illustrate intervals // guitar in tune here Most of the strings on a guitar are separated by an interval known as a *perfect fourth*. [div className:""centered""] [button className:""interval"" onClick:` playNotes = 'E2:A2' `] ♬ E2-A2 [/button] [button className:""interval"" onClick:` playNotes = 'A2:D3' `] ♬ A2-D3 [/button] [button className:""interval"" onClick:` playNotes = 'D3:G3' `] ♬ D3-G3 [/button] [button className:""interval"" onClick:` playNotes = 'B3:E4' `] ♬ B3-E4 [/button] [/div] The perfect fourth is beautifully resonant, but there's one pair of strings on a guitar which are not separated by a perfect fourth. The interval between the [equation]G[/equation] and [equation]B[/equation] strings is a *major third*. The major third sounds happy and uplifting. [div className:""centered""] [button className:""interval"" onClick:` playNotes = 'G3:B3' `] ♬ G3-B4 [/button] [/div] These 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. Learning to hear these intervals will help you tune your guitar without a tuner. ## Find the beat. [p onEnterViewFully:` clean = true ` ] When two strings are played together, they produce a third higher frequency known as an overtone. [/p] // This overtune frequency is the least common multiple of the two component frequencies, which is amplified by the confluence of the two sound waves. // 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. // show frequency visualizer here? trigger example? // However, when the two strings are not perfectly in tune, the overtone is amplified inconsistently over time. // This produces a rhythmic pulsing or ""beats"" in the overtone which you can hear if you listen carefully. When 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. Play notes with a [Dynamic value:beatDiff min:0 max:20 step:0.05 /] Hz difference: [div className:""centered""] [button onClick:` playBeats = true; ` ] Listen for the beats! [/button] [button onClick:` clean = !clean `] [Display value:`clean ? ""Turn distortion on."" : ""Turn distortion off."" ` /] [/button] [/div] // These beats also show up in the frequency visualizer. // here, an illustrative example of beats changing with intonation would be nice // will find audio file [var name:""freq3InView"" value:false /] [FreqViz fft:fft inView:freq3InView showBeats:false onEnterView:`freq3InView = true ` onExitViewFully:`freq3InView = false ` /] As you get a pair of strings closer in tune, the beats will slow down until the overtone is perfectly amplified. Listening for the slowing of these beats is a helpful cue for tuning. [/section] [section] # Practice makes perfect. Try tuning the guitar by listening for the relationships between adjacent strings and the beats in the resultant overtone. [var name:""vizMode"" value:0 /] [div className:""centered""] [button onClick:` vizMode = (vizMode + 1) % 3 `] [Display value:`[""Show tuner"", ""Show wave"", ""Show frequencies""][vizMode] ` /] [/button] [button onClick:` clean = !clean `] [Display value:`clean ? ""Add distortion"" : ""Remove distortion"" ` /] [/button] [button className:""tune-action"" onClick:` autotuneGuitar = true `] Tune Guitar [/button] [button className:""tune-action"" onClick:` detuneGuitar = true `] Detune Guitar [/button] [/div] [div className:""centered""] [/div] [var name:""freq2InView"" value:false /] [div style:`{display: vizMode === 0 ? 'block' : 'none'}`] [FreqViz fft:fft inView:freq2InView onEnterView:`freq2InView = true ` onExitViewFully:`freq2InView = false ` /] [/div] [div style:`{display: vizMode === 1 ? 'block' : 'none'}`] [Tuner selectedString:targetString currFreq:currentFrequency /] [/div] [div style:`{display: vizMode === 2 ? 'block' : 'none'}`] [WaveVisualizer waveform:waveform inView:`vizMode === 2` /] [/div] [/section] [section] # About this. This page was built using [Idyll](https://idyll-lang.org), a markup language for interactive documents. The guitar was created using [Sketch Interactive Export](https://github.com/mathisonian/sketch-interactive-export), [D3](http://d3js.org/), and a modified version of [Tone.js](https://tonejs.github.io/). Audio samples were provided by [freesound.org user SpeedY](https://freesound.org/people/SpeedY/). This project is from the [Interactive Data Lab](https://idl.cs.washington.edu/) at the [University of Washington](https://www.cs.washington.edu/). [/section] [analytics google:""UA-108267630-1"" /]" https://twitter.com/idyll_lang https://github.com/idyll-lang/idyll // true false true true true false 0 0 idyll-lang.org 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 pest pest 2018 Dragoș Tiselice 18 grammarLanguage https://pest.rs/ 0 348 1 7 23958 true 0 https://github.com/pest-parser/pest grammarLanguage 2016 2025 42 266 4822 65 false 2016 2025 1329 145 166 3 71928 https://pest.rs/#editor pest is a general purpose parser written in Rust with a focus on accessibility, correctness, and performance. pest is a general purpose parser written in Rust with a focus on accessibility, correctness, and performance. pest is a general purpose parser written in Rust with a focus on accessibility, correctness, and performance. pest rust toml yaml json markdown bourne-shell svg true 5767 0 27 1 false https://docs.rs/pest/latest/pest/ https://pest.rs/book/ https://github.com/antlr/grammars-v4/tree/master/pest "alpha = { 'a'..'z' | 'A'..'Z' } digit = { '0'..'9' } ident = { (alpha | digit)+ } ident_list = _{ !digit ~ ident ~ ("" "" ~ ident)+ } // ^ // ident_list rule is silent (produces no tokens or error reports)" https://github.com/pest-parser/pest // true 0 0 triton Triton 2021 Philippe Tillet 16 pl https://triton-lang.org/ 0 v2.1.0 349 1 15 23956 true 0 https://github.com/openai/triton pl 2014 2024 2021 186 1446 12112 632 false 2021 2025 10180 446 904 422 252253 Triton is a language and compiler for parallel programming. It aims to provide a Python-based programming environment for productively writing custom DNN compute kernels capable of running at maximal throughput on modern GPU hardware. Triton is a language and compiler for parallel programming. It aims to provide a Python-based programming environment for productively writing custom DNN compute kernels capable of running at maximal throughput on modern GPU hardware. OpenAI Triton is a language and compiler for parallel programming. It aims to provide a Python-based programming environment for productively writing custom DNN compute kernels capable of running at maximal throughput on modern GPU hardware. cpp python cmake markdown yaml restructuredtext bourne-shell c dockerfile svg toml json html llvmir make true 16898 0 32 numba 1 false 2 true United States https://openai.com/blog/triton/ # This is a GPU kernel in Triton. # Different instances of this # function may run in parallel. @jit def add(X, Y, Z, N): # In Triton, each kernel instance # executes block operations on a # single thread: there is no construct # analogous to threadIdx pid = program_id(0) # block of indices idx = pid * BLOCK + arange(BLOCK) mask = idx < N # Triton uses pointer arithmetics # rather than indexing operators x = load(X + idx, mask=mask) y = load(Y + idx, mask=mask) store(Z + idx, x + y, mask=mask) https://github.com/openai/triton 0 0 wdl WDL 2012 24 pl http://www.openwdl.org/ 0 1.1.2 350 1 3 23956 true 0 https://github.com/openwdl/wdl pl 23 30 888 0 text source.wdl programming 2012 2024 2012 89 307 756 54 false 27 2017 2018 3 6 Workflow Description Language 2012 2025 781 72 20 5 13427 2017 The Workflow Description Language (WDL) is a way to specify data processing workflows with a human-readable and -writeable syntax. WDL makes it straightforward to define analysis tasks, chain them together in workflows, and parallelize their execution. The language makes common patterns simple to express, while also admitting uncommon or complicated behavior; and strives to achieve portability not only across execution platforms, but also different types of users. Whether one is an analyst, a programmer, an operator of a production system, or any other sort of user, WDL should be accessible and understandable. The Workflow Description Language (WDL) is a way to specify data processing workflows with a human-readable and -writeable syntax. WDL makes it straightforward to define analysis tasks, chain them together in workflows, and parallelize their execution. The language makes common patterns simple to express, while also admitting uncommon or complicated behavior; and strives to achieve portability not only across execution platforms, but also different types of users. Whether one is an analyst, a programmer, an operator of a production system, or any other sort of user, WDL should be accessible and understandable. The Workflow Description Language (WDL) is a way to specify data processing workflows with a human-readable and -writeable syntax. WDL makes it straightforward to define analysis tasks, chain them together in workflows, and parallelize their execution. The language makes common patterns simple to express, while also admitting uncommon or complicated behavior; and strives to achieve portability not only across execution platforms, but also different types of users. Whether one is an analyst, a programmer, an operator of a production system, or any other sort of user, WDL should be accessible and understandable. wdl markdown yaml json true 1951 0 28 false 1 true text https://software.broadinstitute.org/wdl/ "# Sample originally from https://github.com/broadinstitute/centaur task hello { String addressee command { echo ""Hello ${addressee}!"" } output { String salutation = read_string(stdout()) } runtime { docker: ""ubuntu@sha256:71cd81252a3563a03ad8daee81047b62ab5d892ebbfbf71cf53415f29c130950"" } } workflow wf_hello { call hello output { hello.salutation } }" https://twitter.com/wdl_dev https://github.com/openwdl/wdl # true true false 0 0 openwdl.org wdl https://github.com/broadinstitute/wdl-sublime-syntax-highlighter wdl prometheus PROMETHEUS 2012 Matt T. Proud 15 pl https://prometheus.io/ 0 v2.52.0 351 0 18 23954 2411 true 0 https://github.com/prometheus/prometheus pl 2012 2024 2012 1128 8955 54059 902 false 2012 2025 16972 1295 1409 251 187601 SoundCloud Limited go yaml typescript markdown json javascript css bourne-shell svg html scss make protobuf lex dockerfile xml less yacc true 82221 0 33 1 false 2 true Germany http://www.ai1.uni-bayreuth.de/en/projects/Prometheus/index.html https://github.com/prometheus/prometheus 0 0 https://hopl.info/showlanguage.prx?exp=2411 observable-lang Observable 2017 Mike Bostock 23 pl https://observablehq.com/ 0 5.9.8 352 1 5 23952 true 1 d3 https://github.com/observablehq/runtime pl 2017 2024 2017 31 72 978 5 false 2017 2024 930 18 32 2 3654 https://observablehq.com/@breck7/languages-with-central-package-repositories 2017 A partially open source derivative of Javascript modified for dataflow that powers the Observable data science web app. A partially open source derivative of Javascript modified for dataflow that powers the Observable data science web app. Observable A partially open source derivative of Javascript modified for dataflow that powers the Observable data science web app. javascript html json markdown yaml true 1214 0 30 javascript 1 false 5 true https://observablehq.com/@observablehq/observables-not-javascript { let x = 0; for (let i = 1; i <= 100; ++i) { x += i; } return x; } https://twitter.com/observablehq https://github.com/observablehq/runtime // true true false 1 0 observablehq.com year|publisher|title|authors|isbn13\n2004|Cambridge University Press|Stochastic Control of Partially Observable Systems|Bensoussan, Alain|9780521611978 clean Clean 1987 37 pl https://clean.cs.ru.nl/Clean http://clean.cs.ru.nl 2 353 6 23951 1305 true 2 cloc pygments pl 231 263 206 0 text source.clean programming false c/Clean.icl 25 2016 2017 9 2 clean.py 1987 miranda haskell c solaris linux fibonacci prolog 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. 2002 52 41 390 161878 Radboud University Nijmegen icl dcl abc sapl icl dcl icl icl dcl icl dcl abc icl dcl abc sapl 481 0 68 dcl icl https://tio.run/#clean https://wiki.clean.cs.ru.nl/Documentation text 1809 http://www.rosettacode.org/wiki/Category:Clean Netherlands module example import StdInt square :: Int -> Int square n = n * n Start :: Int Start = square 3 "// Hello World in Clean module hello Start :: String Start = ""Hello World!\n"" " "module hello Start :: {#Char} Start = ""Hello World"" " definition module GenMap import StdGeneric generic gMap a b :: .a -> .b derive gMap c, UNIT, PAIR, EITHER, CONS, FIELD, OBJECT, {}, {!} derive gMap [], (,), (,,), (,,,), (,,,,), (,,,,,), (,,,,,,), (,,,,,,,) Clean https://riju.codes/clean "module main import StdEnv Start world #(console, world) = stdio world #console = fwrites ""Hello, world!\n"" console #(ok, world) = fclose console world = world " (^) infixr 8 :: Int Int -> Int (^) x 0 = 1 (^) x n = x * x ^ (n-1) Clean Clean case ccall class code code inline derive export foreign generic if in infix infixl infixr instance let of otherwise special stdcall where with https://gitlab.science.ru.nl/clean-compiler-and-rts/compiler // """" true true true true false true https://en.wikipedia.org/wiki/Clean_(programming_language) 9 5 https://hopl.info/showlanguage.prx?exp=1305 Clean clean.cs.ru.nl Clean https://github.com/timjs/atom-language-clean.git 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 Clean 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 slope Slope 2021 Sloum 42 pl lisp https://slope.colorfield.space 0 354 1 1 23949 true 0 https://git.rawtext.club/slope-lang/slope pl false SLOum's Programming Environment A small s-expression based programming language A small s-expression based programming language https://git.rawtext.club/slope-lang A small s-expression based programming language slo go true 1001 0 70 scheme 1 false false https://git.rawtext.club/slope-lang/packages United States "; hello world (define greeting ""Hello"") (display greeting "", world!\n"") " define set! lambda cond case if for load load-mod load-mod-file usage macro eval apply and or begin begin0 exists coeval https://git.rawtext.club/slope-lang/slope ; display """" #t #f true true true true true true true false true false true true true true false true true true true true 0 0 yang YANG 2014 Tom Nadeau 18 application 0 355 1 9 23943 false 0 https://github.com/YangModels/yang application 0 0 text source.yang data 2014 2024 2014 184 1184 1483 29 false 4 2014 2014 1 1 yang.py 2014 2025 2839 151 135966 157 102368475 yang yang xtend html xml markdown json bourne-shell yaml csv python svg true 5387 0 27 1 false text 9514 https://tools.ietf.org/html/rfc7950 "module sfc-lisp-impl { yang-version 1; namespace ""urn:opendaylight:params:xml:ns:yang:controller:config:sfc-lisp:impl""; prefix ""sfc-lisp-impl""; import config { prefix config; revision-date 2013-04-05; } import rpc-context { prefix rpcx; revision-date 2013-06-17; } import opendaylight-md-sal-binding { prefix mdsal; revision-date 2013-10-28; } description ""This module contains the base YANG definitions for sfc-lisp implementation.""; revision ""2015-04-27"" { description ""Initial revision.""; } // This is the definition of the service implementation as a module identity identity sfc-lisp-impl { base config:module-type; // Specifies the prefix for generated java classes. config:java-name-prefix SfcLisp; } // Augments the 'configuration' choice node under modules/module. augment ""/config:modules/config:module/config:configuration"" { case sfc-lisp-impl { when ""/config:modules/config:module/config:type = 'sfc-lisp-impl'""; //wires in the data-broker service container data-broker { uses config:service-ref { refine type { mandatory false; config:required-identity mdsal:binding-async-data-broker; } } } container rpc-registry { uses config:service-ref { refine type { mandatory true; config:required-identity mdsal:binding-rpc-registry; } } } } } }" YANG https://github.com/yang-tools/yang-lsp https://github.com/YangModels/yang true true 0 0 https://github.com/DzonyKalafut/language-yang.git YANG autoit AutoIt 1999 Jonathan Bennett 39 pl http://www.autoitscript.com/autoit3/ 0 356 2 23941 true 0 pl 561 650 4732 0 au3 or AutoIt3 or AutoItScript autohotkey source.autoit programming false a/AutoIt.au3 88 2013 2018 11 automation.py 2000 basic tcp udp autohotkey kixtart thinbasic visual-basic winbatch expect "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." 2005 158 174 567 2281448 AutoIt Consulting Ltd au3 au3 au3 true 1011 0 78 1 https://www.autoitscript.com/autoit3/docs/ text http://www.rosettacode.org/wiki/Category:AutoIt Unknown AutoIt "MsgBox(0, ""Message Box"", ""Hello World"")" AutoIt https://twitter.com/autoitconsult "; Find Average by JohnOne, modified by czardas #include _Example() ; Run the example. Func _Example() ; Display an input box and ask the user to enter some numbers separated by commas. Local $sInput = InputBox(""Find Average"", ""Enter some numbers separated by commas: 1,2,42,100,3"") ; If an error occurred then exit the script. If @error Then Exit ; Populate an array with the user's input. Local $aSplit = StringSplit($sInput, "","") ; Pass the array to the function _Find_Average() and then check for errors. Local $fAverage = _Find_Average($aSplit) If @error Then Exit ; Display the result in a message box. MsgBox($MB_OK, ""Find Average"", ""Result: "" & $fAverage) EndFunc ;==>_Example Func _Find_Average($aArray) ; If the input is not of the correct type (an array), then return an error along with the details. If Not IsArray($aArray) Then Return SetError(1, 0, VarGetType($aArray)) ; More detailed checks are possible, but for brevity just one is performed here. ; Declare a variable to store the sum of the numbers. Local $iArraySum = 0 ; Loop through the array. For $i = 1 To $aArray[0] ; Increment the sum by the number in each array element. $iArraySum += Number($aArray[$i]) Next ; Return the average rounded to 2 decimal places. Return Round($iArraySum / $aArray[0], 2) EndFunc ;==>_Find_Average" AutoIt #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 ; MsgBox """" true true true true true true true true true false true true https://en.wikipedia.org/wiki/AutoIt 5 0 AutoIt AutoIt https://github.com/AutoIt/SublimeAutoItScript 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 AutoIt apollo-guidance-computer AGC 1966 20 assembly 0 357 2 23940 true 0 assembly 210 0 Assembly assembly_x86 source.agc programming false 17 2016 2017 1 1 Apollo Guidance Computer 1966 si assembly-language 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. 2003 561 174 733 188887 MIT Instrumentation Laboratory && Charles Stark Draper Laboratory && Raytheon agc 3025 0 23 https://www.ibiblio.org/apollo/assembly_language_manual.html text https://github.com/antlr/grammars-v4/tree/master/agc United States SWCHSET STORE NOMTPI INTLOOP DLOAD DAD TTPI NOMTPI STCALL TDEC1 PRECSET CALL S33/34.1 BZE EXIT SWCHCLR TC ALARM OCT 611 CAF V05N09 TC BANKCALL CADR GOFLASH TC GOTOPOOH TC P34/P74A # PROCEED TC -7 # V32 "# Copyright: Public domain. # Filename: BURN_BABY_BURN--MASTER_IGNITION_ROUTINE.agc # Purpose: Part of the source code for Luminary 1A build 099. # It is part of the source code for the Lunar Module's (LM) # Apollo Guidance Computer (AGC), for Apollo 11. # Assembler: yaYUL # Contact: Ron Burkey . # Website: www.ibiblio.org/apollo. # Pages: 731-751 # Mod history: 2009-05-19 RSB Adapted from the corresponding # Luminary131 file, using page # images from Luminary 1A. # 2009-06-07 RSB Corrected 3 typos. # 2009-07-23 RSB Added Onno's notes on the naming # of this function, which he got from # Don Eyles. # # This source code has been transcribed or otherwise adapted from # digitized images of a hardcopy from the MIT Museum. The digitization # was performed by Paul Fjeld, and arranged for by Deborah Douglas of # the Museum. Many thanks to both. The images (with suitable reduction # in storage size and consequent reduction in image quality as well) are # available online at www.ibiblio.org/apollo. If for some reason you # find that the images are illegible, contact me at info@sandroid.org # about getting access to the (much) higher-quality images which Paul # actually created. # # Notations on the hardcopy document read, in part: # # Assemble revision 001 of AGC program LMY99 by NASA 2021112-61 # 16:27 JULY 14, 1969 # Page 731 ## At the get-together of the AGC developers celebrating the 40th anniversary ## of the first moonwalk, Don Eyles (one of the authors of this routine along ## with Peter Adler) has related to us a little interesting history behind the ## naming of the routine. ## ## It traces back to 1965 and the Los Angeles riots, and was inspired ## by disc jockey extraordinaire and radio station owner Magnificent Montague. ## Magnificent Montague used the phrase ""Burn, baby! BURN!"" when spinning the ## hottest new records. Magnificent Montague was the charismatic voice of ## soul music in Chicago, New York, and" # true true false https://en.wikipedia.org/wiki/Apollo_Guidance_Computer 3 0 https://github.com/Alhadis/language-agc Apollo Guidance Computer 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 jai JAI 2014 Jonathan Blow 26 pl 0 358 2 23938 true 0 pl false j/Jai.jai 2014 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. 2016 7 83 6 4018856 https://github.com/Jai-Community/ jai 1562 0 30 1 jai text Various https://twitter.com/Jonathan_Blow/status/1474203662134255618 "#import ""Basic""; main :: () { print(""Hello, World!\n""); }" "#import ""Print"" main::(){ print(""Hello World""); }" https://reddit.com/r/Jai Jai // Print """" true true true true false true https://en.wikipedia.org/wiki/JAI_(programming_language) 0 0 ios iOS 2007 14 os https://www.apple.com/ios/ 0 359 0 23933 false 0 os false 1440715 2582 iOS operating system 2007 c objective-c swift android arm tls 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. 2008 6910 12985 5087 16161443 Apple false 535588 5010 14 na United States https://www.meetup.com/topics/ios-development https://en.wikipedia.org/wiki/IOS 9 0 ios 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 sqlalchemy Sqlalchemy 2006 Michael Bayer 16 queryLanguage https://www.sqlalchemy.org/ 0 360 1 9 23932 true 0 https://github.com/sqlalchemy/sqlalchemy queryLanguage 2018 2024 99 1376 9224 236 false 2005 2025 22676 804 904 96 725570 https://www.sqlalchemy.org/support.html python restructuredtext yaml markdown ini make tex toml cython true 14178 0 25 1 false https://docs.sqlalchemy.org/en/14/ https://groups.google.com/g/sqlalchemy United States https://twitter.com/sqlalchemy SELECT movies.id, movies.title, movies.year, movies.directed_by, directors.id, directors.name FROM movies LEFT OUTER JOIN directors ON directors.id = movies.directed_by https://github.com/sqlalchemy/sqlalchemy https://en.wikipedia.org/wiki/SQLAlchemy 4 0 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 microarchitecture-description-language mdl 2019 Reid Tatge 17 isa https://github.com/MPACT-ORG 0 llvmorg-14.0.0-rc1 361 0 1 23932 true 0 https://github.com/MPACT-ORG/llvm-project/ isa 2022 2024 3 5 31 9 false Microarchitecture Description Language 2001 2024 526965 7002 152106 1774 35425784 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” 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” https://github.com/MPACT-ORG 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” cpp https://github.com/MPACT-ORG/llvm-project/tree/work#the-llvm-compiler-infrastructure true 7050 0 18 1 false 14 true https://llvm.org/docs/GettingStarted.html United States https://discourse.llvm.org/t/rfc-mdl-a-micro-architecture-description-language-for-llvm/66409/4 https://github.com/MPACT-ORG/llvm-project/ 0 0 djot Djot 2022 John MacFarlane 24 textMarkup https://djot.net 0 0.2.0 362 1 7 23929 true 0 https://github.com/jgm/djot textMarkup 2022 2024 2022 30 43 1631 99 false 2022 2025 491 29 17 1 4349 https://djot.net/playground/ A light markup language A light markup language https://github.com/jgm/djot/issues A light markup language dj markdown html vim-script make css lua yaml true 1791 0 36 commonmark commonmark 1 false 0 true https://github.com/jgm/djot/blob/main/README.md United States https://htmlpreview.github.io/?https://github.com/jgm/djot/blob/master/doc/syntax.html "_italic_ *bold* `code` H~2~O 20^th^ {=highlighted=} {+underlined+} {-strikethrough-} $`p = mv` $$`E = K + U` Start a new paragraph with a blank line. > A blockquote {% look like this and can span multiple lines %} # Horizontal lines: *** --- Verbatim blocks: ``` $ tree . ├── aa │ └── foo.txt ├── bb │ └── bar.txt └── c.png ``` ```myLang func say-hello(nm) { print(""hello ${nm}!""); } ``` Links: [read more](https://example.com) [read this too][foo bar] [one more link][] ![beautiful skyline](clouds.jpg) ![coastal shores][shore] ![lush forests][] [shore]: the-beach.jpg [lush forests]: pines.jpg # Tables | Name | Size | Color | | --- | --- | --- | | lime | small | green | | orange | medium | orange | | grapefruit | large | yellow or pink |" https://github.com/jgm/djot {% %} 0 0 djot.net nemerle Nemerle 2003 Krzysztof Czarnecki 36 pl http://nemerle.org 4 363 4 23927 8336 true 4 eiffel nymph pygments sqlite pl 257 286 177 0 text source.nemerle programming false n/Nemerle.n 14 2006 2012 1 3 dotnet.py 2003 2003 csharp ml lisp java ocaml haskell sql 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. 2004 37 121 247 30883042 JetBrains n n n n n 406 0 44 csharp ml lisp 1 n false text http://www.rosettacode.org/wiki/Category:Nemerle Nemerle "// Hello World in Nemerle (a functional programming language for .NET) System.Console.WriteLine(""Hello World""); " "class Hello { static Main () : void { System.Console.WriteLine (""Hello World""); } }" "using System.Console; module Program { Main() : void { WriteLine(""Hello world""); } }" Nemerle "using System; using System.Runtime.InteropServices; class PlatformInvokeTest { [DllImport(""msvcrt.dll"")] public extern static puts(c : string) : int; [DllImport(""msvcrt.dll"")] internal extern static _flushall() : int; public static Main() : void { _ = puts(""Test""); _ = _flushall(); } }" Nemerle // System.Console.WriteLine """" true true true true true true true true https://en.wikipedia.org/wiki/Nemerle 0 0 https://hopl.info/showlanguage.prx?exp=8336 Nemerle nemerle.org Nemerle https://github.com/textmate/nemerle.tmbundle Nemerle ec eC 2004 Jérôme Jacovella-St-Louis 39 pl http://ec-lang.org/ 0 0.44.15 364 4 20 23926 true 0 https://github.com/ecere/ecere-sdk/ pl 894 920 139 0 text source.c.ec programming 2011 2024 46 92 353 7 false e/Ec.ec 12 2015 2015 1 2 Ecere C c_like.py 2011 2025 8939 20 3469 124 2570673 2014 2004 c python llvmir linux freebsd android javascript wasm 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. 2016 22 23 76 48971282 Ecere Corporation ec eh ec ec eh ec eh c make svg assembly-language python m4 cpp xml bourne-shell expect glsl yacc markdown yaml objective-c java tex lex perl html true 981 0 66 1 true 0 true https://tio.run/#ec text 4684 http://www.rosettacode.org/wiki/Category:EC Canada "class HelloWorldApp : Application { void Main() { PrintLn(""Hello World""); } } " "import ""ide"" class Designer : DesignerBase { ~Designer() { if(GetActiveDesigner() == this) { SetActiveDesigner(null); } if(classDesigner) delete classDesigner; } // *** DesignerBase Implementation *** void ModifyCode() { codeEditor.ModifyCode(); } void UpdateProperties() { codeEditor.DesignerModifiedObject(); } void CodeAddObject(Instance instance, ObjectInfo * object) { codeEditor.AddObject(instance, object); } void SheetAddObject(ObjectInfo object) { codeEditor.sheet.AddObject(object, object.name, typeData, true); //className, true); } void AddToolBoxClass(Class _class) { ((IDEWorkSpace)master).toolBox.AddControl(_class); } void AddDefaultMethod(Instance instance, Instance classInstance) { Class _class = instance._class; Method defaultMethod = null; for( ; _class; _class = _class.base) { Method method; int minID = MAXINT; for(method = (Method)_class.methods.first; method; method = (Method)((BTNode)method).next) { if(method.type == virtualMethod) { if(!method.dataType) method.dataType = ProcessTypeString(method.dataTypeString, false); if(method.vid < minID && (instance == classInstance || (method.dataType.thisClass && eClass_IsDerived(classInstance._class, method.dataType.thisClass.registered)))) { defaultMethod = method; minID = method.vid; } } } if(defaultMethod) break; } codeEditor.AddMethod(defaultMethod); } bool ObjectContainsCode(ObjectInfo object) { // Confirmation if control contains code if(object.instCode) { MembersInit members; if(object.instCode.members) { for(members = object.instCode.members->first; members; members = members.next) { if(members.type == methodMembersInit) { //if(!Code_IsFunctionEmpty(members.function)) { return true; } } } } } return false; } void DeleteObject(ObjectInfo object) { if(codeEditor) codeEditor.DeleteObject(object); } void RenameObject(ObjectInfo object, const char * name) { if(object && (name || !object.classDefinition)) codeEditor.RenameObject(object, name); } bool FindObject(Instance * object, const char * string) { ObjectInfo classObject; for(classObject = codeEditor.classes.first; classObject; classObject = classObject.next) { ObjectInfo check; if(classObject.name && !strcmp(string, classObject.name)) { *object = classObject.instance; break; } for(check = classObject.instances.first; check; check = check.next) { if(check.name && !strcmp(string, check.name)) { *object = check.instance; break; } } if(check) return true; } return false; } void SelectObjectFromDesigner(ObjectInfo object) { codeEditor.SelectObjectFromDesigner(object); } borderStyle = sizable; isActiveClient = true; hasVertScroll = true; hasHorzScroll = true; hasClose = true; hasMaximize = true; hasMinimize = true; text = $""Designer""; menu = Menu { }; anchor = Anchor { left = 300, right = 150, top = 0, bottom = 0 }; ToolBox toolBox; CodeEditor codeEditor; Menu fileMenu { menu, $""File"", f }; MenuItem fileSaveItem { fileMenu, $""Save"", s, ctrlS; bool NotifySelect(MenuItem selection, Modifiers mods) { return codeEditor.MenuFileSave(selection, mods); } }; MenuItem fileSaveAsItem { fileMenu, $""Save As..."", a; bool NotifySelect(MenuItem selection, Modifiers mods) { return codeEditor.MenuFileSaveAs(selection, mods); } }; bool debugClosing; bool OnClose(bool parentClosing) { if(!parentClosing) { if(codeEditor && codeEditor.inUseDebug && !debugClosing) { debugClosing = true; closing = false; if(CloseConfirmation(false)) { visible = false; if(modifiedDocument) OnFileModified({ modified = true }, null); } debugClosing = false; return false; } if(codeEditor && !codeEditor.closing && !debugClosing) { if(!codeEditor.visible) { if(!codeEditor.Destroy(0)) return false; else codeEditor = null; } else { visible = false; return false; } } } return true; } bool OnActivate(bool active, Window previous, bool * goOnWithActivation, bool direct) { if(active) { codeEditor.EnsureUpToDate(); codeEditor.fixCaret = true; /* if(classDesigner) classDesigner.Activate(); */ } return true; } bool OnKeyHit(Key key, unichar ch) { return codeEditor.sheet.OnKeyHit(key, ch); } watch(modifiedDocument) { fileSaveItem.disabled = !modifiedDocument && codeEditor.fileName; }; // *** METHODS ACCESSED FROM PROPERTY SHEET/TOOLBOX/CODE EDITOR *** void Reset() { if(classDesigner) { classDesigner.Reset(); classDesigner.SelectObject(null, null); classDesigner.Destroy(0); delete classDesigner; } } void FillToolBox() { if(this && classDesigner) classDesigner.ListToolBoxClasses(this); } void SelectObject(ObjectInfo object, Instance instance) { ClassDesignerBase classDesigner = this.classDesigner; #ifdef _DEBUG if(instance && instance._class.module.application != codeEditor.privateModule) printf(""warning: SelectObject: instance._class.module.application != codeEditor.privateModule\n""); #endif if(!classDesigner || !instance || classDesigner._class != (Class)eInstance_GetDesigner(instance)) { if(classDesigner) { classDesigner.SelectObject(null, null); classDesigner.Destroy(0); classDesigner = null; delete this.classDesigner; } if(instance) { this.classDesigner = classDesigner = eInstance_New(eInstance_GetDesigner(instance)); incref classDesigner; //if(!classDesigner.parent) { classDesigner.parent = this; classDesigner.anchor = Anchor { left = 0, right = 0, top = 0, bottom = 0 }; } classDesigner.Create(); } } // Call class editor SelectObject if(classDesigner) classDesigner.SelectObject(object, instance); } void AddObject() { // Call class editor AddObject if(classDesigner) classDesigner.AddObject(); if(visible) Activate(); else codeEditor.Activate(); } void CreateObject(Instance instance, ObjectInfo object, bool isClass, Instance iclass) { subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance); // Call class editor CreateObject if(designerClass) designerClass.CreateObject(this, instance, object, isClass, iclass); } void ::PostCreateObject(Instance instance, ObjectInfo object, bool isClass, Instance iclass) { subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance); // Call class editor PostCreateObject if(designerClass) designerClass.PostCreateObject(instance, object, isClass, iclass); } void ::DroppedObject(Instance instance, ObjectInfo object, bool isClass, Instance iclass) { subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance); // Call class editor PostCreateObject if(designerClass) designerClass.DroppedObject(instance, object, isClass, iclass); } void PrepareTestObject(Instance instance) { subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance); if(designerClass) designerClass.PrepareTestObject(this, instance); } void ::DestroyObject(Instance instance) { subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance); if(designerClass) designerClass.DestroyObject(instance); } void ::FixProperty(Property prop, Instance instance) { subclass(ClassDesignerBase) designerClass = eInstance_GetDesigner(instance); if(designerClass) designerClass.FixProperty(prop, instance); } } " eC https://riju.codes/ec "class Main : Application { void Main() { PrintLn(""Hello, world!""); } } " "import ""ecere"" class HelloForm : Window { caption = ""My First eC Application""; borderStyle = sizable; clientSize = { 304, 162 }; hasClose = true; Label label { this, position = { 10, 10 }, font = { ""Arial"", 30 }, caption = ""Hello, World!!"" }; }; HelloForm hello { };" Ec https://github.com/ecere/ecere-sdk/ // /* */ PrintLn """" true false true true true true true false true https://en.wikipedia.org/wiki/EC_(programming_language) 2 0 ec-lang.org eC https://github.com/ecere/ec.tmbundle 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 eC bison Bison 1985 Robert Corbett 27 grammarLanguage https://www.gnu.org/software/bison/ 0 365 2 23924 4653 true 1 lemon grammarLanguage 2747 3641 196 0 Yacc text source.yacc programming false 2 2007 2011 2 1985 c m4 java yacc ruby php go bash lilypond postgresql mysql octave 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. 2002 125 65 1 53189 GNU Project bison true 846 0 30 1 https://www.gnu.org/software/bison/manual/bison.html text https://github.com/antlr/grammars-v4/tree/master/bison United States https://github.com/babyraging/yash /* Reverse Polish Notation calculator. */ %{ #include #include int yylex (void); void yyerror (char const *); %} %define api.value.type {double} %token NUM %% /* Grammar rules and actions follow. */ # Makefile FILES = Lexer.c Parser.c Expression.c main.c CC = g++ CFLAGS = -g -ansi test: $(FILES) $(CC) $(CFLAGS) $(FILES) -o test Lexer.c: Lexer.l flex Lexer.l Parser.c: Parser.y Lexer.c bison Parser.y clean: rm -f *.o *~ Lexer.c Lexer.h Parser.c Parser.h test // /* */ true true true false https://en.wikipedia.org/wiki/GNU_bison 2 1 https://hopl.info/showlanguage.prx?exp=4653 Bison https://github.com/textmate/bison.tmbundle 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 Bison year|title|doi|citations|influentialCitations|authors|paperId\n2001|Why bison is becoming extinct|10.1145/969637.969640|9|1|John Aycock|cddbb56c25f401c0a8fd179101524e09ae17c75d simula Simula 1965 Ole-Johan Dahl and Kristen Nygaard 34 pl 0 366 3 23922 170 true 0 pl false s/Simula.sim 1965 algol-60 object-pascal java csharp algol smalltalk beta doi isbn 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. 2002 218 153 435 29513 Norwegian Computing Center sim 1110 0 42 algol-60 2 false https://tio.run/#simula https://portablesimula.github.io/github.io/doc/SimulaTextBook.pdf text http://www.rosettacode.org/wiki/Category:Simula Norway https://www.mn.uio.no/ifi/english/about/ole-johan-dahl/bibliography/the-birth-of-object-orientation-the-simula-languages.pdf "! Hello World in Simula; BEGIN OutText(""Hello World!""); OutImage; END " "Begin OutText (""Hello World""); Outimage; End;" "Simulation Begin Class FittingRoom; Begin Ref (Head) door; Boolean inUse; Procedure request; Begin If inUse Then Begin Wait (door); door.First.Out; End; inUse:= True; End; Procedure leave; Begin inUse:= False; Activate door.First; End; door:- New Head; End; Procedure report (message); Text message; Begin OutFix (Time, 2, 0); OutText ("": "" & message); OutImage; End; Process Class Person (pname); Text pname; Begin While True Do Begin Hold (Normal (12, 4, u)); report (pname & "" is requesting the fitting room""); fittingroom1.request; report (pname & "" has entered the fitting room""); Hold (Normal (3, 1, u)); fittingroom1.leave; report (pname & "" has left the fitting room""); End; End; Integer u; Ref (FittingRoom) fittingRoom1; fittingRoom1:- New FittingRoom; Activate New Person (""Sam""); Activate New Person (""Sally""); Activate New Person (""Andy""); Hold (100); End;" Simula ! OutText """" := True False true true true true true false true https://en.wikipedia.org/wiki/Simula 5 14 https://hopl.info/showlanguage.prx?exp=170 Simula 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 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 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 wisp wisp 2012 Santosh Rajan and Irakli Gozalishvili and LeXofLeviafan and Chris McCormick 27 pl lisp https://web.archive.org/web/20201121215216/https://gozala.io/wisp/ 0 0.13.0 367 2 5 23921 true 0 https://github.com/Gozala/wisp pl 17 23 30 0 clojure clojure text/x-clojure source.clojure programming 2012 2024 2012 38 69 983 58 false 149 2013 2018 1 36 2012 2019 1061 21 43 4 12478 A little Clojure-like LISP in JavaScript A little Clojure-like LISP in JavaScript A little Clojure-like LISP in JavaScript wisp markdown json make yaml javascript true 1413 0 39 4 false 0 true text Unknown "(alert ""Hello world!"")" ";; # wisp ; Wisp is homoiconic JS dialect with a clojure syntax, s-expressions and ; macros. Wisp code compiles to a human readable javascript, which is one ; of they key differences from clojurescript. ;; ## wisp data structures ;; 1. nil - is just like js undefined with a differenc that it's ;; not something can be defined. In fact it's just a shortcut for ;; void(0) in JS. nil ;; => void(0) ;; 2. Booleans - Wisp booleans true / false are JS booleans true ;; => true ;; 3. Numbers - Wisp numbers are JS numbers 1 ;; => 1 ;; 4. Strings - Wisp strings are JS Strings ""Hello world"" ;; Wisp strings can be multiline ""Hello, My name is wisp!"" ;; 5. Characters - Characters are sugar for JS single char strings \a ;; => ""a"" ;; 6. Keywords - Keywords are symbolic identifiers that evaluate to ;; themselves. :keyword ;; => ""keyword"" ;; Since in JS string constats fulfill this purpose of symbolic ;; identifiers, keywords compile to equivalent JS strings. (window.addEventListener :load handler false) ;; Keywords can be invoked as functions, that desugars to plain ;; associated value access in JS (:bar foo) ;; => foo[""bar""] ;; 7. Vectors - Wisp vectors are JS arrays. [ 1 2 3 4 ] ;; Note: Commas are white space & can be used if desired [ 1, 2, 3, 4] ;; 8. Maps - Maps are hash maps, plain JS objects. Note that unlike ;; in clojure keys can not be of arbitary types. { ""foo"" bar :beep-bop ""bop"" 1 2 } ;; Commas are optional but can come handy for separating key value ;; pairs. { a 1, b 2 } ;; In a future JSONs syntax may be made compatible with map syntax. ;; 9. Lists - You can't have a lisp without lists! Wisp has lists too. ;; Wisp is homoiconic and it's code is made up of lists representing ;; expressions. The first item in the expression is a function, being ;; invoked with rest items as arguments. (foo bar baz) ; => foo(bar, baz); ;; # Conventions ;; Wisp puts a lot of effort in making naming conventions tra" https://github.com/Gozala/wisp ; """" true false true true true true true 0 1 wisp https://github.com/atom/language-clojure wisp year|title|doi|citations|influentialCitations|authors|paperId\n2021|Comparative Analysis of the Simple WISP and Some Prominent MCDM Methods: A Python Approach|10.3390/axioms10040347|1|0|D. Stanujkić and D. Karabašević and G. Popović and E. Zavadskas and M. Saračević and P. Stanimirović and A. Ulutaş and V. Katsikis and I. Meidutė-Kavaliauskienė|ad2cae5c390d3ef3c4be9e2ef751699090e0c941 golo Golo 2012 Webmaster 35 pl http://golo-lang.org 0 v2.1.0 368 2 12 23920 true 0 https://github.com/eclipse-archived/golo-lang pl 23 29 46 0 text source.golo programming 2013 2024 2015 65 91 475 66 false g/Golo.golo 18 2013 2015 27 5 jvm.py 2015 2021 2555 26 663 8 7810 2012 2012 jvm java Golo is computer software, a programming language for the Java virtual machine (JVM). It is simple, with dynamic, weak typing. It was created in 2012 as part of the research activities of the DynaMid group of the Centre of Innovation in Telecommunications and Integration of service (CITI) Laboratory at Institut national des sciences appliquées de Lyon (INSA). It is distributed as free and open-source software under the Eclipse Public License 1.0. 2015 12 31 43 47051765 https://dev.eclipse.org/mailman/listinfo/golo-dev golo golo golo java asciidoc markdown bourne-shell yaml css gradle ruby dockerfile tex html javascript true 1056 0 50 1 false 2 true text http://www.rosettacode.org/wiki/Category:Golo Unknown "module hello.world function main = |args| { println(""Hello World"") } " "# Copyright 2012-2014 Institut National des Sciences Appliquées de Lyon (INSA-Lyon) # # Licensed under the Apache License, Version 2.0 (the ""License""); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an ""AS IS"" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. module hello.World function main = |args| { println(""Hello world!"") } " Golo https://twitter.com/golo_lang Golo https://github.com/eclipse-archived/golo-lang # println """" true true true true true true true false true https://en.wikipedia.org/wiki/Golo_(programming_language) 0 0 golo-lang.org Golo https://github.com/TypeUnsafe/sublime-golo Golo ring Ring 2016 Mahmoud Fayed 29 pl http://ring-lang.net 7 369 2 23919 true 7 adept cloc ecl eiffel rapidbatch reko-decompiler zig pl 3 3 195 0 text source.ring programming false r/Ring.ring 6 2016 2017 4 1 2016 2016 c linux lua python ruby csharp basic qml xbase 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. 2017 42 6 91 52912829 King Saud University ring rh rform ring ring ring rh rform true 431 0 37 1 rform rh ring text 1517 http://www.rosettacode.org/wiki/Category:Ring Saudi Arabia "see ""Hello World""" "New App { I want window The window title = ""hello world"" } Class App func geti if nIwantwindow = 0 nIwantwindow++ ok func getwant if nIwantwindow = 1 nIwantwindow++ ok func getwindow if nIwantwindow = 2 nIwantwindow= 0 see ""Instruction : I want window"" + nl ok if nWindowTitle = 0 nWindowTitle++ ok func settitle cValue if nWindowTitle = 1 nWindowTitle=0 see ""Instruction : Window Title = "" + cValue + nl ok private # Attributes for the instruction I want window i want window nIwantwindow = 0 # Attributes for the instruction Window title # Here we don't define the window attribute again title nWindowTitle = 0 # Keywords to ignore, just give them any value the=0 " Ring # """" true true false true https://en.wikipedia.org/wiki/Ring_(programming_language) 2 6 Ring ring-lang.net Ring https://github.com/MahmoudFayed/atom-language-ring 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 Ring 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 jakt Jakt 2022 Andreas Kling 19 pl 0 370 3 15 23918 true 0 https://github.com/SerenityOS/jakt pl 2022 2024 2022 38 243 2795 51 false j/Jakt.jakt 2022 2025 2776 132 1389 14 238031 Jakt is a memory-safe systems programming language. It currently transpiles to C++. Jakt is a memory-safe systems programming language. It currently transpiles to C++. https://github.com/SerenityOS/ Jakt is a memory-safe systems programming language. It currently transpiles to C++. jakt cpp json markdown yaml typescript cmake python bourne-shell vim-script javascript xml nix lisp lua dockerfile cpp true 3657 0 37 1 false Sweden "function main() { let x = (""a"", 2, true) println(""{}"", x.1) }" function square(num: i32) -> i32 { return num * num } function main() { return square(num: 3) } "function main() { println(""Hello World"") } " Jakt Jakt https://github.com/SerenityOS/jakt println """" true true 0 0 avi-synth AviSynth 2000 Ben Rudiak-Gould and Edwin van Eggelen and Klaus Post and Richard Berg and Ian Brabham 22 editor http://avisynth.nl 0 3.7.2 371 1 11 23917 false 0 https://github.com/AviSynth/AviSynthPlus editor 2013 2024 2002 49 73 935 88 false 2002 2025 4230 56 763 40 317091 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 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 https://forum.doom9.org/showthread.php?t=181351 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 .avs restructuredtext cpp html cmake svg make yaml c markdown python powershell http://avisynth.nl/index.php/First_script true 2232 0 38 5 false 3 true http://avisynth.nl/index.php/Main_Page https://www.npmjs.com/package/avisynth The Netherlands "filename=""somefile.avi"" logfile=""output.txt"" path=""P:\ath\To\Files\"" lumathresh=80 imageprefix=""prefix_""" https://github.com/AviSynth/AviSynthPlus https://sourceforge.net/projects/avisynth2/ https://en.wikipedia.org/wiki/AviSynth 0 0 avisynth.nl lolcode LOLCODE 2007 Adam Lindsay 26 esolang http://lolcode.org/ 0 372 3 23915 true 0 esolang 106 109 235 0 text none programming false l/LOLCODE.lol 2007 c php javascript parrot-vm 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. 2007 293 98 532 15450778 Lancaster University lol lol 1486 0 27 1 https://tio.run/#lolcode https://learnxinyminutes.com/docs/LOLCODE/ https://esolangs.org/wiki/LOLCODE text https://github.com/antlr/grammars-v4/tree/master/esolang/lolcode https://repl.it/languages/lolcode http://www.rosettacode.org/wiki/Category:LOLCODE England "HAI 1.3 OBTW Author: Logan Kelly (logan.kelly@gmail.com) Github: https://github.com/LoganKelly/LOLTracer TLDR OBTW prev is the number used in the randin function. I had to declare it in global scope so that it would retain its value between calls to randin. TLDR I HAS A prev ITZ 0 I HAS A rand_max ITZ 104729 OBTW Equivalent to C's rand() function, except returns a number in the range of 0 to rand_max. TLDR HOW IZ I randin I HAS A a ITZ 33083 I HAS A c ITZ 67607 prev R MOD OF SUM OF PRODUKT OF prev AN a AN c AN rand_max FOUND YR prev IF U SAY SO BTW Returns a random number within the range of 0-1. HOW IZ I rand_onein I HAS A rand_num ITZ I IZ randin MKAY rand_num IS NOW A NUMBAR I HAS A rand_max_float ITZ MAEK rand_max A NUMBAR FOUND YR QUOSHUNT OF rand_num AN rand_max_float IF U SAY SO OBTW Equivalent to C ceil() function. Returns the next largest integer for the given number. TLDR HOW IZ I ceilin YR num I HAS A int_num ITZ num int_num IS NOW A NUMBR BOTH SAEM int_num AN num, O RLY? YA RLY, FOUND YR num OIC DIFFRINT num AN SMALLR OF num AN 0, O RLY? YA RLY int_num R SUM OF int_num AN 1 FOUND YR MAEK int_num A NUMBAR OIC DIFFRINT num AN BIGGR OF num AN 0, O RLY? YA RLY FOUND YR MAEK int_num A NUMBAR OIC IF U SAY SO OBTW Convert a number to hexadecimal. This is returned as a string. TLDR HOW IZ I decimal_to_hex YR num I HAS A i ITZ 0 I HAS A rem I HAS A hex_num ITZ A BUKKIT I HAS A decimal_num ITZ num IM IN YR num_loop rem R MOD OF decimal_num AN 16 I HAS A hex_digit rem, WTF? OMG 10, hex_digit R ""A"", GTFO OMG 1" "HAI CAN HAS STDIO? VISIBLE ""Hello World"" KTHXBYE " https://riju.codes/lolcode https://twitter.com/icanhaslolcode HAI 1.2 CAN HAS STDIO? IM IN YR LOOP UPPIN YR VAR TIL BOTH SAEM VAR AN 10 VISIBLE SUM OF VAR AN 1 IM OUTTA YR LOOP KTHXBYE LOLCODE """" true https://en.wikipedia.org/wiki/LOLCODE 0 0 lolcode.org LOLCODE LOLCODE scroll Scroll 2019 Breck Yunits 37 textMarkup staticSiteGenerator commandLineApp dataNotation dataValidationLanguage wikiMarkup https://scroll.pub/ 0 https://scroll.pub/blog/ https://scroll.pub/releaseNotes.html 93.2.0 373 1 6 23915 true 3 org podlite quaint https://github.com/breck7/scroll textMarkup 2019 2024 2019 12 14 414 2 false 2019 2025 1956 9 331 43 92841 https://scroll.pub/roadmap.html https://try.scroll.pub/ 2021 Scroll is a language for scientists of all ages. Scroll has an unusually simple syntax, an extensive set of features needed by researchers, bloggers, knowledge bases and sites of all sizes, is highly expandable, and is familiar to anyone who knows Markdown. Scroll is a language for scientists of all ages. Scroll has an unusually simple syntax, an extensive set of features needed by researchers, bloggers, knowledge bases and sites of all sizes, is highly expandable, and is familiar to anyone who knows Markdown. Breck's Lab Scroll is a language for scientists of all ages. Scroll has an unusually simple syntax, an extensive set of features needed by researchers, bloggers, knowledge bases and sites of all sizes, is highly expandable, and is familiar to anyone who knows Markdown. scroll parsers particles javascript yaml css json html csv tsv json rss txt https://scroll.pub/leetsheet.html true true 467 0 70 markdown particles parsers markdown lisp javascript haml html python tsv csv yaml jekyll wordpress tex mathematica dplyr antlr reactjs particles 1 false 93 true https://scroll.pub/faq.html United States title This is Scroll. The keyword for title is title. * Scroll is an extensible alternative to Markdown. You extend it by writing parsers. https://www.tiktok.com/@scrollhits https://www.youtube.com/@breckyunits https://www.reddit.com/r/WorldWideScroll/ https://github.com/breck7/scroll true true true true true false 0 0 scroll.pub mathics mathics 2012 20 pl https://mathics.github.io/ 0 5.0.0 374 1 16 23913 true 0 https://github.com/mathics/Mathics pl 2011 2024 2011 68 208 2075 161 false 2011 2021 5749 59 299 22 129740 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. 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. https://github.com/Mathics3 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. python mathematica yaml restructuredtext svg bourne-shell xml make tex markdown csv matlab html perl json ini true 2760 0 36 false 5 true https://tio.run/#mathics text United States https://news.ycombinator.com/item?id=11459186 "StringJoin[Riffle[Map[ToString, Table[Fibonacci[i], {i,16}]], "", ""]] <> ""...""" https://github.com/mathics/Mathics http://nbviewer.ipython.org/gist/sn6uv/8381447 0 0 mathics.github.io particles Particles 2017 Breck Yunits 31 dataNotation https://particles.scroll.pub 2 78.0.0 375 1 9 23912 true 8 parsers parsers parsers scroll scroll scroll speedie tql https://github.com/breck7/scrollsdk dataNotation 2017 2024 9 17 379 2 false Particle Notation Scroll Notation 2017 2025 1597 11 230 34 81413 https://sdk.scroll.pub/sandbox/ 2019 A minimalist notation consisting of just the word break rule, line break rule, and the off-side rule. A minimalist notation consisting of just the word break rule, line break rule, and the off-side rule. Breck's Lab A minimalist notation consisting of just the word break rule, line break rule, and the off-side rule. javascript typescript html json svg css yaml xml markdown https://scroll.pub/particlesLeetsheet.html true true 443 0 72 i-expressions json yaml toml xml haml ini parsers haml treesheets racket lisp haskell antlr typescript mathematica scheme python csharp red cobol rebol apl r html css xml json cpp forth fortran sql 1 false 78 true title Particle Notation type dataNotation example title Particle Notation type dataNotation https://www.tiktok.com/@scrollhits https://www.youtube.com/@breckyunits https://www.reddit.com/r/WorldWideScroll/ https://github.com/breck7/scrollsdk false false true 0 0 treenotation.org emberjs-framework emberjs-framework 2011 Yehuda Katz 15 framework https://emberjs.com/ 0 5.10.0-alpha.1 376 0 7 23909 false 0 https://github.com/emberjs/ember.js framework 2011 2024 2011 848 4214 22462 361 false 2011 2025 28940 1231 1263 89 199101 2011 https://github.com/emberjs typescript typescript javascript json markdown yaml html handlebars true 36337 0 22 1 false 5 true United States https://twitter.com/emberjs https://github.com/emberwatch/ember-language-server https://github.com/emberjs/ember.js 0 0 emberjs.com datascript datascript 2014 15 queryLanguage 0 1.6.5 377 1 9 23907 true 1 project-mentat https://github.com/tonsky/DataScript queryLanguage 2014 2024 2014 149 301 5432 76 false 2014 2025 788 78 107 3 17843 https://www.patreon.com/tonsky bourne-shell clojure javascript markdown clojurescript html yaml svg json true 6414 0 25 false 1 true Germany "(require '[datascript.core :as d]) ;; Implicit join, multi-valued attribute (let [schema {:aka {:db/cardinality :db.cardinality/many}} conn (d/create-conn schema)] (d/transact! conn [ { :db/id -1 :name ""Maksim"" :age 45 :aka [""Max Otto von Stierlitz"", ""Jack Ryan""] } ]) (d/q '[ :find ?n ?a :where [?e :aka ""Max Otto von Stierlitz""] [?e :name ?n] [?e :age ?a] ] @conn)) ;; => #{ [""Maksim"" 45] } ;; Destructuring, function call, predicate call, query over collection" https://github.com/tonsky/DataScript ; true true false 0 0 q Q 2003 Arthur Whitney 25 pl arrayLang 0 378 4 23903 true 2 lil xs-lang pl 157 170 768 text source.q programming false q/Q.q 73 2015 2018 2 7 q.py 2003 q-equational-programming-language scheme k apl sql 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. 2008 99 23 91 18595067 Kx Systems q q q 765 0 26 1 text 559 q http://www.rosettacode.org/wiki/Category:Q Q "/* Hello world in Q */ hello = writes ""Hello, world!\n"";" """Hello World"" " "dst:`:tq src:`:tqsrc F:key src / trade fields (types;widths) trf after 200609 tf:`time`ex`sym`s`cond`size`price`stop`corr`seq`cts`trf tt:(""TCSS*IFBIJCC "";9 1 6 10 4 9 11 1 2 16 1 1,1+20060930<""I""$-8#string first F) / quote fields (types;widths) qf:`time`ex`sym`s`bid`bsize`ask`asize`cond`mmid`bex`aex`seq`bbo`qbbo`corr`cqs qt:(""TCSSFIFIC*CCJCCCC "";9 1 6 10 11 7 11 7 1 4 1 1 16 1 1 1 1 2) / sym[.s] ""e""$pricebidask g:{[f;x]`sym`time xcols delete s from @[;`sym;{$[null y;x;` sv x,y]}';x`s]@[x;f;""e""$%;1e4]} foo:{[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]} \t foo[`trade;tf;tt;g[`price] ]each F where F like""taqtrade*[0-9]""; \t foo[`quote;qf;qt;g[`bid`ask]]each F where F like""taqquote*[0-9]""; \ http://www.nyxdata.com/Data-Products/Daily-TAQ " Q "q)select from t where name like ""ja*"",age>50 name age -------- jack 60 q)select rows:count i by age from t age| rows ---| ---- 20 | 1 50 | 2 60 | 1" Q """" true https://github.com/newtux/KdbQ_kernel https://en.wikipedia.org/wiki/Q_(programming_language_from_Kx_Systems) 1 2 Q q https://github.com/komsit37/sublime-q year|publisher|title|authors|isbn13\n2008|CreateSpace Independent Publishing Platform|Q For Mortals: A Tutorial In Q Programming|Borror, Jeffry A.|9781434829016 q 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 felix Felix 2001 John Skaller 36 pl http://felix-lang.github.io/felix/ 0 379 2 29 23901 true 0 https://github.com/felix-lang/felix pl 2010 2024 2001 42 44 799 39 false f/Felix.flx felix.py 2001 2024 8529 61 3152 91 776238 felix-language@googlegroups.com flx flx flxh ocaml restructuredtext python c cpp make html tex bourne-shell elixir svg markdown haskell yaml vim-script xml scala java perl ada css pascal lisp m4 xhtml clojure objective-c bash nix true 994 0 140 1 false https://groups.google.com/g/felix-language Australia http://web.archive.org/web/20080415185225/http://felix-lang.org/ "#import fun abs_div(a:int, b:int when b!=0) expect result >=0 => abs(a/b) ; print (abs_div(2,4)); print ""\n"";" "println$ ""Hello World""; " Felix Felix _ _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 https://github.com/felix-lang/felix // println """" true true true true true true true true true true true true true false true 0 0 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 transact-sql Transact-SQL 1984 25 queryLanguage 0 380 1 23900 true 0 queryLanguage false sql.py 23 2000 sql pl-sql plpgsql sql-psm Transact-SQL (T-SQL) is Microsoft's and Sybase's proprietary extension to the SQL (Structured Query Language) used to interact with relational databases. T-SQL expands on the SQL standard to include procedural programming, local variables, various support functions for string processing, date processing, mathematics, etc. and changes to the DELETE and UPDATE statements. Transact-SQL is central to using Microsoft SQL Server. All applications that communicate with an instance of SQL Server do so by sending Transact-SQL statements to the server, regardless of the user interface of the application. 2003 299 75 306 295710 sql typescript 1515 0 512 text https://github.com/antlr/grammars-v4/tree/master/sql/tsql http://www.rosettacode.org/wiki/Category:Transact-SQL Transact-SQL -- begin transaction BEGIN TRAN BEGIN TRY -- execute each statement INSERT INTO MYTABLE(NAME) VALUES ('ABC') INSERT INTO MYTABLE(NAME) VALUES ('123') -- commit the transaction COMMIT TRAN END TRY BEGIN CATCH -- roll back the transaction because of error ROLLBACK TRAN END CATCH https://github.com/Microsoft/vscode-mssql/tree/dev/src/languageservice ABSOLUTE ACTION ADA ADD ADMIN AFTER AGGREGATE ALIAS ALL ALLOCATE ALTER AND ANY ARE ARRAY AS ASC ASENSITIVE ASSERTION ASYMMETRIC AT ATOMIC AUTHORIZATION AVG BACKUP BEFORE BEGIN BETWEEN BINARY BIT BIT_LENGTH BLOB BOOLEAN BOTH BREADTH BREAK BROWSE BULK BY CALL CALLED CARDINALITY CASCADE CASCADED CASE CAST CATALOG CHAR CHAR_LENGTH CHARACTER CHARACTER_LENGTH CHECK CHECKPOINT CLASS CLOB CLOSE CLUSTERED COALESCE COLLATE COLLATION COLLECT COLUMN COMMIT COMPLETION COMPUTE CONDITION CONNECT CONNECTION CONSTRAINT CONSTRAINTS CONSTRUCTOR CONTAINS CONTAINSTABLE CONTINUE CONVERT CORR CORRESPONDING COUNT COVAR_POP COVAR_SAMP CREATE CROSS CUBE CUME_DIST CURRENT CURRENT_CATALOG CURRENT_DATE CURRENT_DEFAULT_TRANSFORM_GROUP CURRENT_PATH CURRENT_ROLE CURRENT_SCHEMA CURRENT_TIME CURRENT_TIMESTAMP CURRENT_TRANSFORM_GROUP_FOR_TYPE CURRENT_USER CURSOR CYCLE DATA DATABASE DATE DAY DBCC DEALLOCATE DEC DECIMAL DECLARE DEFAULT DEFERRABLE DEFERRED DELETE DENY DEPTH DEREF DESC DESCRIBE DESCRIPTOR DESTROY DESTRUCTOR DETERMINISTIC DIAGNOSTICS DICTIONARY DISCONNECT DISK DISTINCT DISTRIBUTED DOMAIN DOUBLE DROP DUMP DYNAMIC EACH ELEMENT ELSE END END-EXEC EQUALS ERRLVL ESCAPE EVERY EXCEPT EXCEPTION EXEC EXECUTE EXISTS EXIT EXTERNAL EXTRACT FALSE FETCH FILE FILLFACTOR FILTER FIRST FLOAT FOR FOREIGN FORTRAN FOUND FREE FREETEXT FREETEXTTABLE FROM FULL FULLTEXTTABLE FUNCTION FUSION GENERAL GET GLOBAL GO GOTO GRANT GROUP GROUPING HAVING HOLD HOLDLOCK HOST HOUR IDENTITY IDENTITY_INSERT IDENTITYCOL IF IGNORE IMMEDIATE IN INCLUDE INDEX INDICATOR INITIALIZE INITIALLY INNER INOUT INPUT INSENSITIVE INSERT INT INTEGER INTERSECT INTERSECTION INTERVAL INTO IS ISOLATION ITERATE JOIN KEY KILL LANGUAGE LARGE LAST LATERAL LEADING LEFT LESS LEVEL LIKE LIKE_REGEX LIMIT LINENO LN LOAD LOCAL LOCALTIME LOCALTIMESTAMP LOCATOR LOWER MAP MATCH MAX MEMBER MERGE METHOD MIN MINUTE MOD MODIFIES MODIFY MODULE MONTH MULTISET NAMES NATIONAL NATURAL NCHAR NCLOB NEW NEXT NO NOCHECK NONCLUSTERED NONE NORMALIZE NOT NULL NULLIF NUMERIC OBJECT OCCURRENCES_REGEX OCTET_LENGTH OF OFF OFFSETS OLD ON ONLY OPEN OPENDATASOURCE OPENQUERY OPENROWSET OPENXML OPERATION OPTION OR ORDER ORDINALITY OUT OUTER OUTPUT OVER OVERLAPS OVERLAY PAD PARAMETER PARAMETERS PARTIAL PARTITION PASCAL PATH PERCENT PERCENT_RANK PERCENTILE_CONT PERCENTILE_DISC PIVOT PLAN POSITION POSITION_REGEX POSTFIX PRECISION PREFIX PREORDER PREPARE PRESERVE PRIMARY PRINT PRIOR PRIVILEGES PROC PROCEDURE PUBLIC RAISERROR RANGE READ READS READTEXT REAL RECONFIGURE RECURSIVE REF REFERENCES REFERENCING REGR_AVGX REGR_AVGY REGR_COUNT REGR_INTERCEPT REGR_R2 REGR_SLOPE REGR_SXX REGR_SXY REGR_SYY RELATIVE RELEASE REPLICATION RESTORE RESTRICT RESULT RETURN RETURNS REVERT REVOKE RIGHT ROLE ROLLBACK ROLLUP ROUTINE ROW ROWCOUNT ROWGUIDCOL ROWS RULE SAVE SAVEPOINT SCHEMA SCOPE SCROLL SEARCH SECOND SECTION SECURITYAUDIT SELECT SEMANTICKEYPHRASETABLE SEMANTICSIMILARITYDETAILSTABLE SEMANTICSIMILARITYTABLE SENSITIVE SEQUENCE SESSION SESSION_USER SET SETS SETUSER SHUTDOWN SIMILAR SIZE SMALLINT SOME SPACE SPECIFIC SPECIFICTYPE SQL SQLCA SQLCODE SQLERROR SQLEXCEPTION SQLSTATE SQLWARNING START STATE STATEMENT STATIC STATISTICS STDDEV_POP STDDEV_SAMP STRUCTURE SUBMULTISET SUBSTRING SUBSTRING_REGEX SUM SYMMETRIC SYSTEM SYSTEM_USER TABLE TABLESAMPLE TEMPORARY TERMINATE TEXTSIZE THAN THEN TIME TIMESTAMP TIMEZONE_HOUR TIMEZONE_MINUTE TO TOP TRAILING TRAN TRANSACTION TRANSLATE TRANSLATE_REGEX TRANSLATION TREAT TRIGGER TRIM TRUE TRUNCATE TRY_CONVERT TSEQUAL UESCAPE UNDER UNION UNIQUE UNKNOWN UNNEST UNPIVOT UPDATE UPDATETEXT UPPER USAGE USE USER USING VALUE VALUES VAR_POP VAR_SAMP VARCHAR VARIABLE VARYING VIEW WAITFOR WHEN WHENEVER WHERE WHILE WIDTH_BUCKET WINDOW WITH WITHIN WITHIN GROUP WITHOUT WORK WRITE WRITETEXT XMLAGG XMLATTRIBUTES XMLBINARY XMLCAST XMLCOMMENT XMLCONCAT XMLDOCUMENT XMLELEMENT XMLEXISTS XMLFOREST XMLITERATE XMLNAMESPACES XMLPARSE XMLPI XMLQUERY XMLSERIALIZE XMLTABLE XMLTEXT XMLVALIDATE YEAR ZONE -- TRUE FALSE true true true true true true true false https://en.wikipedia.org/wiki/Transact-SQL 8 0 Transact-SQL year|publisher|title|authors|isbn13\n2005|Wrox|Beginning Transact-SQL with SQL Server 2000 and 2005|Turley, Paul|9780764579554\n2017|Microsoft Press|Exam Ref 70-761 Querying Data with Transact-SQL|Ben-Gan, Itzik|9781509304356\n2002|O'Reilly Media|Transact-SQL Cookbook: Help for Database Programmers|Spetic, Ales and Gennick, Jonathan|9781565927568\n1999|O'Reilly Media|Transact-SQL Programming: Covers Microsoft SQL Server 6.5 /7.0 and Sybase Adaptive Server 11.5|Kline, Kevin and Gould, Lee and Zanevsky, Andrew|9781565924017 title|year|author|goodreadsId|rating|ratings|reviews\nTransact-SQL Programming|2001|Kevin E. Kline|4331369|3.00|2|0\nTransact-SQL (IDG Professional Programming)|1998|William C. Amo|1868897|2.67|3|0\nOptimizing Transact-SQL: Advanced Programming Techniques|1997|David Rozenshtein|1868901|4.33|3|0\nTransact-SQL Programming Black Book [With CDROM]||Paul Whitehead|20682980|0.0|0|0 mochajs mochajs 2011 TJ Holowaychuk and Guillermo Rauch 15 library https://mochajs.org/ 0 10.4.0 381 0 11 23896 true 0 https://github.com/mochajs/mocha library 2011 2024 2011 397 3001 22515 217 false 2011 2025 4170 590 542 27 80608 2014 https://github.com/mochajs javascript markdown yaml json svg css html coffeescript liquid toml typescript true 32110 0 27 2 false 10 true text Denmark and Republic of Korea and United States and Switzerland https://github.com/mochajs/mocha 0 0 mochajs.org common-workflow-language CWL 2014 Luka Stojanovic 26 pl https://www.commonwl.org/ 0 3.1.20240508115724 382 1 11 23895 true 0 https://github.com/common-workflow-language/cwltool pl 57 75 464 0 cwl cwl-runner yaml yaml text/x-yaml source.cwl programming 2015 2024 2014 44 227 326 470 false 41 2017 2018 1 5 Software Freedom Conservancy 2014 2025 5156 171 1061 13 167173 2015 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. 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. https://w3id.org/cwl/meeting_minutes 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. cwl python yaml markdown json restructuredtext bourne-shell javascript make ini dockerfile toml true 1380 0 41 1 false 3 true text Various https://doi.org/10.6084/m9.figshare.3115156.v2 #!/usr/bin/env cwl-runner # Originally from # https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/utils/trunk-peak-score.cwl # Released under the MIT License: # https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/LICENSE # Converted to CWL v1.0 syntax using # https://github.com/common-workflow-language/cwl-upgrader # and polished by Michael R. Crusoe # All modifications also released under the MIT License cwlVersion: v1.0 class: CommandLineTool doc: Trunk scores in ENCODE bed6+4 files hints: DockerRequirement: dockerPull: dukegcb/workflow-utils inputs: peaks: type: File sep: type: string default: \t outputs: trunked_scores_peaks: type: stdout baseCommand: awk arguments: - -F $(inputs.sep) - BEGIN{OFS=FS}$5>1000{$5=1000}{print} - $(inputs.peaks.path) stdout: $(inputs.peaks.nameroot).trunked_scores$(inputs.peaks.nameext) https://twitter.com/commonwl https://github.com/common-workflow-language/cwltool # true true false 0 0 commonwl.org Common Workflow Language https://github.com/manabuishii/language-cwl Common Workflow Language hhvm HHVM 2011 15 vm https://hhvm.com 0 383 0 60 23890 false 0 https://github.com/facebook/hhvm vm 2010 2024 2010 1004 2987 18084 536 false 2010 2025 76389 2733 90613 789 12321082 2006 2011 ocaml php hack csharp jvm java parrot-vm HipHop Virtual Machine (HHVM) is an open-source virtual machine based on just-in-time (JIT) compilation that serves as an execution engine for the PHP and Hack programming languages. By using the principle of JIT compilation, executed PHP or Hack code is first transformed into intermediate HipHop bytecode (HHBC), which is then dynamically translated into x86-64 machine code, optimized, and natively executed. This contrasts with PHP's usual interpreted execution, in which the Zend Engine transforms PHP source code into opcodes that serve as a form of bytecode, and executes the opcodes directly on the Zend Engine's virtual CPU.HHVM is developed by Facebook, with the project's source code hosted on GitHub; it is licensed under the terms of the PHP License and Zend License. 2014 136 226 167 42020002 Facebook php cpp expect markdown json java ocaml rust python cython mustache thrift cmake html yaml pascal c toml xml go sql bourne-shell ini make protobuf javascript diff restructuredtext csharp assembly-language puppet m4 css bash xslt objective-c ruby perl svg idl dockerfile csv nix awk xsd coffeescript xaml bazel gradle llvmir typescript lisp yacc opencl dtd vim-script sas sed lex cadence-skill true 30480 0 75 false text United States https://github.com/facebook/hhvm https://en.wikipedia.org/wiki/HHVM 1 0 hhvm.com title|year|author|goodreadsId|rating|ratings|reviews\nHack and Hhvm: Programming Productivity Without Breaking Things|2015|Owen Yamauchi|46739673|3.67|6|2 jsf JSFuck 2012 Martin Kleppe 16 esolang http://www.jsfuck.com/ 0 0.5.0 384 1 4 23890 true 0 https://github.com/aemkei/jsfuck esolang 2012 2024 2012 131 671 8070 36 false 2012 2024 243 27 15 1 1468 2012 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. 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. https://github.com/aemkei/jsfuck/issues 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. javascript json markdown html true 10132 0 20 1 false 0 true Germany https://riju.codes/jsf [][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![] +[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+( !![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![] +[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!! []]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(! ![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!! []+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[ ])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+! ![]]+([][[]]+[])[+!![]]+(![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![] ]+(!![]+[])[+[]]])[!![]+!![]+[+[]]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![ ]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!! []+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[ ])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(! ![]+[])[+[]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[])[!![]+!![]+!![]])()[(![ ]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![ ]+[])[+[]]])[+!![]+[+[]]]+(+[]+[![]]+([]+[])[([]+[][(![]+[])[+[]]+(![]+[])[!![]+ !![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(! []+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![ ]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([] +[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![] +!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]] +(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]])[!![]+!![]+[+[]]]]([][(![]+[])[ +[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]+[])[+[]]+(! []+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![] +[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][ []]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+ [])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]] ])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![ ]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(! ![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]] +[])[+!![]]+([]+[])[(![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![ ]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([] +[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![] +!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]] ])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+( ![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![ ]]]+(![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([ ]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![ ]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[] ]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![ ]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[ +!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(! []+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]] ]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!! []+[])[+!![]]+([][[]]+[])[+!![]]+(!![]+[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[ +[]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+ !![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+! ![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]]+![]+(!![]+[])[(![]+[])[!![]+!![]+!![]]+([ ][[]]+[])[+[]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+( !![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[! ![]+!![]+!![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]])()[([]+[][(![]+[])[+[]]+(![]+[] )[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[ +[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[ ])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+ []]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!! []+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[]) [+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]](([]+[])[([![]]+[][[]])[+ !![]+[+[]]]+(!![]+[])[+[]]+(![]+[])[+!![]]+(![]+[])[!![]+!![]]+([![]]+[][[]])[+! ![]+[+[]]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[ ]]])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()))[+!![]+[+[]]]+(+!![])+(+!![])+ (+[])+([]+[])[(![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[ +!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(! []+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]] +(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!! []+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[] )[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![]]])() +(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]+(!![]+[][(![] +[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][ (![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]+[] )[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(![] +[])[+!![]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]](![]+[])+[])[+!![]]+(![]+[][ (![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+[+[ ]]]+(+(+!![]+[+!![]]+(+!![])+(!![]+!![])))[(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]] +(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([]+[])[([]+[ ][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+! ![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]]) [+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[ ])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!! []]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+ [])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]][( [][[]]+[])[+!![]]+(![]+[])[+!![]]+([]+(+[])[([]+[][(![]+[])[+[]]+(![]+[])[!![]+! ![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![ ]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![] ]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+ [][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+ !![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+ (!![]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]])[+!![]+[+!![]]]+(!![]+[])[!![]+! ![]+!![]]]](!![]+!![]+!![]+[!![]+!![]+!![]+!![]])+(!![]+[])[+!![]]+(![]+[])[!![] +!![]]+([][[]]+[])[!![]+!![]]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![ ]]+(!![]+[])[+[]]][([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![ ]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[]) [+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![] ]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[]) [!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![ ]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+ []]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]] +([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([]+[])[(![]+[])[+[]]+(!![ ]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+ []]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+ (![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[]) [!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(! ![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+ [+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![]]]+(![]+[][(![]+[])[+[]]+(![]+[])[!![ ]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]][([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]] +(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[] )[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(! []+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][( ![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![] ]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![ ]+[])[+[]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![] +!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+(!![] +[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[+[]]+([][(!![]+[])[!![]+!![]+!![]]+([] [[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![ ]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]] +![]+(!![]+[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[+[]]+([][(!![]+[])[!![]+!![] +!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[ +[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]]()[+! ![]+[+[]]])()[([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[]) [+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![ ]]+(!![]+[])[+[]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!! []+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![] +!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][ (![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+ (!![]+[])[+!![]]](([]+[])[([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[+[]]+(![]+[])[+! ![]]+(![]+[])[!![]+!![]]+([![]]+[][[]])[+!![]+[+[]]]+([]+[][(![]+[])[+[]]+(![]+[ ])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(![]+[])[!![]+!![ ]+!![]]]()))[+!![]+[+[]]]+(!![]+!![]+!![]+!![])+(+!![])+([]+[])[(![]+[])[+[]]+(! ![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+ [+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+(![]+[])[!![]+!![] ]+(![]+[])[+!![]]+(!![]+[])[+[]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+(![]+[ ])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+ (!![]+[][(![]+[])[+[]]+(![]+[])[!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]])[+!![ ]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[!![]+!![]]])()) https://github.com/aemkei/jsfuck https://en.wikipedia.org/wiki/JSFuck 0 0 jsfuck.com datalog Datalog 1977 23 pl 0 385 2 23887 3793 true 3 datomic scallop yedalog pl false prolog java owl c python ruby lua clojure racket tcl haskell dot-ql rdf sparql 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. 2004 160 87 376 968357 University of Maryland 820 0 25 datomic text https://github.com/antlr/grammars-v4/tree/master/datalog http://www.rosettacode.org/wiki/Category:Datalog Italy https://percival.jake.tl/ parent(john, douglas). % store some data parent(john, douglas)? % run a query ancestor(X,Y) :- parent(X,Y). ancestor(X,Y) :- parent(X,Z),ancestor(Z,Y). % true true false https://en.wikipedia.org/wiki/Datalog 3 36 https://hopl.info/showlanguage.prx?exp=3793 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 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 sizzle sizzle 2008 16 queryLanguage https://sizzlejs.com/ 0 2.3.11-pre 386 0 6 23879 true 0 https://github.com/jquery/sizzle queryLanguage 2008 2024 2008 291 953 6279 11 false 2008 2023 1067 65 76 5 88331 2008 https://github.com/jquery javascript json html css markdown yaml true 9205 0 22 false 2 true text United States https://openjsf.org/about/contact/ https://github.com/jquery/sizzle 2 0 sizzlejs.com 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 soap SOAP 1998 Dave Winer and Don Box and Bob Atkinson and Mohsen Al-Ghosein 15 xmlFormat 0 387 1 23867 true 0 xmlFormat false Simple Object Access Protocol 1998 http smtp linux xml tcp wddx rfc wsdl tls json rest 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. 2001 2103 752 1982 29215 Microsoft 10535 7493 18 4 https://knowledge.channeladvisor.com/kc?id=kb_article&sysparm_article=KB0018150&sys_kb_id=b02d13c91bd5d1d42d9eea40604bcb2e&spa=1 text 5253 United States "POST /InStock HTTP/1.1 Host: www.example.org Content-Type: application/soap+xml; charset=utf-8 Content-Length: 299 SOAPAction: ""http://www.w3.org/2003/05/soap-envelope"" GOOGLE " https://en.wikipedia.org/wiki/SOAP 11 8 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 soap language 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 boo Boo 2003 Rodrigo B. De Oliveira 38 pl https://boo-language.github.io/ https://github.com/boo-lang 0 388 4 23867 true 0 pl 208 241 232 2 "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""" text source.boo programming false b/Boo.boo 56 2012 2016 5 dotnet.py 2003 csharp python genie vala unicode unity-engine fantom groovy nemerle rebol 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. 2004 128 127 274 1147624 The Boo Programming Language boo boo boo boo true 861 0 41 1 https://tio.run/#boo https://bootest.readthedocs.io/en/latest/ text http://www.rosettacode.org/wiki/Category:Boo Brasil Boo "# Hello World in Boo print ""Hello World"" " "print ""Hello World"" " Boo https://riju.codes/boo "print ""Hello, world!"" " "def fib(): a, b = 0L, 1L # The 'L's make the numbers double word length (typically 64 bits) while true: yield b a, b = b, a + b # Print the first 5 numbers in the series: for index as int, element in zip(range(5), fib()): print(""${index+1}: ${element}"")" Boo https://github.com/boo-lang/boo # print """" true true true true true true true true true true true https://en.wikipedia.org/wiki/Boo_(programming_language) 0 0 Boo Boo https://github.com/Shammah/boo-sublime Boo parsers Parsers 2017 Breck Yunits 29 grammarLanguage compiler https://sdk.scroll.pub/langs/parsers/ 2 https://sdk.scroll.pub/langs/parsers/ 77.1.0 389 1 9 23866 true 5 particles scroll scroll speedie tql https://github.com/breck7/scrollsdk grammarLanguage 2017 2024 2017 9 17 379 2 false Grammar 2017 2025 1597 11 230 34 81413 https://sdk.scroll.pub/langs/parsers/ https://sdk.scroll.pub/designer/ Parsers is a language for building languages on top of Particle Notation. A compiler compiler. By creating a parsers file you get a parser, a type checker, syntax highlighting, autocomplete, a compiler, and interpreter for executing your new language. Parsers uses both postfix and prefix language features. Parsers is a language for building languages on top of Particle Notation. A compiler compiler. By creating a parsers file you get a parser, a type checker, syntax highlighting, autocomplete, a compiler, and interpreter for executing your new language. Parsers uses both postfix and prefix language features. Breck's Lab Parsers is a language for building languages on top of Particle Notation. A compiler compiler. By creating a parsers file you get a parser, a type checker, syntax highlighting, autocomplete, a compiler, and interpreter for executing your new language. Parsers uses both postfix and prefix language features. particles javascript typescript html json svg css yaml markdown https://scroll.pub/parserLeetsheet.html true true 443 0 45 particles antlr antlr yacc ebnf bnf particles 1 false 77 true United States and Ireland and Norway and India latinNode root catchAllParser anyNode anyNode baseParser blobNode https://www.tiktok.com/@scrollhits https://www.youtube.com/@breckyunits https://www.reddit.com/r/WorldWideScroll/ https://github.com/breck7/scrollsdk true false 0 0 numba Numba 2012 Travis E. Oliphant 14 compiler http://numba.pydata.org/ 0 0.59.1 390 1 15 23864 true 1 triton https://github.com/numba/numba compiler 2012 2024 2012 202 1110 9676 1624 false 2012 2025 28706 465 1019 83 388802 Numba is an open source JIT compiler that translates a subset of Python and NumPy code into fast machine code. Numba is an open source JIT compiler that translates a subset of Python and NumPy code into fast machine code. https://github.com/numba Numba is an open source JIT compiler that translates a subset of Python and NumPy code into fast machine code. python restructuredtext c yaml cpp bourne-shell markdown cuda svg javascript html make toml ini css true 13473 0 29 1 false 0 true United States and United Kingdom and Germany from numba import njit import random @njit def monte_carlo_pi(nsamples): acc = 0 for i in range(nsamples): x = random.random() y = random.random() if (x ** 2 + y ** 2) < 1.0: acc += 1 return 4.0 * acc / nsamples https://github.com/numba/numba 0 0 doi DOI 2000 15 schema https://www.doi.org/ 0 391 1 23855 true 0 schema false Digital Object Identifier 1999 2004 4196 910 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. 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. ISO 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. 21001 0 15 https://www.doi.org/factsheets/DOIProxy.html text Switzerland https://doi.org/10.1000/182 https://en.wikipedia.org/wiki/Digital_object_identifier 0 0 doi.org simple-binary-encoding Simple Binary Encoding 2013 Scott Logic 17 pl https://yafetn.github.io/2023/01/12/sbe.html 0 https://github.com/real-logic/simple-binary-encoding/wiki/Blogs-and-Announcements https://github.com/real-logic/simple-binary-encoding/wiki/Change-Log 1.31.1 392 0 16 23854 true 0 https://github.com/real-logic/simple-binary-encoding pl 2013 2024 209 520 3055 37 false 2013 2025 3828 132 480 29 38942 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 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 https://github.com/FIXTradingCommunity/fix-simple-binary-encoding 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 java xml go csharp cpp rust cmake bourne-shell markdown yaml gradle bash xsd make toml c true 4749 0 36 python java rust 1 false 1 true https://github.com/real-logic/simple-binary-encoding/wiki https://github.com/real-logic/simple-binary-encoding https://github.com/real-logic/simple-binary-encoding 0 0 assemblyscript AssemblyScript 2017 15 pl https://assemblyscript.org 0 v0.27.27 393 1 9 23848 true 0 https://github.com/AssemblyScript/assemblyscript pl 2017 2024 2017 198 649 16642 188 false 2017 2025 1816 86 1259 162 1216885 2017 The AssemblyScript Project typescript wasm json javascript markdown yaml html svg xml true 18677 0 25 typescript false 0 true Ukraine and Germany /** Calculates the n-th Fibonacci number. */ export function fib(n: i32): i32 { var a = 0, b = 1 if (n > 0) { while (--n) { let t = a + b a = b b = t } return b } return a } https://twitter.com/assemblyscript https://github.com/AssemblyScript/assemblyscript 0 0 assemblyscript.org xarray Xarray 2013 Maximilian Roos 16 library dataVis https://xarray.dev/ 0 https://xarray.dev/blog 394 0 12 23844 true 0 https://github.com/pydata/xarray library 2013 2024 109 1050 3528 1151 false 2013 2025 5907 607 379 50 213243 https://docs.xarray.dev/en/stable/roadmap.html https://xarray.dev/#repl Xarray is an open source project and Python package that introduces labels in the form of dimensions, coordinates, and attributes on top of raw NumPy-like arrays, which allows for more intuitive, more concise, and less error-prone user experience. Xarray is an open source project and Python package that introduces labels in the form of dimensions, coordinates, and attributes on top of raw NumPy-like arrays, which allows for more intuitive, more concise, and less error-prone user experience. Xarray is an open source project and Python package that introduces labels in the form of dimensions, coordinates, and attributes on top of raw NumPy-like arrays, which allows for more intuitive, more concise, and less error-prone user experience. python restructuredtext yaml markdown jupyter-notebook svg css json toml make bourne-shell html true 7287 0 28 1 false https://docs.xarray.dev/en/stable/ https://www.youtube.com/channel/UCBlxVSA6xQXeb-i4GgTlO7g https://twitter.com/xarray_dev https://github.com/pydata/xarray 0 0 mime MIME 1991 Nathaniel Borenstein and Ned Freed 17 textDataFormat 0 395 2 23840 true 0 textDataFormat false Multipurpose Internet Mail Extensions mime.py 1992 ftp http smtp tls tcp udp ascii rfc html 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). 2001 872 468 1106 19045 Carnegie Mellon 4380 1 18 2 https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/MIME_types text 9190 United States MIME-Version: 1.0 Content-Type: multipart/mixed; boundary=frontier This is a message with multiple parts in MIME format. --frontier Content-Type: text/plain This is the body of the message. --frontier Content-Type: application/octet-stream Content-Transfer-Encoding: base64 PGh0bWw+CiAgPGhlYWQ+CiAgPC9oZWFkPgogIDxib2R5PgogICAgPHA+VGhpcyBpcyB0aGUg Ym9keSBvZiB0aGUgbWVzc2FnZS48L3A+CiAgPC9ib2R5Pgo8L2h0bWw+Cg== --frontier-- MIME MIME-Version: 1.0 Content-Type: multipart/mixed; boundary=frontier This is a message with multiple parts in MIME format. --frontier Content-Type: text/plain This is the body of the message. --frontier Content-Type: application/octet-stream Content-Transfer-Encoding: base64 PGh0bWw+CiAgPGhlYWQ+CiAgPC9oZWFkPgogIDxib2R5PgogICAgPHA+VGhpcyBpcyB0aGUg Ym9keSBvZiB0aGUgbWVzc2FnZS48L3A+CiAgPC9ib2R5Pgo8L2h0bWw+Cg== --frontier-- https://en.wikipedia.org/wiki/MIME 1 1 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 MIME developer 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 ante Ante 2015 Jake Fecher 20 pl http://antelang.org 0 v0.8.0 396 2 7 23840 true 0 https://github.com/jfecher/ante pl 2015 2024 2015 32 78 1881 31 false a/Ante.ante 2020 2025 1469 21 164 40 25041 2018 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. 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. 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. ante rust nix toml markdown yaml json dockerfile true 2138 0 28 1 false 0 true https://tio.run/#ante text 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♥ https://riju.codes/ante "print ""Hello, world!"" " Ante https://github.com/jfecher/ante print true 0 1 antelang.org 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 nomnoml nomnoml 2014 Daniel Kallin 18 diagramLang https://www.nomnoml.com/ 0 397 1 7 23838 true 0 https://github.com/skanaar/nomnoml diagramLang 2014 2024 2014 41 209 2676 30 false 2014 2024 401 20 79 2 10556 https://www.nomnoml.com/ The sassy UML diagram renderer. The sassy UML diagram renderer. The sassy UML diagram renderer. nomnoml typescript javascript json css html markdown svg true 3325 0 27 1 false Sweden [Decorator pattern| [Component||+ operation()] [Client] depends --> [Component] [Decorator|- next: Component] [Decorator] decorates -- [ConcreteComponent] [Component] <:- [Decorator] [Component] <:- [ConcreteComponent] ] https://github.com/skanaar/nomnoml // true true true 0 0 mirah Mirah 2009 Charles Oliver Nutter 24 pl http://www.mirah.org 0 0.2.1 398 2 10 23838 true 0 https://github.com/mirah/mirah pl 32 43 68 0 ruby ruby text/x-ruby source.ruby programming 2010 2024 2008 40 61 863 140 false 458 2013 2018 76 2008 2017 2858 54 533 56 176296 2010 2009 jvm ruby java boo java-bytecode jruby csharp rails erb "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." 2010 12 15 63 27970668 https://github.com/mirah druby duby mirah html ruby java javascript markdown css bash yaml xml bourne-shell true 1382 0 34 1 false 0 true text http://www.rosettacode.org/wiki/Category:Mirah United States def foo(a:String, b:int) def fib(a:int) if a < 2 a else fib(a - 1) + fib(a - 2) end end https://github.com/mirah/mirah true false https://en.wikipedia.org/wiki/Mirah_(programming_language) 1 0 mirah.org Mirah https://github.com/atom/language-ruby year|publisher|title|authors|isbn13\n2011||Mirah (programming Language)|Nethanel Willy|9786136789286 Mirah prismjs Prism 2012 Lea Verou 15 library https://prismjs.com/ 0 1.29.0 399 0 11 23831 true 0 https://github.com/PrismJS/prism library 2012 2024 2012 121 1288 12155 403 false 2012 2022 3887 425 3718 15 272153 2012 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. 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. https://github.com/PrismJS 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. javascript html css svg markdown json yaml xml lua bash awk true 16446 0 31 codemirror monaco highlightjs ace pygments 1 false 1 true United States and Germany https://github.com/PrismJS/prism 0 0 prismjs.com pgbouncer PgBouncer 2007 Frank McGeough 17 application https://www.pgbouncer.org/ 0 400 0 9 23827 false 0 https://github.com/pgbouncer/pgbouncer application 2010 2024 56 436 2811 228 false 2007 2025 1712 108 147 4 51779 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. 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. https://github.com/pgbouncer/pgbouncer 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. c python bourne-shell markdown ini make yaml m4 toml true 4229 0 30 c postgresql sql plpgsql 1 false https://www.pgbouncer.org/faq.html unknown https://wiki.postgresql.org/wiki/PgBouncer https://github.com/pgbouncer/pgbouncer 0 0 pgbouncer.org isabelle Isabelle 1986 29 pl http://isabelle.in.tum.de/ 0 401 2 23826 true 1 lego pl 115 137 839 0 text source.isabelle.theory programming false 9 2014 2018 1 1 theorem.py 1986 standard-ml coq 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. 2002 71 32 150 161886 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. 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. University of Cambridge && Technische Universität München 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. ROOT thy thy scala true 576 0 35 text United Kingdom and Germany https://books.google.com/books?id=xwdqCQAAQBAJ&dq=isabelle+language+proof&lr= "theory HelloWorld imports Main begin section{*Playing around with Isabelle*} text{* creating a lemma with the name hello_world*} lemma hello_world: ""True"" by simp (*inspecting it*) thm hello_world text{* defining a string constant HelloWorld *} definition HelloWorld :: ""string"" where ""HelloWorld \ ''Hello World!''"" (*reversing HelloWorld twice yilds HelloWorld again*) theorem ""rev (rev HelloWorld) = HelloWorld"" by (fact List.rev_rev_ident) text{*now we delete the already proven List.rev_rev_ident lema and show it by hand*} declare List.rev_rev_ident[simp del] hide_fact List.rev_rev_ident (*It's trivial since we can just 'execute' it*) corollary ""rev (rev HelloWorld) = HelloWorld"" apply(simp add: HelloWorld_def) done text{*does it hold in general?*} theorem rev_rev_ident:""rev (rev l) = l"" proof(induction l) case Nil thus ?case by simp next case (Cons l ls) assume IH: ""rev (rev ls) = ls"" have ""rev (l#ls) = (rev ls) @ [l]"" by simp hence ""rev (rev (l#ls)) = rev ((rev ls) @ [l])"" by simp also have ""\ = [l] @ rev (rev ls)"" by simp finally show ""rev (rev (l#ls)) = l#ls"" using IH by simp qed corollary ""\(l::string). rev (rev l) = l"" by(fastforce intro: rev_rev_ident) end " Isabelle "theorem sqrt2_not_rational: ""sqrt (real 2) ∉ ℚ"" proof let ?x = ""sqrt (real 2)"" assume ""?x ∈ ℚ"" then obtain m n :: nat where sqrt_rat: ""¦?x¦ = real m / real n"" and lowest_terms: ""coprime m n"" by (rule Rats_abs_nat_div_natE) hence ""real (m^2) = ?x^2 * real (n^2)"" by (auto simp add: power2_eq_square) hence eq: ""m^2 = 2 * n^2"" using of_nat_eq_iff power2_eq_square by fastforce hence ""2 dvd m^2"" by simp hence ""2 dvd m"" by simp have ""2 dvd n"" proof- from ‹2 dvd m› obtain k where ""m = 2 * k"" .. with eq have ""2 * n^2 = 2^2 * k^2"" by simp hence ""2 dvd n^2"" by simp thus ""2 dvd n"" by simp qed with ‹2 dvd m› have ""2 dvd gcd m n"" by (rule gcd_greatest) with lowest_terms have ""2 dvd 1"" by simp thus False using odd_one by blast qed" https://isabelle.in.tum.de/repos/isabelle/file/tip/src/Tools/VSCode (* *) True False true true true true true true false https://en.wikipedia.org/wiki/Isabelle_(proof_assistant) 0 4 isabelle.in.tum.de Isabelle https://github.com/lsf37/Isabelle.tmbundle Isabelle 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 logica Logica 2020 Evgeny Skvortsov 20 queryLanguage https://logica.dev/ 0 402 1 12 23824 true 0 https://github.com/evgskv/logica queryLanguage 2020 2024 2020 37 88 1710 33 false 2020 2025 1075 30 433 7 177261 2020 Logica is an open source declarative logic programming language for data manipulation. Logica is a successor to Yedalog, a language created at Google earlier. Logica is an open source declarative logic programming language for data manipulation. Logica is a successor to Yedalog, a language created at Google earlier. https://github.com/EvgSkv/logica/issues Logica is an open source declarative logic programming language for data manipulation. Logica is a successor to Yedalog, a language created at Google earlier. lex python jupyter-notebook markdown json html yaml javascript vim-script protobuf css csv sql true 2006 0 34 1 false United States # Define natural numbers from 1 to 29. N(x) :- x in Range(30); # Define primes. Prime(prime: x) :- N(x), x > 1, ~( N(y), y > 1, y != x, Mod(x, y) == 0 ); https://github.com/evgskv/logica # true true false 1 0 logica.dev 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 rest REST 1996 Roy Fielding 14 protocol 0 403 0 23822 true 0 protocol false 1994 wsdl soap url xml html json http javascript "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." 2004 4834 381 2534 907222 University of California Irvine 24190 26215 14 1 https://restfulapi.net/ https://docs.github.com/en/rest text 1547 United States https://en.wikipedia.org/wiki/Representational_state_transfer 5 8 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 rest developer 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 smarty Smarty 2006 Monte Ohrt and Messju Mohr and Uwe Tews 21 template http://www.smarty.net 5 404 2 23822 true 5 ace cloc eiffel mgmt netbeans-editor template 14285 17325 31402 8 "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""" smarty smarty text/x-smarty text.html.smarty programming false 34 2005 2018 8 templates.py 2002 2006 php isbn twig 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. 2018 63 67 4 774939 http://groups.google.com/group/smarty-developers tpl tpl true 586 0 25 3 smarty tpl text smarty United States and Germany " {$title_text|escape} {* This is a little comment that won't be visible in the HTML source *} {$body_html} " Smarty define('SMARTY_DIR', 'smarty-2.6.22/'); require_once(SMARTY_DIR . 'Smarty.class.php'); $smarty = new Smarty(); $smarty->template_dir = './templates/'; $smarty->compile_dir = './templates/compile/'; $smarty->assign('title_text', 'TITLE: This is the Smarty basic example ...'); $smarty->assign('body_html', 'BODY: This is the message set using assign()'); $smarty->display('index.tpl'); https://en.wikipedia.org/wiki/Smarty_(template_engine) 4 0 Smarty smarty.net Smarty https://github.com/textmate/php-smarty.tmbundle 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 Smarty bcpl BCPL 1966 Martin Richards 28 pl 0 405 4 23820 374 true 0 pl false b/BCPL.bcl Basic Combined Programming Language 1966 cpl b c go pascal java fortran cpl "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." 2001 206 176 291 4052 University of Cambridge bcl 1050 0 31 1 http://www.math.bas.bg/bantchev/place/bcpl.html text https://github.com/antlr/grammars-v4/tree/master/bcpl http://www.rosettacode.org/wiki/Category:BCPL United Kingdom "GET ""LIBHDR"" LET START() = VALOF $( FOR I = 1 TO 5 DO WRITEF(""%N! = %I4*N"", I, FACT(I)) RESULTIS 0 $) AND FACT(N) = N = 0 -> 1, N * FACT(N - 1)" "GET ""LIBHDR"" LET START() BE $( WRITES(""Hello World*N"") $) " "GET ""LIBHDR"" GLOBAL $( COUNT: 200 ALL: 201 $) LET TRY(LD, ROW, RD) BE TEST ROW = ALL THEN COUNT := COUNT + 1 ELSE $( LET POSS = ALL & ~(LD | ROW | RD) UNTIL POSS = 0 DO $( LET P = POSS & -POSS POSS := POSS - P TRY(LD + P << 1, ROW + P, RD + P >> 1) $) $) LET START() = VALOF $( ALL := 1 FOR I = 1 TO 12 DO $( COUNT := 0 TRY(0, 0, 0) WRITEF(""%I2-QUEENS PROBLEM HAS %I5 SOLUTIONS*N"", I, COUNT) ALL := 2 * ALL + 1 $) RESULTIS 0 $)" BCPL // WRITES := true true true true false https://en.wikipedia.org/wiki/BCPL 4 5 https://hopl.info/showlanguage.prx?exp=374 bc 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 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 vim Vim 1991 Bram Moolenaar 14 editor https://www.vim.org/ 0 406 1 23816 false 0 editor false 1997 1991 c unix linux ios android vi tcl lua perl python racket ruby regex gzip ftp http unicode "Vim (; a contraction of Vi IMproved) is a clone, with additions, of Bill Joy's vi text editor program for Unix. It was written by Bram Moolenaar based on source for a port of the Stevie editor to the Amiga and first released publicly in 1991. Vim is designed for use both from a command-line interface and as a standalone application in a graphical user interface. Vim is free and open-source software and is released under a license that includes some charityware clauses, encouraging users who enjoy the software to consider donating to children in Uganda. The license is compatible with the GNU General Public License through a special clause allowing distribution of modified copies ""under the GNU GPL version 2 or any later version"".Although it was originally released for the Amiga, Vim has since been developed to be cross-platform, supporting many other platforms. In 2006, it was voted the most popular editor amongst Linux Journal readers; in 2015 the Stack Overflow developer survey found it to be the third most popular text editor; and in 2016 the Stack Overflow developer survey found it to be the fourth most popular development environment." 2001 696 852 965 32478 https://cheatsheets.zip/vim true 152267 0 15 vi 1 na https://vimawesome.com/ https://reddit.com/r/vim """ This is the Hello World program in Vim script. echo ""Hello, world!"" "" This is a simple while loop in Vim script. let i = 1 while i < 5 echo ""count is"" i let i += 1 endwhile" https://en.wikipedia.org/wiki/Vim_(text_editor) 0 0 vim.org chaiscript chaiscript 2009 17 pl http://chaiscript.com/ 0 v6.1.0 407 1 10 23814 true 0 https://github.com/ChaiScript/ChaiScript pl 2011 2024 2009 126 333 2912 126 false scripting.py 2009 2025 2392 83 386 7 48163 2009 https://github.com/ChaiScript chai cpp markdown yaml cmake bourne-shell ruby svg php pascal json true 3996 0 27 false 6 true United States and New Zealand "#include std::string helloWorld(const std::string &t_name) { return ""Hello "" + t_name + ""!""; } int main() { chaiscript::ChaiScript chai; chai.add(chaiscript::fun(&helloWorld), ""helloWorld""); chai.eval(R""( puts(helloWorld(""Bob"")); )""); }" ChaiScript https://github.com/ChaiScript/ChaiScript true true true 0 0 chaiscript.com yoptascript YoptaScript 2016 Sam Gozman 19 pl https://yopta.space/ https://yopta.space/ 0 2.0.4 408 2 7 23814 true 0 https://github.com/samgozman/YoptaScript pl 2016 2024 2016 52 106 2101 20 false Russian y/YoptaScript 2016 2024 591 26 53 5 14088 yopta javascript typescript yaml json html markdown css javascript true 2447 0 29 1 false 2 true "ксива.малява(""Hello World"") нах " https://riju.codes/yoptascript "красноглазое.чмо(""Привет мир!"") нах " YoptaScript https://github.com/samgozman/YoptaScript https://github.com/samgozman/YoptaScript ксива.малява """" true true 0 0 yopta.space mermaid mermaid 2014 Knut Sveidqvist 14 diagramLang https://mermaidjs.github.io/ 0 10.2.4 409 1 14 23806 true 0 https://github.com/mermaid-js/mermaid diagramLang 2014 2024 2014 639 6168 69540 981 false 2014 2025 13179 782 999 241 183096 https://github.com/mermaid-js typescript javascript markdown html yaml json svg bash css toml bourne-shell csv diff dockerfile true 88828 0 28 1 false 10 true Various "gitGraph: options { ""nodeSpacing"": 150, ""nodeRadius"": 10 } end commit branch newbranch checkout newbranch commit commit checkout master commit commit merge newbranch" https://github.com/mermaid-js/mermaid 0 0 mermaidjs.github.io isbn ISBN 1970 14 schema 0 410 1 23806 true 0 schema false 2001 9882 1814 https://isbndb.com 49430 53 14 https://isbndb.com/apidocs/v2 text 1659 United Kingdom 978-3-16-148410-0 https://en.wikipedia.org/wiki/International_Standard_Book_Number 3 18 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 isbn 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 oil oil 2016 17 pl http://www.oilshell.org/ 0 411 0 23 23803 true 0 https://github.com/oilshell/oil pl 2016 2024 2016 38 150 2797 500 false OSH 2016 2025 11988 101 5187 52 1946681 2016 Oil is a new Unix shell. Oil is a new Unix shell. https://github.com/oilshell Oil is a new Unix shell. python bourne-shell c markdown cpp assembly-language css m4 dockerfile yaml make bash r xml html expect javascript diff tex ini nix json z-shell true 3786 0 40 false 981 Various https://reddit.com/r/oilshell https://twitter.com/oilshellblog https://github.com/oilshell/oil 0 0 oilshell.org ebnf EBNF 1977 Niklaus Wirth 18 grammarLanguage 0 412 2 23802 755 true 1 parsers grammarLanguage 0 0 text ebnf text/x-ebnf source.ebnf data false 42 2012 2016 4 2 extended Backus-Naur form parsers.py 1977 pascal xml regex 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. 244 50 71289 ebnf ebnf 1490 0 20 1 text https://github.com/antlr/grammars-v4/tree/master/ebnf ebnf "(* Source: https://github.com/io7m/jsom0 License: ISC *) digit_without_zero = ""1"" | ""2"" | ""3"" | ""4"" | ""5"" | ""6"" | ""7"" | ""8"" | ""9"" ; digit = ""0"" | digit_without_zero ; positive = digit_without_zero , { digit } ; natural = ""0"" | positive ; real = [ ""-"" ] , digit , [ ""."" , { digit } ] ; " EBNF function application = list( symbol, { expression } ); (* *) true true false https://en.wikipedia.org/wiki/Extended_Backus–Naur_form 0 0 https://hopl.info/showlanguage.prx?exp=755 https://github.com/sanssecours/EBNF.tmbundle EBNF supercollider SuperCollider 1996 33 pl http://supercollider.github.io 0 413 4 23798 6465 true 0 pl 2480 3713 3782 0 sclang scsynth text source.supercollider programming false s/SuperCollider.sc 16 2014 2017 5 7 supercollider.py 1996 freebsd linux smalltalk c lisp puredata scheme haskell scala clojure android ios emacs-editor vim 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. 2003 116 123 472 346978 sc scd sc sc scd true 801 0 36 https://doc.sccode.org/ text http://www.rosettacode.org/wiki/Category:SuperCollider "// Hello World in SuperCollider ""Hello, world!"".postln;" """Hello World"".postln; " WarpPreset { *new {|path| if(path.notNil) { ^Object.readArchive(path); }; ^super.new.init(); } init { } save { Dialog.savePanel({|path| this.writeArchive(path); }); } } SuperCollider // Factorial function f = { |x| if(x == 0) { 1 } { f.(x-1) * x } }; SuperCollider // postln """" true true true true true true false true https://en.wikipedia.org/wiki/SuperCollider 5 0 https://hopl.info/showlanguage.prx?exp=6465 SuperCollider supercollider.github.io SuperCollider https://github.com/supercollider/language-supercollider 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 SuperCollider title|year|author|goodreadsId|rating|ratings|reviews\nProgramming digital music with SuperCollider|2014|Peter Fitton|40386468|4.00|3|0 emacs-editor Emacs 1976 Guy Steele and Dave Moon 13 editor 0 414 0 23797 false 1 gnu-emacs-editor editor false 1976 lisp c org teco vi 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 isbn "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." 2001 605 986 1936 18933234 Free Software Foundation true 64338 0 14 2 na https://melpa.org/ Various https://www.jwz.org/doc/emacs-timeline.html https://reddit.com/r/emacs https://en.wikipedia.org/wiki/Emacs 0 0 commonmark commonmark 2014 John MacFarlane 14 textMarkup https://commonmark.org/ 0 0.31.2 415 0 9 23795 true 2 djot djot https://github.com/commonmark/commonmark-spec textMarkup 2014 2024 2014 152 313 4855 104 false 2014 2025 1872 112 22 4 11874 2014 A strongly defined, highly compatible specification of Markdown A strongly defined, highly compatible specification of Markdown codinghorror.com && github && University of California Berkeley A strongly defined, highly compatible specification of Markdown python markdown javascript lua html dtd make json yaml true 5908 0 25 1 false 0 true United States https://github.com/commonmark/commonmark-spec 0 0 commonmark.org cil CIL 2000 26 pl 0 416 4 23795 true 0 pl false c/Cil.il Common Intermediate Language Microsoft Intermediate Language MSIL 2005 cli-assembly assembly-language csharp x86-isa java-bytecode visual-basic.net 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. 2002 212 168 342 46004 Microsoft il 1080 0 31 http://people.eecs.berkeley.edu/~necula/cil/ text ".assembly Hello {} .assembly extern mscorlib {} .method static void Main() { .entrypoint .maxstack 1 ldstr ""Hello, world!"" call void [mscorlib]System.Console::WriteLine(string) ret }" "// ilasm cil.il .assembly HelloWorld {} .method public static void Main() cil managed { .entrypoint .maxstack 1 ldstr ""Hello World"" call void [mscorlib]System.Console::WriteLine(string) ret } " https://riju.codes/cil ".assembly main {} .class Main { .method static void Main() cil managed { .entrypoint ldstr ""Hello, world!"" call void [mscorlib]System.Console::WriteLine(string) ret } }" .method assembly static void modopt([mscorlib]System.Runtime.CompilerServices.CallConvCdecl) test_pointer_operations(int32 param) cil managed { .vtentry 1 : 1 // Code size 44 (0x2c) .maxstack 2 .locals ([0] int32* ptr, [1] valuetype A* V_1, [2] valuetype A* a, [3] int32 k) // k = 0; IL_0000: ldc.i4.0 IL_0001: stloc.3 // ptr = &k; IL_0002: ldloca.s k // load local's address instruction IL_0004: stloc.0 // *ptr = 1; IL_0005: ldloc.0 IL_0006: ldc.i4.1 IL_0007: stind.i4 // indirection instruction // ptr = ¶m IL_0008: ldarga.s param // load parameter's address instruction IL_000a: stloc.0 // *ptr = 2 IL_000b: ldloc.0 IL_000c: ldc.i4.2 IL_000d: stind.i4 // a = new A; IL_000e: ldloca.s a 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)) IL_0015: pop // ptra = &a; IL_0016: ldloca.s a IL_0018: stloc.1 // ptra->meth(); IL_0019: ldloc.1 IL_001a: dup IL_001b: ldind.i4 // reading the VMT for virtual call IL_001c: ldind.i4 IL_001d: calli unmanaged stdcall void modopt([mscorlib]System.Runtime.CompilerServices.CallConvStdcall)(native int) IL_0022: ret } // end of method 'Global Functions'::test_pointer_operations Cil // call void [mscorlib]System.Console::WriteLine """" true true true false true https://en.wikipedia.org/wiki/Common_Intermediate_Language 4 4 CIL 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 cil developer 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 title|year|author|goodreadsId|rating|ratings|reviews\nCIL Programming: Under the Hood of .Net|2002|Jason Bock|253979|3.50|2|0 scss SCSS 2006 Hampton Lintorn-Catlin 33 stylesheetLanguage http://sass-lang.com/ 41 417 3 23794 true 41 11ty ace asciidots blockml bounce-lang cloc codeql dllup eiffel flownote hedy ibis infusion-framework jasmine jekyll ligo marp mastodon mavo monaco mys netbeans-editor ngs packagist-pm prettier prometheus reach rmarkdown rocksdb sanddance sibilant sqrl statsplorer tao-lang threejs tiledb toontalk ucg verona walt xodio stylesheetLanguage 7569 8503 335325 0 scss css text/x-scss source.css.scss markup false s/SCSS.scss 203 2010 2015 1 32 css.py https://playcode.io/scss/ 2009 https://github.com/sass sass scss scss scss scss 201 0 40 1 scss text https://github.com/antlr/grammars-v4/tree/master/scss scss United States https://en.wikipedia.org/wiki/Sass_(stylesheet_language) "body::before { content: ""Hello World""; } " $blue: #3bbfce; $margin: 16px; .content-navigation { border-color: $blue; color: darken($blue, 9%); } .border { padding: $margin / 2; margin: $margin / 2; border-color: $blue; } SCSS https://riju.codes/scss "body:before { content: ""Hello, world!""; } " https://twitter.com/sasscss SCSS // /* */ """" true true true true true true 2 0 sass-lang.com SCSS https://github.com/MarioRicalde/SCSS.tmbundle SCSS 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 mu Mu 2014 Kartik K. Agaram 22 pl https://github.com/akkartik/mu 0 418 1 16 23789 true 0 https://github.com/akkartik/mu pl 2014 2024 2014 40 46 1355 5 false 2014 2024 9010 15 1013 92 792024 https://github.com/akkartik/mu/issues mu http://pldb.info/blog/kartik.html html cpp bourne-shell markdown vim-script racket bash json c xml css z-shell javascript python less lisp true 1510 0 40 1 false text 9065 United States http://akkartik.name/akkartik-convivial-20200607.pdf # dump stack from bottom to top fn emit-stack-from-bottom _self: (addr grapheme-stack), out: (addr stream byte) { var self/esi: (addr grapheme-stack) <- copy _self var data-ah/edi: (addr handle array code-point-utf8) <- get self, data var _data/eax: (addr array code-point-utf8) <- lookup *data-ah var data/edi: (addr array code-point-utf8) <- copy _data var top-addr/ecx: (addr int) <- get self, top var i/eax: int <- copy 0 { compare i, *top-addr break-if->= var g/edx: (addr code-point-utf8) <- index data, i write-code-point-utf8 out, *g i <- increment loop } } https://github.com/akkartik/mu # true true false 0 0 impala Impala 2012 17 queryLanguage https://impala.apache.org 0 4.4.0 419 0 24 23786 true 0 https://github.com/apache/impala queryLanguage 2016 2024 2011 71 501 1110 27 false 2011 2025 13151 328 6877 233 12407166 2018 java sql pig aws 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. 2013 120 174 62 40147148 Apache Software Foundation cpp java python xml json bourne-shell sql cmake css csv javascript thrift bash markdown protobuf dockerfile c yaml restructuredtext diff ini svg cython make true 3563 0 41 false 4 true text United States https://twitter.com/apacheimpala https://github.com/apache/impala https://en.wikipedia.org/wiki/Apache_Impala 1 0 impala.apache.org year|publisher|title|authors|isbn13\n2013-12-24|Packt Publishing|Learning Cloudera Impala|Avkash Chauhan|9781783281282 xojo Xojo 1996 26 pl http://xojo.com 0 420 3 23785 true 1 realbasic pl 43 68 570 0 text source.xojo programming false r/RealBasic.realbasic 61 2012 2017 6 4 REALbasic 2018 linux ios basic jvm x86-isa xml visual-basic gambas The Xojo programming environment is developed and commercially marketed by Xojo, Inc. of Austin, Texas for software development targeting macOS, Microsoft Windows, Linux, iOS, the Web and Raspberry Pi. Xojo uses a proprietary object-oriented BASIC dialect, also known as Xojo. 2013 75 140 281 39624220 xojo_code xojo_menu xojo_report xojo_script xojo_toolbar xojo_window realbasic false 596 0 29 text http://www.rosettacode.org/wiki/Category:Xojo "Function Run(args() as String) As Integer Print ""Hello World"" Quit End Function " "#tag Toolbar Begin Toolbar MyToolbar Begin ToolButton FirstItem Caption = ""First Item"" HelpTag = """" Style = 0 End Begin ToolButton SecondItem Caption = ""Second Item"" HelpTag = """" Style = 0 End End #tag EndToolbar " https://twitter.com/xojo "Dim names() As String = Array(""Red Sox"", ""Yankees"", ""Orioles"", ""Blue Jays"", ""Rays"") For i As Integer = 0 To names.UBound ListBox1.AddRow(names(i)) Next" RealBasic // Print """" true true true false true https://en.wikipedia.org/wiki/Xojo 0 0 Xojo xojo.com Xojo https://github.com/angryant0007/VBDotNetSyntax Xojo skip skip 2018 19 pl http://skiplang.com/ 0 421 1 23 23783 true 0 https://github.com/skiplang/skip pl 2018 2024 2018 61 66 1969 52 false s/Skip.sk 2018 2022 361 23 6358 85 816729 2017 Facebook sk expect markdown c json html javascript cpp cmake python bourne-shell bash m4 css perl lisp yaml svg vim-script make pascal dockerfile ocaml forth true 2192 0 44 false text 1838 "fun main(): void { print_string(""Hello World"") }" Skip https://github.com/skiplang/skip print_string """" true true 1 0 skiplang.com 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 dylan Dylan 1992 41 pl http://opendylan.org 0 422 4 23779 1682 true 0 pl 67 112 150 0 text dylan text/x-dylan source.dylan programming false d/Dylan.dl 20 2005 2011 5 dylan.py https://play.opendylan.org/ 2004 1992 algol scheme eulisp lasso python ruby common-lisp unix java smalltalk "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." 2002 73 91 299 8741 Apple dylan dyl intr lid dl dylan dyl intr 636 0 75 false https://opendylan.org/documentation/ text 9298 dylan http://www.rosettacode.org/wiki/Category:Dylan United Kingdom "module: hello-world author: Homer copyright: (c) 1994 Homer version: 1.0 // Hello World in DYLAN define method main (#rest args) princ(""Hello world!""); end; main(); " "define method main (#rest args) princ(""Hello World""); end; main(); " Dylan https://riju.codes/dylan "Module: main define function main (name :: , arguments :: ) format-out(""Hello, world!\n""); exit-application(0); end function main; main(application-name(), application-arguments());" define method turn-blue (w :: ) w.color := $blue; end method; Dylan 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 // """" := true true true true true true true false true true https://en.wikipedia.org/wiki/Dylan_(programming_language) 1 1 https://hopl.info/showlanguage.prx?exp=1682 Dylan opendylan.org Dylan https://github.com/textmate/dylan.tmbundle 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 Dylan year|title|doi|citations|influentialCitations|authors|paperId\n1996|Programming in Dylan|10.1007/978-1-4471-0929-7|17|0|I. Craig|2775ffcfb9963960af95dbdb1929d7fc20131f90 rholang Rholang 2016 18 contractLanguage https://rchain-community.github.io/ 0 v0.13.0-alpha3 423 1 20 23778 true 0 https://github.com/rchain/rchain contractLanguage 2017 2024 85 217 691 131 false 2017 2022 14740 136 1593 47 264621 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. 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. https://rchain-community.github.io/ 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. scala cpp markdown c python make bourne-shell xml protobuf yaml bash json cmake nix perl ini dockerfile typescript toml sed true 2480 13 38 false 0 true https://rchain-community.github.io/docs "new helloworld, stdout(`rho:io:stdout`) in { contract helloworld( world ) = { for( @msg <- world ) { stdout!(msg) } } | new world, world2 in { helloworld!(*world) | world!(""Hello World"") | helloworld!(*world2) | world2!(""Hello World again"") } } " https://www.reddit.com/r/CouchDB https://twitter.com/rchain_coop https://github.com/rchain/rchain 0 0 rchain-community.github.io couchdb developer rebol REBOL 1997 Carl Sassenrath 45 pl http://www.rebol.com 0 424 5 23777 2438 true 3 boron particles ren-c pl 1543 1647 30469 0 text source.rebol programming false r/Rebol.reb 7 2014 2015 6 1 Relative Expression-Based Object Language rebol.py 1997 1997 self forth lisp logo json red javascript c algol s-expressions peg "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." 2013 21 77 1 26384 REBOL Technologies r reb reb r r2 r3 rebol reb r r3 reb r reb https://www.rebol.com/docs/reference.html true 326 0 55 1 https://tio.run/#rebol http://www.rebol.com/docs.html text http://www.rosettacode.org/wiki/Category:REBOL REBOL "; Hello World in REBOL print ""Hello World!""" "print ""Hello World"" " "Rebol [] hello: func [] [ print ""hello, world!"" ] hello " REBOL https://riju.codes/rebol "REBOL [Title: ""Main""] print ""Hello, world!"" " "Digit: charset [#""0"" - #""9""] Value: [some Digit | ""("" Expr "")""] Product: [Value any [[""*""| ""/""] Value]] Sum: [Product any [[""+""| ""-""] Product]] Expr: Sum parse/all ""12+13"" Expr" Rebol ; print probe """ { }" true false true true true true true true true true false true https://en.wikipedia.org/wiki/REBOL 3 0 https://hopl.info/showlanguage.prx?exp=2438 REBOL rebol.com Rebol https://github.com/Oldes/Sublime-REBOL year|publisher|title|authors|isbn13\n|Wiley Technology Publishing|Rebol Programming|Olivier Auverlot|9780470846759 Rebol rebol developer 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 sugarss SugarSS 2016 Andrey Sitnik 18 textMarkup 2 4.0.1 425 1 7 23776 true 2 cloc sugarss https://github.com/postcss/sugarss textMarkup 0 0 CSS text source.css.postcss.sugarss markup 2016 2024 2016 24 39 708 1 false 231 2013 2017 1 10 2016 2024 225 20 53 1 6595 sss javascript json css sugarss yaml markdown svg true 1046 0 27 1 true 4 true sss text "@define-mixin size $size width: $size $big: 100px // Main block .block &_logo background: inline(""./logo.png"") @mixin size $big" https://github.com/postcss/sugarss // true true false 0 0 https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS SugarSS minidsdb Mindsdb 2018 14 application https://mindsdb.com/ 0 v2.62.4 426 0 14 23767 false 0 https://github.com/mindsdb/mindsdb/ application 2018 2024 397 4816 25870 211 false 2018 2025 19974 964 3400 253 308409 MindsDB ML-SQL Server enables machine learning workflows for the most powerful databases and data warehouses using SQL. MindsDB ML-SQL Server enables machine learning workflows for the most powerful databases and data warehouses using SQL. https://mindsdb.com/community MindsDB ML-SQL Server enables machine learning workflows for the most powerful databases and data warehouses using SQL. python markdown svg yaml csv json sql dockerfile ini hcl make html mako toml true 41284 0 30 python sql false 2 true https://docs.mindsdb.com/ https://github.com/mindsdb/mindsdb/ 0 0 mindsdb.com docopt docopt 2012 Vladimir Keleshev 15 pl http://docopt.org/ 0 0.6.2 427 0 4 23767 true 0 https://github.com/docopt/docopt pl 2012 2024 2012 162 561 7910 266 false 2012 2018 462 37 31 1 3476 2012 Command-line interface description language Command-line interface description language https://github.com/docopt Command-line interface description language python restructuredtext ini yaml true 9632 0 19 1 false 0 true Various https://github.com/docopt/docopt 0 0 docopt.org walt walt 2017 16 pl https://ballercat.github.io/walt/ 0 1.1.0 428 1 7 23767 true 0 https://github.com/ballercat/walt pl 2017 2024 2017 114 155 4641 27 false 2017 2023 506 30 356 20 158379 Walt is a JavaScript-like syntax for WebAssembly text format Walt is a JavaScript-like syntax for WebAssembly text format Walt is a JavaScript-like syntax for WebAssembly text format javascript markdown json html scss bourne-shell yaml wasm true 5138 0 24 false 1 true text 8707 export function fibonacci(n: i32): i32 { if (n <= 0) return 0; if (n == 1) return 1; return fibonacci(n - 1) + fibonacci(n - 2); } https://github.com/ballercat/walt 0 0 alpaca Alpaca 2016 Jeremy Pierre 17 pl http://alpaca-lang.org 0 v0.2.8 429 1 5 23766 true 1 gleam https://github.com/alpaca-lang/alpaca pl 2016 2024 62 46 1439 34 false ML-flavoured Erlang 2016 2019 884 23 94 2 18276 https://github.com/alpaca-lang erlang markdown yaml make bourne-shell beam-bytecode true 1602 0 23 1 false 0 true https://github.com/antlr/grammars-v4/tree/master/alpaca Canada https://github.com/j14159/abstract-alpaca module simple_example -- a basic top-level function: let add2 x = x + 2 let something_with_let_bindings x = -- a function: let adder a b = a + b in -- a variable (immutable): let x_plus_2 = adder x 2 in add2 x -- a polymorphic ADT: type messages 'x = 'x | Fetch pid 'x {- A function that can be spawned to receive `messages int` messages, that increments its state by received integers and can be queried for its state. -} let will_be_a_process x = receive with i -> will_be_a_process (x + i) | Fetch sender -> let sent = send x sender in will_be_a_process x let start_a_process init = spawn will_be_a_process init https://github.com/alpaca-lang/alpaca 0 0 bqn BQN 2020 Marshall Lochbaum 19 pl arrayLang https://mlochbaum.github.io/BQN/ 1 430 1 9 23766 true 1 bqn https://github.com/mlochbaum/BQN pl 2020 2024 32 57 867 3 false Big Questions Notation 2020 2025 2930 41 549 12 172379 https://mlochbaum.github.io/BQN/ An APL-like programming language. Self-hosted! An APL-like programming language. Self-hosted! https://github.com/mlochbaum/BQN/issues An APL-like programming language. Self-hosted! bqn html markdown vim-script javascript xml autohotkey css svg true 1081 0 29 apl 1 true https://mlochbaum.github.io/BQN/doc/index.html http://www.rosettacode.org/wiki/Category:BQN United States "#! /usr/bin/env bqn # Case conversion utilities case ← { diff ← -´ ""Aa"" Lower ⇐ -⟜diff Upper ⇐ Lower⁼ } hw ← <˘ 2‿∘ ⥊ ""helloworld"" hw case.Upper⌾(⊑¨)↩ •Out hw ↩ ∾ ⥊⍉ [hw, "", ""‿""!""] # Hello, World! # Split at spaces and repeated characters Split ← { !1==𝕩 ⋄ (!2=•Type)¨𝕩 Proc ← { · 𝕊 ' ': spl⇐1 ; # Space: break and delete it prev Fn cur: ⟨spl,str⟩⇐ spl←0 ⋄ str←⟨cur⟩ # Include and don't break... { prev=cur ? spl+↩1 ; @ } # except at equal characters } GV‿GS ← {𝕏¨}¨ ⟨ {⟨s⇐str⟩:s;""""} {𝕩.spl} ⟩ r ← Proc{»𝔽¨⊢} 𝕩 (∾¨ GV ⊔˜ ·+`GS) r } •Show Split hw # ⟨ ""Hel"" ""lo,"" ""World!"" ⟩" https://discord.gg/SDTW36EhWF https://github.com/mlochbaum/BQN 0 0 dynamo-visual-language Dynamo 2011 Ian Keough 16 visual https://dynamobim.org/ 0 431 0 14 23760 true 0 https://github.com/DynamoDS/Dynamo visual 2012 2024 2011 201 624 1678 383 false 2011 2025 35856 254 23178 2096 728463 https://dynamobim.org/roadmap/ 2013 https://github.com/DynamoDS markdown csharp xml xaml json html svg yaml csv powershell python hlsl xslt standard-ml true 4806 0 30 1 false https://dynamopackages.com/ United States https://twitter.com/dynamobim https://github.com/DynamoDS/Dynamo 0 0 dynamobim.org flow9 Flow9 2010 Dmitry Solomennikov 28 pl https://flow9.org/ 0 432 1 46 23753 true 0 https://github.com/area9innovation/flow9 pl 2018 2024 2018 55 34 563 52 false 2018 2025 13258 229 7523 1827 2405518 2017 The flow programming language, a safe, functional strongly-typed programming language The flow programming language, a safe, functional strongly-typed programming language https://github.com/area9innovation The flow programming language, a safe, functional strongly-typed programming language c cpp haxe nim javascript bourne-shell xml java markdown objective-c html json python csharp typescript make css bash objective-cpp d glsl yaml wasm qt m4 lisp clojure ruby assembly-language dockerfile cmake cson smalltalk php ocaml awk ini gradle vim-script tex sas xaml svg swift perl diff true 896 0 90 1 false flow9 Unknown https://news.ycombinator.com/item?id=19769410 "import runtime; main() { println(""Hello world""); }" import require export forbid native if else cast unsafe switch default https://github.com/area9innovation/flow9 // /* */ """" import true true true true true true true 0 0 flow9.org ooc ooc 2009 Amos Wenger 31 pl https://ooc-lang.org/ 0 v0.9.10 433 1 12 23753 true 0 https://github.com/ooc-lang/rock pl 69 126 227 0 text source.ooc programming 2009 2024 2009 34 40 401 76 false o/Ooc.ooc 20 2009 2014 3 ooc.py 2009 2016 4013 59 767 18 219954 2009 https://github.com/ooc-lang ooc ooc ooc c bourne-shell make markdown m4 assembly-language html cpp cmake bash yaml restructuredtext true 782 0 45 1 false 0 true text http://www.rosettacode.org/wiki/Category:OOC United States and Germany and Switzerland "main: func { ""Hello World"" println() } " Ooc Ooc https://github.com/ooc-lang/rock println """" true true true true true true true true 0 0 ooc-lang.org ooc https://github.com/nilium/ooc.tmbundle ooc x10 X10 2004 Kemal Ebcioğlu and Saravanan Arumugam and Vijay Saraswat and Vivek Sarkar 44 pl http://x10-lang.org 0 434 2 23753 8172 true 1 chapel pl 18 19 45 0 xten text source.x10 programming false x/X10.x10 6 2015 2015 18 1 x10.py 2008 2004 linux java chapel fortress unified-parallel-c X10 is a programming language being developed by IBM at the Thomas J. Watson Research Center as part of the Productive, Easy-to-use, Reliable Computing System (PERCS) project funded by DARPA's High Productivity Computing Systems (HPCS) program. Its primary authors are Kemal Ebcioğlu, Vijay Saraswat, Saravanan Arumugam, and Vivek Sarkar. X10 is designed specifically for parallel computing using the partitioned global address space (PGAS) model. A computation is divided among a set of places, each of which holds some data and hosts one or more activities that operate on those data. It has a constrained type system for object-oriented programming, a form of dependent types. Other features include user-defined primitive struct types; globally distributed arrays, and structured and unstructured parallelism. X10 uses the concept of parent and child relationships for activities to prevent the lock stalemate that can occur when two or more processes wait for each other to finish before they can complete. An activity may spawn one or more child activities, which may themselves have children. Children cannot wait for a parent to finish, but a parent can wait for a child using the finish command. 2005 31 72 157 1932246 IBM x10 x10 x10 x10 x10 true 376 0 98 jvm 4 https://x10.sourceforge.net/documentation/languagespec/x10-latest.pdf text http://www.rosettacode.org/wiki/Category:X10 United States "/* * This file is part of the X10 project (http://x10-lang.org). * * This file is licensed to You under the Eclipse Public License (EPL); * You may not use this file except in compliance with the License. * You may obtain a copy of the License at * http://www.opensource.org/licenses/eclipse-1.0.php * * (C) Copyright IBM Corporation 2006-2016. */ import x10.io.Console; public class HelloWorld { public static def main(Rail[String]) { Console.OUT.println(""Hello World""); } } " "/* * This file is part of the X10 project (http://x10-lang.org). * * This file is licensed to You under the Eclipse Public License (EPL); * You may not use this file except in compliance with the License. * You may obtain a copy of the License at * http://www.opensource.org/licenses/eclipse-1.0.php * * (C) Copyright IBM Corporation 2006-2014. */ import x10.io.Console; /** * The classic hello world program, shows how to output to the console. */ class HelloWorld { public static def main(Rail[String]) { Console.OUT.println(""Hello World!"" ); } } " X10 X10 as assert async at athome ateach atomic break case catch class clocked continue def default do else final finally finish for goto haszero here if import in instanceof interface isref new offer operator package return struct switch throw try type val var when while /* */ Console.OUT.println """" import true true true true true true true true true true false true true true https://en.wikipedia.org/wiki/X10_(programming_language) 1 39 https://hopl.info/showlanguage.prx?exp=8172 X10 x10-lang.org X10 https://github.com/x10-lang/x10-highlighting year|publisher|title|authors|isbn13\n2010||X10 (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130368838 X10 year|title|doi|citations|influentialCitations|authors|paperId\n2011|Habanero-Java: the new adventures of old X10|10.1145/2093157.2093165|245|26|Vincent Cavé and Jisheng Zhao and J. Shirako and Vivek Sarkar|8368d2fc947cf6ac46a1d251d1895f2f87c7d498\n2007|May-happen-in-parallel analysis of X10 programs|10.1145/1229428.1229471|96|8|Shivali Agarwal and R. Barik and Vivek Sarkar and R. Shyamasundar|7b83b2cc9b4d5c0ce578b96c2508b0aa926fefda\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\n2016|X10 and APGAS at Petascale|10.1145/2894746|38|8|O. Tardieu and Benjamin Herta and D. Cunningham and D. Grove and P. Kambadur and V. Saraswat and Avraham Shinnar and Mikio Takeuchi and M. Vaziri|200de04ff121efa826e2ac653a5f7f60edf9e98c\n2011|Resource-aware programming and simulation of MPSoC architectures through extension of X10|10.1145/1988932.1988941|38|0|Frank Hannig and Sascha Roloff and G. Snelting and J. Teich and Andreas Zwinkau|c228daa13e097978c58ac08f08a15c5923f50999\n2011|A performance model for X10 applications: what's going on under the hood?|10.1145/2212736.2212737|32|5|D. Grove and O. Tardieu and D. Cunningham and Benjamin Herta and Igor Peshansky and V. Saraswat|7a7e3f0465f888be4d4f373800a1c8ec648fae8e\n2013|Towards highly scalable pregel-based graph processing platform with x10|10.1145/2487788.2487984|32|4|Nguyen Thien Bao and T. Suzumura|be79b13765c272635225c517e8fe37b808d77ff7\n2011|Communication Optimizations for Distributed-Memory X10 Programs|10.1109/IPDPS.2011.105|30|3|R. Barik and Jisheng Zhao and D. Grove and Igor Peshansky and Zoran Budimlic and Vivek Sarkar|11e2f90c671800107219aca7d69e2e80e2161e16\n2009|Towards concurrency refactoring for x10|10.1145/1504176.1504226|22|0|Shane Markstrum and Robert M. Fuhrer and T. Millstein|37c91ce6523af0a1c7d3664b941de14a6f030f49\n2014|X10 and APGAS at Petascale|10.1145/2555243.2555245|16|2|O. Tardieu and Benjamin Herta and D. Cunningham and D. Grove and P. Kambadur and V. Saraswat and Avraham Shinnar and Mikio Takeuchi and M. Vaziri|261ebca508a91d71bdedd30872af434b5f67fa6d\n2011|Using the Cowichan problems to investigate the programmability of X10 programming system|10.1145/2212736.2212740|16|0|Jeeva Paudel and J. N. Amaral|eeaef2919b123569021297ce09d793c56a5320d8\n2012|Object Initialization in X10|10.1007/978-3-642-31057-7_10|15|2|Yoav Zibin and D. Cunningham and Igor Peshansky and V. Saraswat|072a35321e8f95a3cd44a065bb90168062a927c3\n2011|Compiling X10 to Java|10.1145/2212736.2212739|14|1|Mikio Takeuchi and Yukifumi Makino and Kiyokuni Kawachiya and H. Horii and T. Suzumura and Toshio Suganuma and Tamiya Onodera|0fdb97e262a15c21b997a654ca3b15455de2517e\n2012|StreamX10: a stream programming framework on X10|10.1145/2246056.2246057|13|0|Haitao Wei and Hongshi Tan and Xiaoxian Liu and Junqing Yu|549d0c4b493eb1d3f0dfe638410dbaa617980470\n2017|A Malleable and Fault-Tolerant Task Pool Framework for X10|10.1109/CLUSTER.2017.27|12|0|Marco Bungart and Claudia Fohry|35a2d77c89762b824faf3bde9b1211faf7c200dc\n2019|Failure Recovery in Resilient X10|10.1145/3332372|12|1|D. Grove and S. Hamouda and Benjamin Herta and A. Iyengar and Kiyokuni Kawachiya and Josh Milthorpe and V. Saraswat and Avraham Shinnar and Mikio Takeuchi and O. Tardieu|61e9054ef9e0cb459350040aae5647a58806f406\n2014|Supporting Array Programming in X10|10.1145/2627373.2627380|12|0|D. Grove and Josh Milthorpe and O. Tardieu|997112abeb5b671ef78a903b459e82414906c8a7\n2011|Evaluating the Performance and Scalability of MapReduce Applications on X10|10.1007/978-3-642-24151-2_4|8|0|Chao Zhang and Chenning Xie and Zhiwei Xiao and Haibo Chen|19732da7af58cafd4246ec2cb39fba0a9fc528d7\n2012|Distributed garbage collection for managed X10|10.1145/2246056.2246061|7|0|Kiyokuni Kawachiya and Mikio Takeuchi and Salikh Zakirov and Tamiya Onodera|e227480bd8c5d4b7f36ab8614398afec9f12dd02\n2014|PGAS‐FMM: Implementing a distributed fast multipole method using the X10 programming language|10.1002/cpe.3039|7|0|Josh Milthorpe and A. Rendell and T. Huber|ee8f4acebb70619d1c1bad0bff61d12b1c96ea0f\n2017|High-Performance Graph Data Management and Mining in Cloud Environments with X10|10.1007/978-3-319-54645-2_7|6|0|Miyuru Dayarathna and T. Suzumura|8f8bb61eec1488be8ed042c9f174df8d332bce4e\n2014|Massively Parallel Reasoning under the Well-Founded Semantics Using X10|10.1109/ICTAI.2014.33|5|1|Ilias Tachmazidis and Long Cheng and S. Kotoulas and G. Antoniou and T. Ward|a7012b1d97d8585d5740aaa856842983cbc988e2\n2013|Achieving load-balancing in power system parallel contingency analysis using X10 programming language|10.1145/2481268.2481275|5|0|S. Khaitan and J. McCalley|22affef8e888b99bf726d43f25cb09681a84913f\n2012|Towards highly scalable X10 based spectral clustering|10.1109/HiPC.2012.6507522|4|1|Hidefumi Ogata and Miyuru Dayarathna and T. Suzumura|cbd7cdf964fe9e27e03783afef0359529ec00f05\n2013|Java interoperability in managed X10|10.1145/2481268.2481278|4|0|Mikio Takeuchi and D. Cunningham and D. Grove and V. Saraswat|e7cf1e2a1c701c786bc18b6b44942e9dd00a0cc2\n2014|Improving the Performance of X10 Programs by Clock Removal|10.1007/978-3-642-54807-9_7|4|1|P. Feautrier and E. Violard and A. Ketterlin|7fd7896a880aab358d795f331af77a02f4e2dda3\n2015|Optimization of x10 programs with ROSE compiler infrastructure|10.1145/2771774.2771777|4|2|Michihiro Horie and Mikio Takeuchi and Kiyokuni Kawachiya and D. Grove|8c5711f6827e384f2eb21662acfca9bd6fb4582c\n2016|A memory model for X10|10.1145/2931028.2931031|4|1|Andreas Zwinkau|0e685e55e0e8fc8610b0e56ac4694af7e632a45d\n2014|Optimizing shared data accesses in distributed-memory X10 systems|10.1109/HiPC.2014.7116889|3|0|Jeeva Paudel and O. Tardieu and J. N. Amaral|3081628da81f625f8abdcd20b81e4454189e2ba3\n2018|Optimizing remote data transfers in X10|10.1145/3243176.3243209|3|0|A. Thangamani and V. K. Nandivada|ff7e5746eabf4a8570c992cea7eff46ca807dec3\n2013|Towards Parallel Constraint-Based Local Search with the X10 Language|10.1007/978-3-319-08909-6_11|3|0|Danny Múnera and Daniel Diaz and Salvador Abreu|ce0f8fe37680885ef18741a5beae16571533a324\n2010|Programming Experiences Using the X10 Language|10.1109/MCSE.2010.138|3|0|M. Tajchman|25b6ba3575dd762e7cbca1eed7c5ae7e6c816973\n2014|Resolutions of the Coulomb operator: VIII. Parallel implementation using the modern programming language X10|10.1002/jcc.23720|3|0|T. Limpanuparb and Josh Milthorpe and A. Rendell|d61f2b302642d05ae8ca07a85c395935ca7712c7\n2009|A comparative study and empirical evaluation of global view High performance Linpack program in X10|10.1145/1809961.1809970|2|0|Ganesh Bikshandi and G. Almási and Sreedhar B. Kodali and Igor Peshansky and V. Saraswat and S. Sur|36258502767e958eaf6d5a13dba381703e57a5cf\n2011|X10 implementation of parallel option pricing with BSDE method|10.1145/2212736.2212741|2|0|Hui Liu and Ying Peng and Daizhen Wei and Bin Dai|df6a941760a40328637a29224002f43dc71750ce\n2012|Characterization of Smith-Waterman sequence database search in X10|10.1145/2246056.2246058|1|0|Y. Ji and Li Liu and Guangwen Yang|5f6d4070aee2cb36da7fa13e1e8962ae3a606a09\n2015|Replicating Data for Better Performances in X10|10.1007/978-3-319-27810-0_12|1|0|Marina Andric and R. Nicola and Alberto Lluch-Lafuente|ba74df6fd230291da5c3df42078819c6c187f133\n2016|Control structure overloading in X10|10.1145/2931028.2931032|1|0|Louis Mandel and Josh Milthorpe and O. Tardieu|f5a1217bf2a904bced4b8d1c904f977a339974ff\n2015|DPX10: An Efficient X10 Framework for Dynamic Programming Applications|10.1109/ICPP.2015.96|1|0|Chen Wang and Ce Yu and Ji-zhou Sun and X. Meng|f96f73ddb3243bdbc4865d393bc09389af56ba19 asciidots AsciiDots 2017 Aaron Janse 23 esolang http://ajanse.me/asciidots/ 0 1.3.4 435 2 11 23752 true 0 https://github.com/aaronduino/asciidots esolang 2017 2024 2017 24 33 1110 12 false a/AsciiDots.ascii 2017 2024 459 19 128 5 8784 http://ajanse.me/asciidots/demo ascii markdown python html javascript nix yaml css scss dockerfile bourne-shell restructuredtext true 1230 0 35 1 false 1 true true https://tio.run/#asciidots https://esolangs.org/wiki/AsciiDots text http://www.rosettacode.org/wiki/Category:AsciiDots /-& `` This is where the program ends! | \-\ /-\ | | | /-/ | \-\ \---/ | | \-. `` Here's where the program starts ".-$""Hello World"" " AsciiDots https://github.com/aaronduino/asciidots """" true 0 0 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 raku Raku 2015 Larry Wall 41 pl https://www.raku.org/ 8 https://raku.org/downloads/ 6 436 3 23752 true 9 ace alma-007 cloc muldis pygments rakudo rakudo star testml pl 1750 2002 2521 perl6 or perl-6 perl6 raku rakudo perl perl text/x-perl source.raku programming false r/Raku.raku 510 2015 2017 22 6 Perl 6 1999 2000 "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." -1 195 1146638 https://www.raku.org/community 6pl 6pm nqp p6 p6l p6m pl pl6 pm pm6 raku rakumod t raku 216 0 https://exercism.org/tracks/raku 48 1 6 true pm6 raku rakumod https://tio.run/#perl6 United States "grammar Parser { rule TOP { I } token love { '♥' | love } token lang { < Raku Perl Rust Go Python Ruby > } } say Parser.parse: 'I ♥ Raku'; # OUTPUT: ｢I ♥ Raku｣ love => ｢♥｣ lang => ｢Raku｣ say Parser.parse: 'I love Perl'; # OUTPUT: ｢I love Perl｣ love => ｢love｣ lang => ｢Perl｣ start { sleep 1.5; print ""hi"" } await Supply.from-list().throttle: 2, { sleep 0.5; .print } # OUTPUT: ABCDhiEF # No floating point noise: say 0.1 + 0.2 == 0.3; # OUTPUT: True say (1/13 + 3/7 + 3/8).perl; # OUTPUT: <641/728> # Infinite list of primes: my @primes = ^∞ .grep: *.is-prime; say ""1001ˢᵗ prime is @primes[1000]""; # Lazily read words from a file .say for '50TB.file.txt'.IO.words;" "say ""Hello World""; " # used in t/spec/S11-modules/nested.t BEGIN { @*INC.push('t/spec/packages') }; module A::A { use A::B; } # vim: ft=perl6 Raku # say """" true true true true true true true true false true https://en.wikipedia.org/wiki/Raku_(programming_language) 7 0 raku.org Perl 6 https://github.com/perl6/atom-language-perl6 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 Raku 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 stencil Stencil 2018 Kyle Fuller 17 template https://stencil.fuller.li/en/latest/ 0 0.15.1 437 1 10 23749 true 0 https://github.com/stencilproject/Stencil template 2014 2024 2014 34 223 2336 33 false 2014 2024 559 56 98 1 12172 Stencil is a simple and powerful template language for Swift. It provides a syntax similar to Django and Mustache. Stencil is a simple and powerful template language for Swift. It provides a syntax similar to Django and Mustache. https://github.com/stencilproject Stencil is a simple and powerful template language for Swift. It provides a syntax similar to Django and Mustache. swift html ruby yaml restructuredtext markdown make python json bourne-shell true 3063 0 27 1 false 0 true https://tio.run/#stencil text United Kingdom There are {{ articles.count }} articles.
{% for article in articles %}
{{ article.title }} by {{ article.author }}
{% endfor %}
https://github.com/stencilproject/Stencil 0 0 meson Meson 2013 18 pl 18 438 1 23748 true 18 arrow-format cloc fetlang janet matplotlib mongodb oopsilon openrc-runscript pandas postgresql praat-script pygments racket ricscript scikit-learn scipy swallow vlc pl 765 1153 meson.build meson_options.txt 880 0 text source.meson programming false 14 2017 2018 2 1 meson.py 2013 python unix c d java rust vala visual-studio-editor cmake ninja 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. 2016 63 16 92 50160571 https://github.com/mesonbuild meson.build meson_options.txt true 535 0 19 meson.build text Various option('with-something', type: 'boolean', value: true, ) Meson true true true https://en.wikipedia.org/wiki/Meson_(software) 0 0 Meson https://github.com/TingPing/language-meson Meson modula-3 Modula-3 1986 Luca Cardelli and James Donahue and Lucille Glassman and Mick Jordan and Bill Kalsow and Greg Nelson 36 pl http://www.modula3.org 0 http://www.opencm3.net/releng/relnotes-5.8.6.html http://www.opencm3.net/download.html 439 4 23745 1411 true 0 pl 18 19 137 text source.modula-3 programming false m/Modula 3.m3 11 2018 2018 5 2 m3 2007 1980 modula-2 pascal algol oberon java python caml csharp nim arm mesa object-pascal euclid c delphi scala obliq 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 DEC (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. 2003 84 137 336 241545 DEC && elego Software Solutions GmbH i3 ig m3 mg true 641 0 106 6 https://modula3.elegosoft.com/cm3/doc/tutorial/m3/m3_toc.html text m3 http://www.rosettacode.org/wiki/Category:Modula-3 United States and Germany https://www.cs.purdue.edu/homes/hosking/m3/reference/syntax.html "(* Hello World in Modula-3 *) MODULE Hello EXPORTS Main; IMPORT IO; BEGIN IO.Put(""Hello World!\n""); END Hello." "MODULE HelloWorld; IMPORT Io; BEGIN IO.Put (""Hello World\n"") END HelloWorld." "(* Copyright (C) 1989, DEC *) (* All rights reserved. *) (* See the file COPYRIGHT for a full description. *) (* Last modified on Fri Jun 18 16:18:48 PDT 1993 by wobber *) (* modified on Tue Jun 15 10:07:07 1993 by gnelson *) (* modified on Fri May 21 09:50:56 PDT 1993 by swart *) (* modified on Mon Apr 26 17:22:23 PDT 1993 by mcjones *) (* modified on Wed Nov 6 10:45:09 PST 1991 by kalsow *) (* modified on Fri Sep 28 23:12:34 1990 by muller *) (* The RdClass interface is analogous to the WrClass interface. It reveals that every reader contains a buffer of characters together with methods for managing the buffer. New reader classes are created by importing RdClass (to gain access to the buffer and the methods) and then defining a subclass of Rd.T whose methods provide the new class's behavior. The opaque type Private hides irrelevant details of the class-independent code. *) INTERFACE RdClass; IMPORT Rd; FROM Thread IMPORT Alerted; FROM Rd IMPORT Failure; TYPE Private <: ROOT; SeekResult = {Ready, WouldBlock, Eof}; REVEAL Rd.T = Private BRANDED OBJECT buff : REF ARRAY OF CHAR := NIL; Ungetbuff : REF ARRAY OF CHAR := NIL; Waitingbuff : REF ARRAY OF CHAR := NIL; st : CARDINAL; (* index into buff *) Ungetst : CARDINAL; (* index into Ungetbuff *) Waitingst : CARDINAL; (* index into WaitingBuff *) cur : CARDINAL := 0; (* index into src(rd) *) lo, hi : CARDINAL := 0; (* indexes into src(rd) *) Ungetlo, Ungethi : CARDINAL := 0; (* indexes into src(rd) *) Waitinglo, Waitinghi : CARDINAL := 0; (* indexes into src(rd) *) closed: BOOLEAN := TRUE; (* init method of the subtype should set this to FALSE *) seekable, intermittent: BOOLEAN; METHODS seek (n: CARDINAL; dontBlock: BOOLEAN): SeekResult RAISES {Failure, Alerted}; (* ^rd is locked and not closed. *) getSub (VAR a: ARRAY OF CHAR): CARDINAL RAISES {Failure, Alerted} := GetSubDefault; (* ^rd is locked and not closed. *) length (): INTEGER RAISES {Failure, Alerted} := LengthDefault; (* ^rd is locked and not closed. *) close () RAISES {Failure, Alerted} := CloseDefault; END; (* Let rd be a reader, abstractly given by len(rd), src(rd), cur(rd), avail(rd), closed(rd), seekable(rd), and intermittent(rd). The data fields cur, closed, seekable, and intermittent in the object represent the corresponding abstract attributes of rd. The buff, st, lo, and hi fields represent a buffer that contains part of src(rd), the rest of which is represented in some class-specific way. More precisely, we say that the state of the representation is valid if conditions V1 through V4 hold: V1. the characters of buff in the range [st .. st+(hi-lo)] accurately reflect src. That is, for all i in [rd.lo .. rd.hi-1], rd.buff[rd.st + i - rd.lo] = src(rd)[i] V2. the cur field is in or just past the end of the occupied part of the buffer, that is: rd.lo <= rd.cur <= rd.hi V3. the reader does not claim to be both intermittent and seekable: NOT (rd.intermittent AND rd.seekable) It is possible that buff = NIL in a valid state, since the range of i's in V1 may be empty; for example, in case lo = hi. V4. if closed(rd) then rd.buff = NIL AND rd.lo = rd.hi If rd is valid and cur(rd) is less than rd.hi, we say the reader is ready. More precisely, rd is ready if: NOT rd.closed AND rd.buff # NIL AND rd.lo <= rd.cur < rd.hi If the state is ready, then Rd.GetChar can be implemented by fetching from the buffer. Together V1, V2, and V4 imply that if rd.cur # rd.hi then rd.buff # NIL and NOT rd.closed. Therefore a valid reader is ready if ""rd.cur # rd.hi"". The class-independent code modifies rd.cur, but no other variables revealed in this interface (except that ""Rd.Close"" modifies ""rd.lo"" and ""rd.cur"" and sets ""rd.buff"" to NIL in order to maintain invariant V4). The class-independent code locks the reader before calling any methods. Here are the specifications for the methods: The basic purpose of the seek method is to make the reader ready. To seek to a position n, the class-independent code checks whether the reader would be ready with rd.cur = n and if so, simply sets rd.cur to n. If not, it calls rd.seek supplying the position n as argument. As in the case of writers, the seek method can be called even for an unseekable reader in the special case of advancing to the next buffer. The fields with names beginning with ""Unget"" describe a buffer of characters retained in case they need to be reused by UngetChar. The fields with names beginning with ""Waiting"" are a buffer once supplied by class-dependent code but temporarily suspended while characters originally saved in the unget and then ungotten are being returned. If NIL#Ungetbuff=buff, we are accessing previously ungotten characters from Ungetbuff^, and Waitingbuff is the buffer most recently provided by seek. Otherwise, buff is the buffer most recently provided by seek. Either way, the fast path in class-independent code for getting characters works the same, using buff, st, lo, and hi, as in the earlier implementation, and ignoring the other buffer fields. Similarly, (class-dependent) seek method bodies use only these same fields. Only UngetChar and class-independent code surrounding seek method calls need be aware of the additional two buffer pointers and their subscripts. There is a wrinkle to support the implementation of CharsReady. If rd is ready, the class-independent code can handle the call to CharsReady(rd) without calling any methods (since there is at least one character ready in the buffer), but if rd.cur = rd.hi, then the class independent code needs to find out from the class implementation whether any characters are ready in the next buffer. Using the seek method to advance to the next buffer won't do, since this could block, and CharsReady isn't supposed to block. Therefore, the seek method takes a boolean argument saying whether blocking is allowed. If blocking is forbidden and the next buffer isn't ready, the method returns the special value WouldBlock; this allows the class-independent code to return zero from CharsReady. The ""dontBlock"" boolean should be ""TRUE"" only if the seek method is being used to advance to the next buffer. More precisely, given a valid state where (n # rd.hi) => rd.seekable AND (dontBlock => n = rd.hi) the call res := rd.seek(n, dontBlock) establishes a valid state. Furthermore, if res = Ready then rd is ready and rd.cur = n; while if res = Eof, then rd.cur = len(rd); and finally if res = WouldBlock then dontBlock was TRUE and avail(rd) = cur(rd). The getSub method is used to implement Rd.GetSub and is called with the reader lock held and the reader not closed. Efficient implementations override this method to avoid unnecessary copying by reading directly from the reader source, bypassing the reader buffer. The default implementation is correct for any class, but always copies through the reader buffer. The length method returns the length of a non-intermittent reader. That is: Given a valid state in which rd.intermittent is FALSE, the call rd.length() returns len(rd) without changing the state of rd. An intermittent reader may return the length if it is known, or -1. The close method releases all resources associated with rd. The exact meaning of this is class-specific. ""Rd.Close"" sets the ""buff"" field to ""NIL"", so the method need not do this. When the method is called the state will be valid; validity is not required when the method returns (since after it returns, the class-independent code will set the closed bit in the reader, which makes the rest of the state irrelevant). The remainder of the interface is similar to the corresponding part of the WrClass interface: *) PROCEDURE Init(rd: Rd.T); (* Class-independent initialize rd, including private fields revealed herein. *) PROCEDURE Lock(rd: Rd.T) RAISES {}; (* The reader rd must be unlocked; lock it and make its state valid. *) PROCEDURE Unlock(rd: Rd.T) RAISES {}; (* The reader rd must be locked and valid; unlock it and restore the private invariant of the reader implementation. *) PROCEDURE GetSubDefault(rd: Rd.T; VAR (*OUT*) str: ARRAY OF CHAR): CARDINAL RAISES {Failure, Alerted}; (* rd is locked and not closed. *) (* Implement ""getSub"" by copying from the buffer, calling the ""seek"" method as necessary. Clients can override this in order to achieve greater efficiency; for example, by copying directly from the source of the reader into ""str"". *) PROCEDURE LengthDefault(rd: Rd.T): INTEGER RAISES {Failure, Alerted}; (* The procedure LengthDefault causes a checked runtime error; this represents an error in the (non-intermittent) class implementation. *) PROCEDURE CloseDefault(rd: Rd.T) RAISES {Failure, Alerted}; (* The procedure CloseDefault is a no-op. *) END RdClass. " MODULE Person; REVEAL T = Public BRANDED OBJECT name: TEXT; (* These two variables *) age: INTEGER; (* are private. *) OVERRIDES getAge := Age; init := Init; END; PROCEDURE Age(self: T): INTEGER = BEGIN RETURN self.age; END Age; PROCEDURE Init(self: T; name: TEXT; age: INTEGER): T = BEGIN self.name := name; self.age := age; RETURN self; END Init; BEGIN END Person. Modula 3 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 (* *) TRUE FALSE true false true false true false https://en.wikipedia.org/wiki/Modula-3 0 0 https://hopl.info/showlanguage.prx?exp=1411 Modula-3 modula3.org Modula-3 https://github.com/newgrammars/m3 Modula-3 roy roy 2011 Brian McKenna 24 pl http://roy.brianmckenna.org/ 0 0.2.2 440 1 10 23740 true 0 https://github.com/puffnfresh/roy pl 2011 2024 2011 47 74 834 64 false r/Roy.roy 2011 2013 569 39 128 1 11928 https://github.com/puffnfresh/roy/issues roy javascript css html restructuredtext markdown make json python yaml bourne-shell true 1097 0 36 1 false 0 true text 5386 https://repl.it/languages/roy Australia "console.log ""Hello World"" " https://twitter.com/roylangjs Roy https://github.com/puffnfresh/roy console.log """" true true 1 0 roy.brianmckenna.org 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 vim-script Vim script 1991 24 pl 112 441 4 23738 true 112 ad-hoc ana austral bqn bruijn bucklescript c2 caramel carbon catala ceu cir cito claro clay click cmake codeql crmsh croc cryptol cspydr cyber dale dedukti dern differential-datalog djot dllup dlvm elymas factor felix flow9 frundis gap generate-ninja gentee gforth groff hakaru hhvm hobbes huginn hurl icarus ink-lang invokator jakt jank jflex kitlang kitten koka lambda-zero ligo lil linux logica mal mirth mu mycroft mythryl nesc newclay newlisp ngnk ngs ninja nit nodejs noulith objectscript opa opal oxyl pan penrose poke pygments pyret-lang pyret pytorch qore quint ragel redprl rescript ricscript rosie simit sixten skip smpl sporth srt star sugar swift truck unison v-golf v8 vimwiki virgil vlc wart wlambda xsv-app xxl yeti pl 10166 10963 .exrc .gvimrc .nvimrc .vimrc _vimrc gvimrc nvimrc vimrc 3544 24 "author name avatar url language languageColor stars forks currentPeriodStars description\nneovim neovim https://github.com/neovim.png https://github.com/neovim/neovim ""Vim script"" #199f4b 32892 2396 564 ""Vim-fork focused on extensibility and usability""\njunegunn vim-plug https://github.com/junegunn.png https://github.com/junegunn/vim-plug ""Vim script"" #199f4b 15853 735 338 ""🌺 Minimalist Vim Plugin Manager""\ntpope vim-fugitive https://github.com/tpope.png https://github.com/tpope/vim-fugitive ""Vim script"" #199f4b 11401 686 194 ""fugitive.vim: A Git wrapper so awesome, it should be illegal""\nfatih vim-go https://github.com/fatih.png https://github.com/fatih/vim-go ""Vim script"" #199f4b 10992 1106 172 ""Go development plugin for Vim""\nrafi awesome-vim-colorschemes https://github.com/rafi.png https://github.com/rafi/awesome-vim-colorschemes ""Vim script"" #199f4b 748 63 43 ""Collection of awesome color schemes for Neo/vim, merged for quick use.""\nmashirozx Pixiv-Nginx https://github.com/mashirozx.png https://github.com/mashirozx/Pixiv-Nginx ""Vim script"" #199f4b 431 66 46 P站（Pixiv）的正确打开方式\nyangyangwithgnu use_vim_as_ide https://github.com/yangyangwithgnu.png https://github.com/yangyangwithgnu/use_vim_as_ide ""Vim script"" #199f4b 8042 2247 120 ""use vim as IDE""\narcticicestudio nord-vim https://github.com/arcticicestudio.png https://github.com/arcticicestudio/nord-vim ""Vim script"" #199f4b 852 97 86 ""An arctic, north-bluish clean and elegant Vim theme.""\nchxuan vimplus https://github.com/chxuan.png https://github.com/chxuan/vimplus ""Vim script"" #199f4b 1626 610 76 ""🚀An automatic configuration program for vim""\nvim vim https://github.com/vim.png https://github.com/vim/vim ""Vim script"" #199f4b 17776 2352 314 ""The official Vim repository""\njiangmiao auto-pairs https://github.com/jiangmiao.png https://github.com/jiangmiao/auto-pairs ""Vim script"" #199f4b 2250 251 48 ""Vim plugin, insert or delete brackets, parens, quotes in pair""\nmorhetz gruvbox https://github.com/morhetz.png https://github.com/morhetz/gruvbox ""Vim script"" #199f4b 6102 575 137 ""Retro groove color scheme for Vim""\nvimwiki vimwiki https://github.com/vimwiki.png https://github.com/vimwiki/vimwiki ""Vim script"" #199f4b 3660 324 61 ""Personal Wiki for Vim""\nwsdjeg vim-galore-zh_cn https://github.com/wsdjeg.png https://github.com/wsdjeg/vim-galore-zh_cn ""Vim script"" #199f4b 4876 789 153 ""Vim 从入门到精通""\nmacvim-dev macvim https://github.com/macvim-dev.png https://github.com/macvim-dev/macvim ""Vim script"" #199f4b 5340 561 72 ""Vim - the text editor - for Mac OS X""\nflazz vim-colorschemes https://github.com/flazz.png https://github.com/flazz/vim-colorschemes ""Vim script"" #199f4b 2748 565 31 ""one colorscheme pack to rule them all!""\nscrooloose nerdtree https://github.com/scrooloose.png https://github.com/scrooloose/nerdtree ""Vim script"" #199f4b 12161 1132 177 ""A tree explorer plugin for vim.""\ndense-analysis ale https://github.com/dense-analysis.png https://github.com/dense-analysis/ale ""Vim script"" #199f4b 8261 896 196 ""Check syntax in Vim asynchronously and fix files, with Language Server Protocol (LSP) support""\namix vimrc https://github.com/amix.png https://github.com/amix/vimrc ""Vim script"" #199f4b 18996 5365 307 ""The ultimate Vim configuration: vimrc""\nSpaceVim SpaceVim https://github.com/SpaceVim.png https://github.com/SpaceVim/SpaceVim ""Vim script"" #199f4b 11943 1005 302 ""A community-driven modular vim distribution - The ultimate vim configuration""\nsheerun vim-polyglot https://github.com/sheerun.png https://github.com/sheerun/vim-polyglot ""Vim script"" #199f4b 2901 165 78 ""A solid language pack for Vim.""\neasymotion vim-easymotion https://github.com/easymotion.png https://github.com/easymotion/vim-easymotion ""Vim script"" #199f4b 4508 250 56 ""Vim motions on speed!""\nmattn emmet-vim https://github.com/mattn.png https://github.com/mattn/emmet-vim ""Vim script"" #199f4b 4782 358 44 ""emmet for vim: http://emmet.io/""" vim or viml or nvim text source.viml programming false v/VimScript.vim 117 2014 2018 1 7 vimscript viml textedit.py 1991 c unix linux ios android vi tcl lua perl python racket ruby regex gzip ftp http unicode "Vim (; a contraction of Vi IMproved) is a clone, with additions, of Bill Joy's vi text editor program for Unix. It was written by Bram Moolenaar based on source for a port of the Stevie editor to the Amiga and first released publicly in 1991. Vim is designed for use both from a command-line interface and as a standalone application in a graphical user interface. Vim is free and open-source software and is released under a license that includes some charityware clauses, encouraging users who enjoy the software to consider donating to children in Uganda. The license is compatible with the GNU General Public License through a special clause allowing distribution of modified copies ""under the GNU GPL version 2 or any later version"".Although it was originally released for the Amiga, Vim has since been developed to be cross-platform, supporting many other platforms. In 2006, it was voted the most popular editor amongst Linux Journal readers; in 2015 the Stack Overflow developer survey found it to be the third most popular text editor, and the fifth most popular development environment in 2018." 2008 4 851 40 32478 Vim script (also called vimscript or VimL) is the scripting language built into Vim. Vim script (also called vimscript or VimL) is the scripting language built into Vim. Vim script (also called vimscript or VimL) is the scripting language built into Vim. vim vba vimrc vmb vim vim .vimrc .exrc .gvimrc _vimrc _exrc _gvimrc vimrc gvimrc true 240 0 https://exercism.org/tracks/vim 27 vim text "echo ""Hello World"" " """ Name: Solarized vim colorscheme "" Author: Ethan Schoonover "" URL: http://ethanschoonover.com/solarized "" (see this url for latest release & screenshots) "" License: OSI approved MIT license (see end of this file) "" Created: In the middle of the night "" Modified: 2011 May 05 "" "" Usage ""{{{ "" "" --------------------------------------------------------------------- "" ABOUT: "" --------------------------------------------------------------------- "" Solarized is a carefully designed selective contrast colorscheme with dual "" light and dark modes that runs in both GUI, 256 and 16 color modes. "" "" See the homepage above for screenshots and details. "" "" --------------------------------------------------------------------- "" OPTIONS: "" --------------------------------------------------------------------- "" See the ""solarized.txt"" help file included with this colorscheme (in the "" ""doc"" subdirectory) for information on options, usage, the Toggle Background "" function and more. If you have already installed Solarized, this is available "" from the Solarized menu and command line as "":help solarized"" "" "" --------------------------------------------------------------------- "" INSTALLATION: "" --------------------------------------------------------------------- "" Two options for installation: manual or pathogen "" "" MANUAL INSTALLATION OPTION: "" --------------------------------------------------------------------- "" "" 1. Download the solarized distribution (available on the homepage above) "" and unarchive the file. "" 2. Move `solarized.vim` to your `.vim/colors` directory. "" 3. Move each of the files in each subdirectories to the corresponding .vim "" subdirectory (e.g. autoload/togglebg.vim goes into your .vim/autoload "" directory as .vim/autoload/togglebg.vim). "" "" RECOMMENDED PATHOGEN INSTALLATION OPTION: "" --------------------------------------------------------------------- "" "" 1. Download and install Tim Pope's" VimL https://riju.codes/vimscript ":echo ""Hello, world!""" """ This is the Hello World program in Vim script. echo ""Hello, world!"" "" This is a simple while loop in Vim script. let i = 1 while i < 5 echo ""count is"" i let i += 1 endwhile" VimScript echo """" true true true https://en.wikipedia.org/wiki/Vim_script 0 0 Vim script https://github.com/Alhadis/language-viml Vim script arkscript ArkScript 2019 Alexandre Plateau and Pierre Pharel and Natendrtfm 31 pl https://arkscript-lang.dev 0 v4.0.0-rc5 442 2 12 23737 true 0 https://github.com/ArkScript-lang/Ark pl 2019 2024 2019 12 44 578 8 false a/ArkScript.ark 2019 2025 2681 43 1226 7 40126 ArkScript is a small, fast, functional and scripting language for C++ projects ArkScript is a small, fast, functional and scripting language for C++ projects Alexandre Plateau ArkScript is a small, fast, functional and scripting language for C++ projects ark cpp markdown yaml json csv cmake bash python bourne-shell svg xml dockerfile true 755 0 50 3 false 4 true https://arkscript-lang.dev/documentation.html France "(import std.random) (import std.Math) (let number (mod (math:abs (random)) 10000)) (let game (fun () { (let impl (fun (tries) { (let guess (toNumber (input ""Input a numeric value: ""))) (if (< guess number) { (print ""It's more than "" guess) (impl (+ tries 1))} (if (= guess number) { (print ""You found it!"") tries } { (print ""It's less than "" guess) (impl (+ tries 1))}))})) (let tries (impl 0)) (print ""You won in "" tries "" tries."")})) (game)" "(print ""Hello World"") " ArkScript https://github.com/ArkScript-lang/Ark # print """" true false true true true true true false true 0 0 arkscript-lang.dev id|title|time|timestamp|by|comments|score\n22695517|Show HN: ArkScript, a small and fast language for scripting video games|2020-03-26 16:57:12 UTC|1585238232|jackrabbit_|42|101\n40695579|Show HN: An Online Playground for ArkScript|2024-06-16 08:29:32 UTC|1718519372|jackrabbit_|1|1 json-schema JSON Schema 2010 Kris Zyp 16 dataValidationLanguage http://json-schema.org/ 0 1.0.0 443 1 6 23735 true 0 https://github.com/json-schema-org/json-schema-spec dataValidationLanguage 2015 2024 2010 103 250 3481 87 false 2010 2025 2257 86 60 4 17514 2007 JSON Schema is a vocabulary that allows you to annotate and validate JSON documents. JSON Schema is a vocabulary that allows you to annotate and validate JSON documents. https://github.com/json-schema-org JSON Schema is a vocabulary that allows you to annotate and validate JSON documents. markdown json javascript yaml xml make true 4319 0 23 livr 1 false 1 true Various "{ ""$id"": ""https://example.com/calendar.schema.json"", ""$schema"": ""https://json-schema.org/draft/2020-12/schema"", ""description"": ""A representation of an event"", ""type"": ""object"", ""required"": [ ""dtstart"", ""summary"" ], ""properties"": { ""dtstart"": { ""type"": ""string"", ""description"": ""Event starting time"" }, ""dtend"": { ""type"": ""string"", ""description"": ""Event ending time"" }, ""summary"": { ""type"": ""string"" }, ""location"": { ""type"": ""string"" }, ""url"": { ""type"": ""string"" }, ""duration"": { ""type"": ""string"", ""description"": ""Event duration"" }, ""rdate"": { ""type"": ""string"", ""description"": ""Recurrence date"" }, ""rrule"": { ""type"": ""string"", ""description"": ""Recurrence rule"" }, ""category"": { ""type"": ""string"" }, ""description"": { ""type"": ""string"" }, ""geo"": { ""$ref"": ""https://example.com/geographical-location.schema.json"" } } }" https://github.com/json-schema-org/json-schema-spec 0 0 json-schema.org b B 1969 Ken Thompson and Dennis Ritchie 21 pl 0 444 1 23733 492 true 0 pl false 1969 abc bcpl pl-i c multics algol-58 unix tmg yacc 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. 2001 272 110 288 4475 Bell Labs b 1380 0 25 2 text 124 https://github.com/antlr/grammars-v4/tree/master/b http://www.rosettacode.org/wiki/Category:B United States /* The following function will print a non-negative number, n, to the base b, where 2<=b<=10. This routine uses the fact that in the ASCII character set, the digits 0 to 9 have sequential code values. */ printn(n, b) { extrn putchar; auto a; if (a = n / b) /* assignment, not test for equality */ printn(a, b); /* recursive */ putchar(n % b + '0'); } B /* */ putchar true true true false https://en.wikipedia.org/wiki/B_(programming_language) 0 3 https://hopl.info/showlanguage.prx?exp=492 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 jcl JCL 1964 19 pl 2 445 1 23731 2134 true 2 cloc pygments pl false Job Control Language scripting.py 1964 unix assembly-language clist 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. 2003 155 163 546 391487 IBM jcl 795 0 20 jcl text http://www.rosettacode.org/wiki/Category:JCL United States JCL * $$ JOB JNM=NAME,DISP=K,CLASS=2 [some JCL statements here] * $$ EOJ true true false https://en.wikipedia.org/wiki/Job_Control_Language 7 0 https://hopl.info/showlanguage.prx?exp=2134 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)|Ramdén, H. Å|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 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 closure-templates Closure Templates 2009 20 template 0 446 2 12 23726 true 0 https://github.com/google/closure-templates template 18 25 424389 0 soy soy_template soy text/x-soy text.html.soy markup 2014 2024 2009 37 193 635 198 false 19 2017 2017 1 2 2009 2025 6277 92 1573 79 41982 Google soy java starlark markdown html javascript protobuf python xml typescript json bazel yaml true 1507 0 34 false text United States /** * Says hello to the world. */ {template .helloWorld} Hello world! {/template} "{namespace Exmaple} /** * Example */ {template .foo} {@param count: string} {@param? name: int} {if isNonnull($name)}
{$name}
{/if}
{switch count} {case 0} {call Empty.view} {param count: $count /} {/call} {default}
Wow, so many!
{/switch}
{/template}" https://github.com/google/closure-templates /* */ true true false 0 0 Closure Templates https://github.com/mthadley/language-closure-templates Closure Templates xbase xBase 1986 26 pl 2 447 2 23725 2621 true 2 cloc pygments pl 313 350 2564 0 advpl or clipper or foxpro text source.harbour programming false x/XBase.dbf 157 2014 2017 3 7 1986 jet-propulsion-laboratory-display-information-system "xBase is the generic term for all programming languages that derive from the original dBASE (Ashton-Tate) programming language and database formats. These are sometimes informally known as dBASE ""clones"". While there was a non-commercial predecessor to the Ashton-Tate product (Vulcan written by Wayne Ratliff), most clones are based on Ashton-Tate's 1986 dBASE III+ release — scripts written in the dBASE III+ dialect are most likely to run on all the clones." 2004 41 65 190 572327 prg ch prw dbf 425 0 32 prg prw https://www.eclipse.org/Xtext/documentation/305_xbase.html#xbase-expressions text http://www.rosettacode.org/wiki/Category:XBase United States do while .t. ? 'Hello World' enddo "#ifndef __HARBOUR__ #ifndef __XPP__ #ifndef __CLIP__ #ifndef FlagShip #define __CLIPPER__ #endif #endif #endif #endif /* File create flags */ #define FC_NORMAL 0 /* No file attributes are set */ #define FC_READONLY 1 #define FC_HIDDEN 2 #define FC_SYSTEM 4 // New-style comment #command SET DELETED => Set( _SET_DELETED, <(x)> ) #command SET DELETED () => Set( _SET_DELETED, ) #command @ , SAY [PICTURE ] [COLOR ] => ; DevPos( , ) ; DevOutPict( , [, ] ) #command ENDIF <*x*> => endif #ifdef __CLIPPER__ #xtranslate hb_MemoWrit( [] ) => MemoWrit( ) #xtranslate hb_dbExists( ) => File( ) #xtranslate hb_dbPack() => __dbPack() #xtranslate hb_default( @, ) => iif( StrTran( ValType( ), ""M"", ""C"" ) == StrTran( ValType( ), ""M"", ""C"" ),, := , ) #endif " XBase // /* */ ' true true true false true https://en.wikipedia.org/wiki/XBase 8 0 https://hopl.info/showlanguage.prx?exp=2621 xBase xBase https://github.com/hernad/atom-language-harbour year|publisher|title|authors|isbn13\n||Xbase Programming|Prague and Cary N.|9780830640515\n|William C. Brown|Xbase Programming For The True Beginner|E. Kaluzniacky and V. Kanabar|9780697228734\nAugust 2011||Articles on xBase Programming Language Family, Including|Hephaestus Books|9781243313034\n1996|M & T Books|From Xbase To Windows: Crossing Over To Windows Programming|Joseph D. Booth|9781558514805\n1993|Sigma Pr|Database Graphics Programming: A Guide For Xbase Developers Using Dge|Jason Manger|9781850585046\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\n1995|Wordware|Learn Dbase Programming In A Day: For Users Of Dbase-compatible Database Programs That Use The Xbase Language Including Dbase Iii Plus, Dbase Iv, Db (popular Applications Series)|Russell A. Stultz|9781556224478\n1992|Wordware|Learn Dbase Programming In A Day/book And Disk: For Users Of Dbase-compatible Database Programs That Use The Xbase Language Including Dbase Iii Plus, ... Datab+spro, (popular Applications Series)|Russell A. Stultz|9781556222757 xBase oz Oz 1991 Gert Smolka 33 pl http://mozart.github.io 0 448 4 23724 2327 true 0 pl 70 72 371 0 text oz text/x-oz source.oz programming false 59 2010 2012 1 2 1991 erlang lisp prolog alice scala unix freebsd linux curry mercury visual-prolog 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. 2003 78 60 228 256916 Universität des Saarlandes oz true 661 0 36 1 false https://www.ps.uni-saarland.de/oz2/documentation/ http://mozart2.org/mozart-v1/doc-1.4.0/tutorial/index.html text 2692 oz http://www.rosettacode.org/wiki/Category:Oz Germany Oz "% Hello World in Oz functor import System Application define {System.showInfo ""Hello World!""} {Application.exit 0} end" % You can get a lot of information about Oz by following theses links : % - http://mozart.github.io/ % - http://en.wikipedia.org/wiki/Oz_(programming_language) % There is also a well known book that uses Oz for pedagogical reason : % - http://mitpress.mit.edu/books/concepts-techniques-and-models-computer-programming % And there are two courses on edX about 'Paradigms of Computer Programming' that also uses Oz for pedagogical reason : % - https://www.edx.org/node/2751#.VHijtfl5OSo % - https://www.edx.org/node/4436#.VHijzfl5OSo % % Here is an example of some code written with Oz. declare % Computes the sum of square of the N first integers. fun {Sum N} local SumAux in fun {SumAux N Acc} if N==0 then Acc else {Sum N-1 Acc} end end {SumAux N 0} end end % Returns true if N is a prime and false otherwize fun {Prime N} local PrimeAcc in fun {PrimeAcc N Acc} if(N == 1) then false elseif(Acc == 1) then true else if (N mod Acc) == 0 then false else {PrimeAcc N Acc-1} end end end {PrimeAcc N (N div 2)} end end % Reverse a list using cells and for loop (instead of recursivity) fun {Reverse L} local RevList in RevList = {NewCell nil} for E in L do RevList := E|@RevList end @RevList end end https://riju.codes/oz functor import Application System define {System.showInfo 'Hello, world!'} {Application.exit 0} end class Counter attr val meth init(Value) val:=Value end meth browse {Browse @val} end meth inc(Value) val :=@val+Value end end local C in C = {New Counter init(0)} {C inc(6)} {C browse} end % true false true true true false https://en.wikipedia.org/wiki/Oz_(programming_language) 0 22 https://hopl.info/showlanguage.prx?exp=2327 Oz mozart.github.io Oz https://github.com/eregon/oz-tmbundle Oz oz engineer 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 scoop-pm Scoop 2013 Luke Sampson 14 packageManager https://scoop.sh/ 0 v0.4.2 449 0 6 23723 false 0 https://github.com/ScoopInstaller/Scoop packageManager 2013 2024 2013 241 1381 20522 246 false 2013 2024 10379 513 140 15 2013 A command-line installer for Windows A command-line installer for Windows https://github.com/ScoopInstaller A command-line installer for Windows powershell json markdown yaml csharp xml true 25180 0 20 1 false 0 true Australia https://github.com/ScoopInstaller/Scoop 0 0 scoop.sh dgraph dgraph 2015 14 application https://dgraph.io 0 v24.0.0-alpha3 450 0 16 23721 false 0 https://github.com/dgraph-io/dgraph application 2015 2024 2015 371 1479 20213 224 false 2015 2025 11408 274 1378 467 256719 https://github.com/dgraph-io go yaml graphql hcl markdown bourne-shell json make xml dockerfile javascript tex ruby bash protobuf python true 24926 0 31 graphql-plus-minus false 24 true United States https://twitter.com/dgraphlabs https://github.com/dgraph-io/dgraph 0 0 dgraph.io wax Wax 2020 Lingdong Huang 26 pl https://waxc.netlify.app/ 0 0.0.1 451 0 15 23720 true 0 https://github.com/LingDong-/wax pl 2020 2024 26 44 770 16 false 2020 2022 78 9 60 2 22380 https://waxc.netlify.app/ A tiny programming language that transpiles to C, C++, Java, TypeScript, Python, C#, Swift, Lua and WebAssembly A tiny programming language that transpiles to C, C++, Java, TypeScript, Python, C#, Swift, Lua and WebAssembly A tiny programming language that transpiles to C, C++, Java, TypeScript, Python, C#, Swift, Lua and WebAssembly c wasm javascript python markdown html cpp svg swift java make bourne-shell csharp lua typescript c cpp java typescript python csharp swift lua wasm true 913 0 51 1 false 0 true https://github.com/LingDong-/wax ; true true true true true true true true true true true true 0 0 self Self 1987 David Ungar 29 pl http://www.selflanguage.org 0 452 3 23718 1361 true 1 javascript pl 24 26 36 0 text none programming false s/Self.self 2009 1987 smalltalk newtonscript javascript io agora squeak lisaac lua factor rebol java solaris linux c cecil ioke 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. 2002 88 87 350 60265 Sun Microsystems self self true 461 0 31 1 https://handbook.selflanguage.org/2017.1/index.html text 697 http://www.rosettacode.org/wiki/Category:Self United States https://www.youtube.com/watch?v=Ox5P7QyL774 "(| ""Hello World in Self"" hello = (| | 'Hello World!' print) |) " 'Hello World' printLine _AddSlots: (| porsche911 <- sportsCar copy |). porsche911 name:'Bobs Porsche'. Self printLine ' true true false true https://en.wikipedia.org/wiki/Self_(programming_language) 1 2 https://hopl.info/showlanguage.prx?exp=1361 selflanguage.org Self 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 Self 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 pyret pyret 2011 Joe Gibbs Politz 20 pl https://www.pyret.org/ 0 453 2 13 23717 true 0 https://github.com/brownplt/pyret-lang pl 2012 2024 2012 42 106 1061 437 false p/Pyret.arr 2012 2025 11152 92 654 481 1095548 2011 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. 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. Brown University 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. arr javascript json markdown svg make lisp vim-script asp.net html bourne-shell csv xml yaml true 1473 0 https://exercism.org/tracks/pyret 35 1 false United States "data BinTree: | leaf | node(value, left, right) end fun tree-sum(t): doc: ""Calculate the sum of node values"" cases (BinTree) t: | leaf => 0 | node(v, l, r) => v + tree-sum(l) + tree-sum(r) end where: tree-sum(leaf) is 0 node4 = node(4, leaf, leaf) tree-sum(node(5, node4, leaf)) is 9 end" print('Hello World') Pyret https://github.com/brownplt/pyret-lang print ' true true 0 0 pyret.org activity-pub ActivityPub 2018 Christine Lemmer-Webber and Jessica Tallon and Erin Shepherd and Amy Guy and Evan Prodromou 17 protocol https://activitypub.rocks/ 0 454 0 4 23715 true 1 farcaster https://github.com/w3c/activitypub protocol 2014 2024 2014 83 70 1167 82 false activity-pub.png 2014 2024 650 29 26 2 15585 ActivityPub is an open, decentralized social networking protocol based on Pump.io's ActivityPump protoco ActivityPub is an open, decentralized social networking protocol based on Pump.io's ActivityPump protoco W3C ActivityPub is an open, decentralized social networking protocol based on Pump.io's ActivityPump protoco markdown html svg json true 1408 0 25 5 false https://w3c.github.io/activitypub/ United States https://w3c.github.io/activitypub/ https://github.com/w3c/activitypub 0 0 w3c.github.io lily Lily 2011 22 pl http://lily-lang.org 0 455 1 7 23715 true 0 https://github.com/FascinatedBox/lily pl 2014 2024 2011 32 38 1082 0 false 2011 2024 5226 28 195 13 57704 http://lily-lang.org/intro-sandbox.html 2016 An interpreted language with a focus on expressiveness and type safety An interpreted language with a focus on expressiveness and type safety https://gitlab.com/FascinatedBox/lily/-/issues An interpreted language with a focus on expressiveness and type safety c lua ruby python cmake markdown yaml true 1226 0 29 false https://tio.run/#lily text http://www.rosettacode.org/wiki/Category:Lily Unknown "scoped enum Color { Black, Blue, Cyan, Green, Magenta, Red, White, Yellow } class Terminal(public var @foreground: Color, width_str: String) { public var @width = width_str.parse_i().unwrap_or(80) public define set_fg(new_color: Color) { @foreground = new_color } } var terms = [Terminal(Color.White, ""A""), Terminal(Color.Red, ""40"")] terms.each(|e| e.width += 20 ) |> print" https://github.com/FascinatedBox/lily https://gitlab.com/FascinatedBox/lily true false 1 0 lily-lang.org year|publisher|title|authors|isbn13\n2017|Independently published|The Lily and the Cross: A Ring and Crown Novel|de la Cruz, Melissa|9781973305514 nit Nit 2008 Jean Privat 32 pl https://nitlanguage.org/ 0 v0.7.9 456 3 28 23715 true 0 https://github.com/nitlang/nit pl 26 26 29 0 text source.nit programming 2009 2024 2008 23 64 237 171 false n/Nit.nit 7 2014 2015 24 2 nit.py 2008 2024 13983 49 6572 125 2008 https://github.com/nitlang nit nit nit rescript c ini markdown make html bourne-shell xml svg java javascript css dockerfile vim-script diff yaml perl tex brainfuck python ruby bash go less haskell r pug json true 680 0 62 1 false 0 true text http://www.rosettacode.org/wiki/Category:Nit Canada http://nitlanguage.org/nit.git/ "print ""Hello, World!""" "print ""Hello World"" " "print ""hello world"" " Nit Nit https://github.com/nitlang/nit print """" true true true true true true true 0 0 nitlanguage.org Nit https://github.com/R4PaSs/Sublime-Nit Nit mariadb MariaDB 2009 17 queryLanguage 0 457 0 23713 true 0 queryLanguage false 2009 c perl bash solaris linux mysql freebsd "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." 2009 538 218 556 24960699 MariaDB Foundation true 2710 0 258 https://mariadb.org/documentation/ text https://github.com/antlr/grammars-v4/tree/master/sql/mariadb Finland and United States https://riju.codes/mariadb 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 TRUE FALSE true https://en.wikipedia.org/wiki/MariaDB 5 0 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 gosu Gosu 2002 30 pl http://gosu-lang.org/ 0 458 3 23712 true 0 pl 486 539 701 0 text source.gosu.2 programming false g/Gosu.gs 13 2011 2014 5 2 jvm.py 2009 2017 java-bytecode java csharp kotlin javascript pascal go Gosu is a statically-typed programming language that runs on the Java Virtual Machine released under the Apache 2. This general-purpose programming language is used in several open-source software projects including SparkGS and Ragnar DB among several others, and is widely used in the insurance industry via Guidewire Software's commercial products. The language borrows from several existing languages including Java, C#, and ECMAScript. A notable and unique feature is its Open Type System, which allows the language to be easily extended to provide compile-time checking and IDE awareness of information that is typically checked only at runtime in most other languages. Also of note is the language's ability to serve as both a full-featured general purpose language and as a concise scripting language. For instance, Gosu has free-form Program types (.gsp files) for scripting as well as statically verified Template files (.gst files). Gosu can optionally execute these and all other types directly from source without precompilation, which also distinguishes it from other static languages. 2010 101 38 131 29539307 Guidewire Software, Inc gs gsp gst gsx gs gst gsx vark gs gs gsx gsp vark gs gsp gst gsx true 726 0 36 text http://www.rosettacode.org/wiki/Category:Gosu United States "print(""Hello World"") " "function hello() { print(""hello"") }" Gosu var list = {1, 2, 3} var result = list.where(\ elem -> elem >= 2) print(result) Gosu print """" true true true true true true true https://en.wikipedia.org/wiki/Gosu_(programming_language) 1 0 Gosu gosu-lang.org Gosu https://github.com/jpcamara/Textmate-Gosu-Bundle year|publisher|title|authors|isbn13\n2015|Pragmatic Bookshelf|Learn Game Programming with Ruby: Bring Your Ideas to Life with Gosu|Sobkowicz, Mark|9781680500738 Gosu apache-hbase Apache Hbase 2008 14 application https://hbase.apache.org/ 0 459 0 28 23711 false 0 https://github.com/apache/hbase application 2014 2024 404 3307 5173 239 false 2007 2025 59095 861 5937 511 198326 2008 java linux json sql mongodb couchdb postgresql 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. 106 16266878 https://github.com/apache/hbase java ruby protobuf asciidoc bourne-shell xml java-server-pages python html javascript markdown css cpp dockerfile perl yaml php svg xslt vtl-lang thrift bash csv xsd c puppet make cmake true 16507 65 42 false https://hbase.apache.org/book.html https://github.com/apache/hbase https://en.wikipedia.org/wiki/Apache_HBase 2 0 hbase.apache.org hbase developer 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 kitten kitten 2012 Jon Purdy 22 pl http://kittenlang.org/ 0 460 2 8 23711 true 0 https://github.com/evincarofautumn/kitten pl 2011 2024 2011 71 39 1088 66 false k/Kitten.ktn 2011 2023 1140 15 110 4 17784 Kitten is a statically typed concatenative language with effect types. Kitten is a statically typed concatenative language with effect types. https://github.com/evincarofautumn/kitten/issues Kitten is a statically typed concatenative language with effect types. ktn haskell markdown xml vim-script yaml c make lisp true 1222 0 32 1 false text http://www.rosettacode.org/wiki/Category:Kitten United States """Hello World"" say " https://riju.codes/kitten """Hello, world!"" say " Kitten https://github.com/evincarofautumn/kitten say """" true true 0 0 kittenlang.org jasmine jasmine 2008 14 library https://jasmine.github.io/ 0 5.1.2 461 0 10 23710 true 0 https://github.com/jasmine/jasmine library 2008 2024 2008 444 2240 15727 14 false 2008 2025 2913 370 363 11 61725 https://github.com/jasmine/jasmine javascript markdown yaml json scss bash erb css svg bourne-shell true 22819 0 24 false 5 true text United States https://github.com/jasmine/jasmine 0 0 jasmine.github.io codecept codecept 2015 15 library http://codecept.io/ 0 3.6.2 462 0 12 23709 true 0 https://github.com/codeception/codeceptjs/ library 2015 2024 98 718 4078 173 false 2015 2025 3339 450 924 59 116947 2015 https://github.com/codeceptjs/ javascript mustache php markdown json yaml gherkin typescript bourne-shell html dockerfile bash true 6684 0 27 false 3 true text Ukraine and India https://twitter.com/codeceptjs https://github.com/codeception/codeceptjs/ 0 0 codecept.io ioke Ioke 2008 Ola Bini 36 pl http://ioke.org 0 463 3 10 23708 true 0 https://github.com/olabini/ioke pl 39 41 17 0 ioke text source.ioke programming 2010 2024 2008 14 22 164 1 false i/Ioke.ik 1552 2008 2009 1 13 jvm.py 2008 2011 3601 19 631 101 95435 2008 2008 io smalltalk lisp ruby jruby 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. 2008 22 16 49 20148120 https://github.com/olabini/ioke/issues/ ik ik ik ik ik java csharp xml html lisp css php bash python ruby true 581 0 50 jvm 1 false https://ioke.org/wiki/index.php/Main_Page text http://www.rosettacode.org/wiki/Category:Ioke Ecuador https://ioke.org/wiki/index.php/Guide """Hello World"" println " "#!/usr/bin/env ioke ""Hello world."" println " Ioke https://riju.codes/ioke """Hello, world!"" println " Ioke https://github.com/olabini/ioke println """" true true true true true https://en.wikipedia.org/wiki/Ioke_(programming_language) 1 0 Ioke ioke.org Ioke https://github.com/vic/ioke-outdated year|publisher|title|authors|isbn13\n2012||Ioke (programming Language)|Timoteus Elmo|9786137118351 Ioke maxima Maxima 1982 31 pl http://maxima.sourceforge.net/ 0 464 1 23706 true 0 pl false m/Maxima.max maxima.py 1982 common-lisp unix linux android algol lisp gnuplot fortran jupyter-editor python qt sagemath r lyx-editor emacs-editor isbn 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). 2002 134 250 380 95925 MIT max mac max true 691 0 47 https://tio.run/#maxima text http://www.rosettacode.org/wiki/Category:Maxima United States Maxima "print(""Hello World"")$ " Maxima Maxima if then else elseif do while repeat until for from to downto step thru print """" true true true true true true false true true https://github.com/robert-dodier/maxima-jupyter https://en.wikipedia.org/wiki/Maxima_(software) 2 4 maxima.sourceforge.net 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 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 modelica Modelica 1997 29 pl http://www.modelica.org/ 0 465 2 23705 4965 true 0 pl 447 542 1208 0 text modelica text/x-modelica source.modelica programming false 55 2013 2017 12 6 modeling.py 1998 1997 java unicode ampl general-algebraic-modeling-system matlab simulink doi 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. 2005 93 53 288 1467946 Modelica Association mo mo 736 0 30 text https://github.com/antlr/grammars-v4/tree/master/modelica modelica Sweden https://modelica.readthedocs.io/en/latest/lexical.html "within ModelicaByExample; package PackageExamples ""Examples of using packages"" end PackageExamples; " Modelica "model Circuit Capacitor C1(C=1e-4) ""A Capacitor instance from the model above""; Capacitor C2(C=1e-5) ""A Capacitor instance from the model above""; ... equation connect(C1.pin_p, C2.pin_n); ... end Circuit;" // true true true true false true https://en.wikipedia.org/wiki/Modelica 2 14 https://hopl.info/showlanguage.prx?exp=4965 modelica.org Modelica https://github.com/BorisChumichev/modelicaSublimeTextPackage year|publisher|title|authors|isbn13\n2004|Wiley-IEEE Press|Principles of Object-Oriented Modeling and Simulation with Modelica 2.1|Fritzson, Peter|9780471471639 Modelica 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 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 mun-lang mun-lang 2019 18 pl https://mun-lang.org/ 0 v0.5.0 466 1 13 23704 true 0 https://github.com/mun-lang/mun pl 2019 2024 2019 27 72 1813 44 false 2019 2025 943 32 795 6 105203 2019 https://github.com/mun-lang rust toml markdown yaml svg cpp javascript cmake bourne-shell json bash lua css true 2063 0 32 false 0 true Various https://news.ycombinator.com/item?id=21172980 fn main() { let sum = add(a, b); // Comments: Mun natively supports bool, float, and int let is_true = true; let var: float = 0.5; } // The order of function definitions doesn't matter fn add(a: int, b: int): int { a + b } https://github.com/mun-lang/mun // true true false 0 0 mun-lang.org openrc-runscript OpenRC runscript 2007 Roy Marples 17 application 0 0.53.1 467 2 6 23703 false 0 https://github.com/OpenRC/openrc application 0 Shell openrc openrc-run sh shell text/x-sh source.shell programming 2013 2024 2007 60 239 1416 151 false 243 2013 2018 1 31 2007 2025 4276 215 323 8 34837 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. 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. https://roy.marples.name/projects 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. meson c bourne-shell markdown yaml perl true 2549 0 23 1 false 0 true text England http://www.linuxhowtos.org/manpages/8/openrc-run.htm "#!/sbin/openrc-run command=/usr/bin/foo command_args=""${foo_args} --bar"" pidfile=/var/run/foo.pid name=""FooBar Daemon"" description=""FooBar is a daemon that eats and drinks"" extra_commands=""show"" extra_started_commands=""drink eat"" description_drink=""Opens mouth and reflexively swallows"" description_eat=""Chews food in mouth"" description_show=""Shows what's in the tummy"" _need_dbus() { grep -q dbus /etc/foo/plugins } depend() { # We write a pidfile and to /var/cache, so we need localmount. need localmount # We can optionally use the network, but it's not essential. use net # We should be after bootmisc so that /var/run is cleaned before # we put our pidfile there. after bootmisc # Foo may use a dbus plugin. # However, if we add the dbus plugin whilst foo is running and # stop dbus, we don't need to stop foo as foo didn't use dbus. config /etc/foo/plugins local _need= if service_started; then _need=`service_get_value need` else if _need_dbus; then _need=""${_need} dbus"" fi fi need ${_need} } # This function does any pre-start setup. If it fails, the service will # not be started. # If you need this function to behave differently for a restart command, # you should check the value of RC_CMD for ""restart"". # This also applies to start_post, stop_pre and stop_post. start_pre() { if [ ""$RC_CMD"" = restart ]; then # This block will only execute for a restart command. Use a # structure like this if you need special processing for a # restart which you do not need for a normal start. # The function can also fail from here, which will mean that a # restart can fail. # This logic can also be used in start_post, stop_pre and # stop_post. fi # Ensure that our dirs are correct checkpath --directory --owner foo:foo --mode 0775 \ /var/run/foo /var/cache/foo } start_post() { # Save our need if _need_dbus; then service_set_value need dbus fi } stop_post() { # Clean any spills rm -rf /var/cache/foo/* } drink() { ebegin ""Starting to drink"" ${command} --drink beer eend $? ""Failed to drink any beer :("" } eat() { local result=0 retval= ate= food= ebegin ""Starting to eat"" if yesno ""${foo_diet}""; then eend 1 ""We are on a diet!"" return 1 fi for food in /usr/share/food/*; do veinfo ""Eating `basename ${food}`"" ${command} --eat ${food} retval=$? : $(( result += retval )) [ ${retval} = 0 ] && ate=""${ate} `basename ${food}`"" done if eend ${result} ""Failed to eat all the food""; then service_set_value ate ""${ate}"" fi } show() { einfo ""Foo has eaten: `service_get_value ate`"" }" "#!/sbin/openrc-run description=""Daemon for Advanced Configuration and Power Interface"" extra_started_commands=""reload"" command=""/usr/sbin/acpid"" command_args=""$ACPID_ARGS"" start_stop_daemon_args=""--quiet"" depend() { need localmount use logger } reload() { ebegin ""Reloading acpid configuration"" start-stop-daemon --exec $command --signal HUP eend $? } " https://github.com/OpenRC/openrc 0 0 https://github.com/atom/language-shellscript OpenRC runscript latte Latte 2008 David Grudl 19 template https://latte.nette.org 0 v3.0.16 468 1 7 23701 true 0 https://github.com/nette/latte template 24 26 270 0 smarty smarty text/x-smarty text.html.smarty markup 2012 2024 2008 59 107 1098 19 false 34 2005 2018 2 8 2008 2025 2352 62 668 6 51129 https://github.com/nette latte php html markdown yaml json xml ini true 1683 0 26 1 false 3 true text Czech Republic "{** * @param string $basePath web base path * @param string $robots tell robots how to index the content of a page (optional) * @param array $flashes flash messages *} {ifset $title}{$title} › {/ifset}Translation report {block #head}{/block} {block #navbar} {include _navbar.latte} {/block}

{include _flash.latte, flash => $flash}

{include #content}

{block #scripts}{/block} " https://github.com/nette/latte 3 0 latte.nette.org Latte https://github.com/textmate/php-smarty.tmbundle 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 Latte neko Neko 2005 Nicolas Cannasse 23 pl https://nekovm.org/ 0 469 3 11 23701 true 0 https://github.com/HaxeFoundation/neko pl 2013 2024 2005 40 106 550 33 false n/Neko.neko 2005 2025 2568 48 197 20 52076 2005 2005 c ocaml ia-32 linux haxe jvm groovy 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. 2008 32 20 59 15110419 Haxe Foundation neko c cmake ocaml bourne-shell markdown yaml powershell json haxe xml toml true 1098 0 35 1 false text http://www.rosettacode.org/wiki/Category:Neko Unknown "$print(""Hello World\n""); " https://riju.codes/neko "$print(""Hello, world!\n""); " "get_params = $loader.loadprim(""mod_neko@get_params"",0); $print(""PARAMS = ""+get_params());" Neko https://github.com/HaxeFoundation/neko $print true true false https://en.wikipedia.org/wiki/Neko_(programming_language) 0 0 nekovm.org dplyr dplyr 2012 Hadley Wickham 13 dataFlow library https://dplyr.tidyverse.org 0 v1.1.4 470 0 7 23700 true 2 scroll tidyverse https://github.com/tidyverse/dplyr/ dataFlow 2012 2024 247 2116 4714 81 false 2012 2025 10039 321 481 65 96349 dplyr is a grammar of data manipulation, providing a consistent set of verbs that help you solve the most common data manipulation challenges: mutate() adds new variables that are functions of existing variables. select() picks variables based on their names. filter() picks cases based on their values. summarise() reduces multiple values down to a single summary. arrange() changes the ordering of the rows. dplyr is a grammar of data manipulation, providing a consistent set of verbs that help you solve the most common data manipulation challenges: mutate() adds new variables that are functions of existing variables. select() picks variables based on their names. filter() picks cases based on their values. summarise() reduces multiple values down to a single summary. arrange() changes the ordering of the rows. dplyr is a grammar of data manipulation, providing a consistent set of verbs that help you solve the most common data manipulation challenges: mutate() adds new variables that are functions of existing variables. select() picks variables based on their names. filter() picks cases based on their values. summarise() reduces multiple values down to a single summary. arrange() changes the ordering of the rows. r markdown cpp svg yaml bourne-shell csv https://www.rstudio.com/wp-content/uploads/2015/02/data-wrangling-cheatsheet.pdf true 11385 0 21 tidyverse 1 false 1 true https://github.com/tidyverse/dplyr/ 0 0 iterm2 Iterm2 1996 14 application https://iterm2.com/ 0 https://iterm2.com/news.html 471 0 28 23697 false 0 https://github.com/gnachman/iTerm2 application 2011 2024 1996 252 1180 14991 38 false 2010 2025 18487 251 4886 282 1056771 git magit sourcetree 84 44296721 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. 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. https://github.com/gnachman/iTerm2 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. objective-c swift python xml restructuredtext css bourne-shell metal c json markdown visual-basic objective-cpp bash html make yaml cpp ruby javascript c-shell protobuf perl dtrace tex z-shell matlab svg true 19224 0 42 false https://iterm2.com/documentation.html https://github.com/gnachman/iTerm2 https://en.wikipedia.org/wiki/ITerm2 0 0 iterm2.com binary-notation Binary notation 1689 Gottfried Leibniz 14 notation 0 472 1 23694 true 1 begriffsschrift https://binary-tools.net/summit.html notation false binary-notation.jpg 1971 "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""." 939 447 219202 4715 0 14 1 https://www.youtube.com/watch?v=wgbV6DLVezo https://writings.stephenwolfram.com/2013/05/dropping-in-on-gottfried-leibniz/ 100101 = [ ( 1 ) × 2^5 ] + [ ( 0 ) × 2^4 ] + [ ( 0 ) × 2^3 ] + [ ( 1 ) × 2^2 ] + [ ( 0 ) × 2^1 ] + [ ( 1 ) × 2^0 ] 100101 = [ 1 × 32 ] + [ 0 × 16 ] + [ 0 × 8 ] + [ 1 × 4 ] + [ 0 × 2 ] + [ 1 × 1 ] 100101 = 37 https://en.wikipedia.org/wiki/Binary_code 1 2 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 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 title|year|author|goodreadsId|rating|ratings|reviews\nBinary Numbers|1977| Clyde Watson, Wendy Watson|1110018|4.17|12|3 ibm-rpg RPG 1959 17 pl 0 473 2 23694 207 true 2 rpg-ii rpg-iii pl false r/RPG.rpgle Report Program Generator 47 1959 cobol pl-i pascal assembly-language algol autocoder java RPG is a high-level programming language (HLL) for business applications. RPG is an IBM proprietary programming language and its later versions are available only on IBM i- or OS/400-based systems. It has a long history, having been developed by IBM in 1959 as the Report Program Generator - a tool to replicate punched card processing on the IBM 1401 then updated to RPG II for the IBM System/3 in the late 1960s, and since evolved into an HLL equivalent to COBOL and PL/I. It remains a popular programming language on the IBM i operating system, which runs on IBM Power i platform hardware. The current version, RPG IV (a.k.a. ILE RPG), provides a modern programming environment. 2004 225 159 549 632241 IBM rpgle 1145 0 18 https://www.ibm.com/docs/en/rdfi/9.6.0?topic=reference-ile-rpg text 7279 **free dsply 'Hello World'; return; ctl-opt main(GetCustInf); dcl-ds ARMSTF1 ext end-ds; dcl-proc GetCustInf; dcl-pi *n extpgm('CUS001'); inCusNo like(arCNum) const; outName like(arName); outAddr1 like(arAdd1); outAddr2 like(arAdd2); outCity like(arCity); outState like(arStte); outZip like(arZip); end-pi; exec sql select arName, arAdd1, arAdd2, arCity, arStte, arZip into :outName, :outAddr1, :outAddr2, :outCity, :outState, :outZip from ARMSTF1 where arCNum = :inCusNo fetch first 1 row only with CS use currently committed; return; end-proc; RPG ' true https://en.wikipedia.org/wiki/IBM_RPG 39 3 https://hopl.info/showlanguage.prx?exp=207 RPG (OS/400) year|publisher|title|authors|isbn13\n1991|Wiley|RPG II and RPG III Structured Programming|Stern, Nancy B. and Stern, Robert A. and Sager, Alden and Cooper, James|9780471521969\n2010|MC Press|Programming in RPG IV|Buck, Jim and Meyers, Bryan|9781583473559\n2002|29th Street Pr|Programming in RPG IV, Third Edition|Meyers, Bryan and Yaeger, Judy|9781583040942\n2000|29th Street Press|Programming in RPG IV: Expanded Skills for Continued Success|Yaeger, Judy|9781882419791\n1981|Science Research Associates|Rpg Ii Programming|Essick and Edward L|9780574213150\n2009|Jones & Bartlett Publishers|Rpg Programming With Xna Game Studio 3.0 (wordware Game And Graphics Library)|Jim Perry|9781598220650\n2002|Mc Press|Java for RPG Programmers|Coulthard, Phil and Farr, George|9781931182065\n2018|Packt Publishing|Building an RPG with Unity 2018: Leverage the power of Unity 2018 to build elements of an RPG., 2nd Edition|Karamian, Vahé|9781788626996\n2014|Apress|Beginning RPG Maker VX Ace|Perez, Darrin|9781484207840\n1999|29th Street Pr|Essentials of Subfile Programming and Advanced Topics in Rpg IV|Levinson, Phil|9781583040515\n1980|Pearson College Div|Rpg And Rpg Ii Programming, Applied Fundamentals: A Job Approach To Learning|William E. Bux|9780137834235\n2015|Apress|Make a 2D RPG in a Weekend: With RPG Maker VX Ace|Perez, Darrin|9781484210406\n2015|Apress|Make a 2D RPG in a Weekend: Second Edition: With RPG Maker MV|Perez, Darrin|9781484217931\n2015|CreateSpace Independent Publishing Platform|RPG Programming success in a day: Beginners guide to fast, easy and efficient learning of RPG programming|Key, Sam|9781515060468\n1996|Mc Pr Llc|Modern Rpg Language: With Structured Programming (4th Edition)|Cozzi, Robert|9780962182501\n2016|Apress|Beginning RPG Maker MV|Perez, Darrin|9781484219676\n2015-09-15T00:00:01Z|MC Press|Programming in ILE RPG|Buck, Jim and Meyers, Bryan|9781583473795\n2016-10-20t00:00:01z|Lets Go Publish!|The As/400 & Ibm I Rpg & Rpgiv Programming Guide: As/400 And Ibm I Rpg & Rpg Iv Concepts, Coding Examples & Exercises (as/400 & Ibm I Application Development) (volume 5)|Kelly, Brian W.|9780998268316\n2006|MC Press|The Modern RPG IV Language|Robert Cozzi|9781583470640\n2016|Packt Publishing|Mastering Unity 2D Game Development - Second Edition: Using Unity 5 to develop a retro RPG|Godbold, Ashley and Jackson, Simon|9781786462336\n1997|Pearson P T R|Rpg IV Programming on the As/400|Myers, Stanley E.|9780134604114\n2014|Apress|Beginning RPG Maker VX Ace|Perez, Darrin|9781484207857\n2005|MC Press|Free-Format RPG IV: How to Bring Your RPG Programs Into the 21st Century|Martin, Jim|9781583470558\n1989|William C Brown Pub|Rpg II and Rpg III Programming|Feingold, Carl and Eulencamp, Howard and Gonoski, Steve|9780697009913\n2007|29th Street Press|Programming in RPG IV, Fourth Edition|Bryan Meyers and Jim Buck|9781583041222\n2000|29th Street Pr|Programming in RPG IV, Second Edition|Yaeger, Judy|9781583040744\n2000|Mc Press|iSeries and AS/400 RPG IV at Work|Pence, Doug and Hawkins, Ron|9781583470237\n1977|W. C. Brown Co. Publishers|RPG II programming: A learning system approach|Lewis, Thomas Edward|9780787631260\n1998|29th Street Pr|Essentials of Subfile Programming and Advanced Topics in Rpg|Levinson, Phil|9781882419647\n1995T|29th Street Pr|Programming in Rpg IV|Judy Yaeger|9781882419241\n1971|John Wiley & Sons|Programming RPG, RPG II|Seeds, Harice L.|9780471771128\n1971|McGraw-Hill|Programming in RPG II; IBM system/3|Murray, Jerome T|9780070440784\n1970|Prentice-Hall|Programming the IBM System/360 Model 20 with RPG|Oberle, Aloyse P|9780137304998\n1984|Wiley|Rpg Ii And Rpg Iii Programming|Nancy B. Stern and Alden Sager and Robert A. Stern|9780471876250\n1986|Mcgraw-hill College|Rpg Ii And Rpg Iii Programming|Dennie Van Tassel|9780075541387\n1986|Mitchell Pub|Rpg Ii And Rpg Iii Programming|Van Tassel and Dennie|9780938188261\n2011|MC Press, LLC|Rpg Tnt|Bob Cozzi|9781583475867\n2012|MC Press, LLC|Rpg Tnt|Bob Cozzi|9781583476796\n1995|Midrange Computing|Ile Rpg For Rpg/400 Programmers: A Detailed Guide To Programming In Ile Rpg|Richard Shaler and Robin Klima|9781883884147 year|title|doi|citations|influentialCitations|authors|paperId\n2015|A software quality model for RPG|10.1109/SANER.2015.7081819|6|0|Gergely Ladányi and Z. Tóth and R. Ferenc and Tibor Keresztesi|9a74b651f36ae8afbb32b3232ee71c9e7dcc8fcf\n2015|Comparison of Static Analysis Tools for Quality Measurement of RPG Programs|10.1007/978-3-319-21413-9_13|3|0|Z. Tóth and László Vidács and R. Ferenc|614d343a4d0c0fd191b462a5b672b3ed9778f262\n2017|Applying and Evaluating Halstead's Complexity Metrics and Maintainability Index for RPG|10.1007/978-3-319-62404-4_43|1|0|Z. Tóth|9acac8b90344190360776d4a9354ce42d83ef4a6 gnuplot Gnuplot 1986 25 pl http://gnuplot.info/ 0 474 3 23693 true 0 pl 2915 3204 2276 0 gnuplot text source.gnuplot programming false 86 2007 2015 6 5 graphics.py 2002 1986 c linux unix svg latex lua maxima octave perl perl-data-language python sagemath julia java ruby ch haskell smalltalk squeak matplotlib gnuplot is a command-line program that can generate two- and three-dimensional plots of functions, data, and data fits. It is frequently used for publication-quality graphics as well as in education. The program runs on all major computers and operating systems (Linux, Unix, Microsoft Windows, macOS, and others). It is a program with a fairly long history, dating back to 1986. Despite its name, this software is not part of the GNU project. 2002 136 193 404 43601 https://sourceforge.net/p/gnuplot/mailman/ gp gnu gnuplot p plot plt plot plt true 901 0 26 https://tio.run/#gnuplot text Gnuplot http://www.rosettacode.org/wiki/Category:Gnuplot gnuplot Various "#!/usr/bin/env gnuplot reset set terminal png set output 'rates100.png' set xlabel ""A2A price"" set ylabel ""Response Rate"" #set xr [0:5] #set yr [0:6] plot 'rates100.dat' pt 7 notitle " Gnuplot https://riju.codes/gnuplot "print ""Hello, world!"" " "set title ""Some Math Functions"" set xrange [-10:10] set yrange [-2:2] set zeroaxis plot (x/4)**2, sin(x), 1/x" print true https://github.com/has2k1/gnuplot_kernel https://en.wikipedia.org/wiki/Gnuplot 3 0 gnuplot.info Gnuplot https://github.com/mattfoster/gnuplot-tmbundle year|publisher|title|authors|isbn13\n2012|Packt Publishing|gnuplot Cookbook|Phillips, Lee|9781849517249\n2009|Manning Publications|Gnuplot in Action: Understanding Data with Graphs|Philipp K. Janert|9781933988399\n2012|Packt Publishing|gnuplot Cookbook|Phillips, Lee|9781849517256 Gnuplot tidyverse tidyverse 2016 Hadley Wickham 15 dataFlow library https://www.tidyverse.org/ 0 v2.0.0 475 0 5 23692 true 1 dplyr https://github.com/tidyverse/tidyverse dataFlow 2016 2024 2016 93 281 1622 11 false 2016 2024 421 41 83 4 3658 2016 The tidyverse is an opinionated collection of R packages designed for data science. All packages share an underlying design philosophy, grammar, and data structures. The tidyverse is an opinionated collection of R packages designed for data science. All packages share an underlying design philosophy, grammar, and data structures. The tidyverse is an opinionated collection of R packages designed for data science. All packages share an underlying design philosophy, grammar, and data structures. markdown r yaml json tex true 2508 0 21 dplyr 1 false 2 true text https://github.com/tidyverse/tidyverse 0 0 tidyverse.org skulpt skulpt 2009 Scott Graham 15 pl http://www.skulpt.org/ 0 1.2.0 476 0 14 23688 true 0 https://github.com/skulpt/skulpt pl 2012 2024 2009 107 895 3322 254 false 2009 2025 5744 140 3221 90 297776 2009 Skulpt is an entirely in-browser implementation of Python. Skulpt is an entirely in-browser implementation of Python. Skulpt is an entirely in-browser implementation of Python. python javascript html json c markdown css bourne-shell ejs xml yaml java restructuredtext bash true 6149 0 29 1 false 1 true text https://github.com/skulpt/skulpt https://github.com/Calysto/skulpt_python 0 0 skulpt.org shen Shen 2011 Mark Tarver 30 pl http://shenlanguage.org/ 0 477 3 3 23688 true 0 https://github.com/Shen-Language/shen-sources pl 14 16 50 0 text source.shen programming 2015 2024 23 39 348 9 false s/Shen.shen 67 2017 2018 3 1 lisp.py 2015 2024 483 10 157 2 30012 2011 https://github.com/Shen-Language shen shen shen markdown svg make true 677 0 35 1 false https://groups.google.com/g/qilang text http://www.rosettacode.org/wiki/Category:Shen United Kingdom "\\ Hello world in Shen (0-) (pr ""hello world"")" "(pr ""Hello World"") " "(load ""grammar.shen"") \* JSON Lexer 1. Read a stream of characters 2. Whitespace characters not in strings should be discarded. 3. Whitespace characters in strings should be preserved 4. Strings can contain escaped double quotes. e.g. ""\"""" *\ (define whitespacep \* e.g. ASCII 32 == #\Space. *\ \* All the others are whitespace characters from an ASCII table. *\ Char -> (member Char [""c#9;"" ""c#10;"" ""c#11;"" ""c#12;"" ""c#13;"" ""c#32;""])) (define replace-whitespace """" -> """" (@s Whitespace Suffix) -> (@s """" (replace-whitespace Suffix)) where (whitespacep Whitespace) (@s Prefix Suffix) -> (@s Prefix (replace-whitespace Suffix))) (define fetch-until-unescaped-doublequote [] -> [] [""\"" ""c#34;"" | Chars] -> [""\"" ""c#34;"" | (fetch-until-unescaped-doublequote Chars)] [""c#34;"" | Chars] -> [] [Char | Chars] -> [Char | (fetch-until-unescaped-doublequote Chars)]) \* (define strip-whitespace-chars *\ \* [] -> [] *\ \* [""c#34;"" | Chars] -> [""c#34;"" | ( *\ \* [WhitespaceChar | Chars] -> (strip-whitespace-chars Chars) where (whitespace? WhitespaceChar) *\ \* [Char | Chars] -> [Char | (strip-whitespace-chars Chars)]) *\ (define tokenise JSONString -> (let CharList (explode JSONString) CharList))" Shen Shen https://github.com/Shen-Language/shen-sources pr """" true true true true true true true 0 0 shenlanguage.org Shen https://github.com/rkoeninger/sublime-shen Shen tcp TCP 1974 Vint Cerf and Bob Kahn 13 protocol 0 478 0 23687 true 1 homa protocol false Transmission Control Protocol 2009 udp ftp http smtp tls linux 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. 2001 3336 1522 3050 30538 16700 0 14 2 https://www.rfc-editor.org/rfc/rfc793 na 5599 https://en.wikipedia.org/wiki/Transmission_Control_Protocol 6 2 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 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 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 jflex JFlex 2003 22 grammarLanguage http://jflex.de/ 0 v1.9.1 479 1 18 23684 true 0 https://github.com/jflex-de/jflex grammarLanguage 38 39 2 0 Lex text source.jflex programming 2015 2024 2003 23 113 579 34 false 5 2015 2017 2 1 2003 2025 2499 28 8186 24 1226454 JFlex is a lexical analyzer generator (also known as scanner generator) for Java, written in Java. JFlex is a lexical analyzer generator (also known as scanner generator) for Java, written in Java. https://github.com/jflex-de/ JFlex is a lexical analyzer generator (also known as scanner generator) for Java, written in Java. flex jflex java starlark markdown perl bourne-shell vtl-lang xml make yaml tex css bash json vim-script lisp yacc bazel actionscript true 1148 0 42 false 1 true text Switzerland and Australia /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Copyright (C) 1998-2015 Gerwin Klein * * All rights reserved. * * * * License: BSD * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* Java 1.2 language lexer specification */ /* Use together with unicode.flex for Unicode preprocesssing */ /* and java12.cup for a Java 1.2 parser */ /* Note that this lexer specification is not tuned for speed. It is in fact quite slow on integer and floating point literals, because the input is read twice and the methods used to parse the numbers are not very fast. For a production quality application (e.g. a Java compiler) this could be optimized */ import java_cup.runtime.*; %% %public %class Scanner %implements sym %unicode %line %column %cup %cupdebug %{ StringBuilder string = new StringBuilder(); private Symbol symbol(int type) { return new JavaSymbol(type, yyline+1, yycolumn+1); } private Symbol symbol(int type, Object value) { return new JavaSymbol(type, yyline+1, yycolumn+1, value); } /** * assumes correct representation of a long value for * specified radix in scanner buffer from start * to end */ private long parseLong(int start, int end, int radix) { long result = 0; long digit; for (int i = start; i < end; i++) { digit = Character.digit(yycharat(i),radix); result*= radix; result+= digit; } return result; } %} /* main character classes */ LineTerminator = \r|\n|\r\n InputCharacter = [^\r\n] WhiteSpace = {LineTerminator} | [ \t\f] /* comments */ Comment = {Tradi https://github.com/jflex-de/jflex /* */ true true false 0 0 jflex.de JFlex https://github.com/jflex-de/jflex.tmbundle.git JFlex veryl Veryl 2022 Naoya Hatta 38 pl https://www.veryl-lang.org/ 0 0.10.0 480 1 9 23684 true 0 https://github.com/veryl-lang/veryl pl 2022 2024 11 20 448 54 false 2022 2025 2873 18 483 76 136696 2024 veryl rust rust json toml javascript yaml markdown typescript make bourne-shell true 528 0 53 1 false 0 true false https://doc.veryl-lang.org/book/ text "// Hello world in Veryl module ModuleA { initial { $display(""Hello, world!""); } }" https://github.com/veryl-lang/veryl https://github.com/veryl-lang/veryl // /* */ $display """" false false true true true true true true true false false true false true false false 0 0 veryl-lang.org hyperscript-lang Hyperscript 2020 16 pl https://hyperscript.org/ 0 0.9.12 481 1 8 23683 true 0 https://github.com/bigskysoftware/_hyperscript pl 2020 2024 2020 33 145 2962 128 false _hyperscript 2020 2025 1794 90 403 10 243437 2020 _hyperscript is a small, open scripting language inspired by hypertalk _hyperscript is a small, open scripting language inspired by hypertalk https://github.com/bigskysoftware _hyperscript is a small, open scripting language inspired by hypertalk javascript markdown html typescript json css python svg true 3489 0 25 hypertalk false 0 true United States "

Do some stuff
" https://github.com/bigskysoftware/_hyperscript 0 0 hyperscript.org ats ATS 2013 Hongwei Xi 33 pl http://www.ats-lang.org/ http://www.ats-lang.org/ 0 482 4 23675 true 0 pl 26 46 217 0 ats2 ocaml source.ats programming false 46 2013 2016 9 7 Applied Type System Postiats 2007 2013 dependent-ml ml ocaml c 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. 2008 71 20 295 19905196 Boston University dats hats sats sats dats cats hats true 576 0 121 1 text postiats http://www.rosettacode.org/wiki/Category:ATS United States "// Hello world in ATS implement main () = begin print (""Hello, world!""); print_newline () end" "(* ****** ****** *) // // HX-2013-11 // // Implementing a variant of // the problem of Dining Philosophers // (* ****** ****** *) // #include ""share/atspre_define.hats"" #include ""share/atspre_staload.hats"" // (* ****** ****** *) staload ""{$LIBATSHWXI}/teaching/mythread/SATS/mythread.sats"" (* ****** ****** *) local // #include ""{$LIBATSHWXI}/teaching/mythread/DATS/mythread.dats"" // in (* in of [local] *) // // HX: it is intentionally left to be empty // end // end of [local] (* ****** ****** *) local // #include ""{$LIBATSHWXI}/teaching/mythread/DATS/mythread_posix.dats"" // in (* in of [local] *) // // HX: it is intentionally left to be empty // end // end of [local] (* ****** ****** *) (* end of [DiningPhil2_thread.dats] *) " https://riju.codes/ats "val _ = print (""Hello, world!\n"") implement main0 () = () " #define BUFLEN 10 var !p_buf with pf_buf = @[byte][BUFLEN](0) // pf_buf = @[byte][BUFLEN](0) @ p_buf[14] 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 https://github.com/githwxi/ATS-Postiats // (* *) true true true true true false https://en.wikipedia.org/wiki/ATS_(programming_language) 1 1 ats-lang.org ATS https://github.com/steinwaywhw/ats-mode-sublimetext year|publisher|title|authors|isbn13\n2012||Ats (programming Language)|Niek Yoan|9786201963160 ATS 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 packagist-pm packagist-pm 2011 Jordi Boggiano 16 packageManager https://packagist.org/ 0 483 0 12 23674 false 0 https://github.com/composer/packagist packageManager 2011 2024 2011 79 477 1726 67 false 12906177931 211636 php 2011 2025 2720 173 390 13 56487 2011 https://github.com/composer php twig yaml json javascript svg html css xml scss markdown jsx true 3332 0 28 1 false The Netherlands and Canada and Germany and Switzerland and Moscow https://twitter.com/packagist https://github.com/composer/packagist 0 0 packagist.org newlisp NewLisp 1991 Lutz Mueller 32 pl lisp http://www.newlisp.org/ 0 10.7.5 484 2 10 23674 true 0 https://github.com/kosh04/newlisp pl 774 812 476 0 newlisp lisp commonlisp text/x-common-lisp source.lisp programming 2014 2024 2008 11 62 94 11 false n/NewLISP.lsp 40 2005 2018 3 6 lisp.py 2008 2019 139 6 269 5 119197 1999 1991 lisp common-lisp scheme pascal c tcl s-expressions xml utf-8 tcp udp linux solaris sqlite smtp ftp opengl 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. 2005 18 48 242 1964813 http://kosh.sdf.org nl lisp lsp lsp lsp nl kif lisp c html bourne-shell make yaml vim-script css markdown xml true 598 0 43 1 false 10 true https://tio.run/#http://www.newlisp.org/newlisp-js http://www.newlisp.org/index.cgi?Documentation text http://www.rosettacode.org/wiki/Category:NewLISP United States newLISP "#!/usr/bin/newlisp (print ""Hello World\n"") (exit) " "#!/usr/bin/env newlisp (constant 'NUM 8) (define (intersects? q1 q2) (or (= (q1 0) (q2 0)) (= (q1 1) (q2 1)) (= (abs (- (q1 0) (q2 0))) (abs (- (q1 1) (q2 1)))))) (define (variant? alist) (set 'logic nil) (cond ((= (length alist) 1) true) ((> (length alist) 1) (while (> (length alist) 1) (set 'q (pop alist -1)) (dolist (el alist) (push (intersects? (list q (inc (length alist))) (list el (+ 1 $idx))) logic -1))) (not (apply or logic))))) (define (fork-by-line alist) (let (res '()) (dolist (i (sequence 1 NUM)) (set 'tmp alist) (push i tmp -1) (setf res (push tmp res -1))) res)) (define (find-variants num) (let (res '()) (cond ((< num 1) (begin (println ""num < 1"") (exit))) ((= num 1) (dolist (i (sequence 1 NUM)) (push (list i) res -1))) ((> num 1) (dolist (v (find-variants (dec num))) (set 'passed (filter variant? (fork-by-line v))) (if (not (empty? passed)) (extend res passed))))) res)) (set 'solutions (find-variants NUM)) (println (length solutions)) ;;(exit)" NewLisp https://twitter.com/newlisp NewLISP https://github.com/kosh04/newlisp print true true true false https://en.wikipedia.org/wiki/NewLISP 0 0 newlisp.org NewLisp https://github.com/textmate/lisp.tmbundle NewLisp dale Dale 2013 tomhrr 21 pl lisp https://github.com/tomhrr/dale/ 0 485 0 9 23673 true 0 https://github.com/tomhrr/dale/ pl 2013 2024 22 48 1024 28 false 2013 2024 1364 15 1404 5 88217 dt diet perl cpp markdown yaml bourne-shell cmake vim-script dockerfile true 1185 0 31 1 false Unknown https://github.com/tomhrr/dale/ true true true true false true true true true true 0 0 java-properties Java Properties 1995 17 dataNotation 0 486 2 23672 true 1 pkl dataNotation 6363 properties properties text/x-properties source.java-properties data false 283 2004 2018 2 21 dot properties java unicode notepad-editor emacs-editor vim ascii eclipse-editor perl xml yaml .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. 2006 205 33 181 4952396 Oracle properties properties 1245 0 19 text United States "# # Licensed under the Apache License, Version 2.0 (the ""License""); you # may not use this file except in compliance with the License. You may # obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an ""AS IS"" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or # implied. See the License for the specific language governing # permissions and limitations under the License. # Dink:net/rptools/maptool/client/sound/dink.mp3 Clink:net/rptools/maptool/client/sound/clink.mp3 " "# You are reading the "".properties"" entry. ! The exclamation mark can also mark text as comments. # The key characters =, and : should be written with # a preceding backslash to ensure that they are properly loaded. # However, there is no need to precede the value characters =, and : by a backslash. website = https://en.wikipedia.org/ language = English # The backslash below tells the application to continue reading # the value onto the next line. message = Welcome to \ Wikipedia! # Add spaces to the key key\ with\ spaces = This is the value that could be looked up with the key ""key with spaces"". # Unicode tab : \u0009 # If you want your property to include a backslash, it should be escaped by another backslash path=c:\\wiki\\templates # However, some editors will handle this automatically" # true true false https://en.wikipedia.org/wiki/.properties 0 0 https://github.com/textmate/java.tmbundle Java Properties cyber Cyber 2022 20 pl https://cyberscript.dev/ 0 487 1 21 23670 true 0 https://github.com/fubark/cyber pl 2022 2024 21 38 1142 32 false 2022 2024 1520 11 547 11 158229 Cyber is a new language for fast, efficient, and concurrent scripting. Cyber is a new language for fast, efficient, and concurrent scripting. Cyber is a new language for fast, efficient, and concurrent scripting. zig c markdown javascript lua yaml python css java json php ruby vim-script cpp xml perl html bourne-shell wasm go rust true 1269 0 41 false import m 'math' worlds = ['World', '世界', 'दुनिया'] worlds.append(m.random()) for worlds each w: print 'Hello, {w}!' func fib(n int) int: coyield if n < 2: return n return fib(n - 1) + fib(n - 2) count = 0 -- Counts iterations. fiber = coinit fib(30) while fiber.status() != #done: res = coresume fiber count += 1 print '{res} {count}' https://github.com/fubark/cyber true true true true true true true true true true 0 0 xtend Xtend 2011 Sven Efftinge and Sebastian Zarnekow 28 pl http://www.xtend-lang.org 3 488 2 23669 true 3 cloc pygments xtext pl 623 834 1438 0 text source.xtend programming false 4 2014 2014 2 2 jvm.py 2011 2011 java scala groovy smalltalk eclipse-editor Xtend is a general-purpose high-level programming language for the Java Virtual Machine. Syntactically and semantically Xtend has its roots in the Java programming language but focuses on a more concise syntax and some additional functionality such as type inference, extension methods, and operator overloading. Being primarily an object-oriented language, it also integrates features known from functional programming, e.g. lambda expressions. Xtend is statically typed and uses Java's type system without modifications. It is compiled to Java code and thereby seamlessly integrates with all existing Java libraries. The language Xtend and its IDE is developed as a project at Eclipse.org and participates in the annual Eclipse release train. The code is open source under the Eclipse Public License. Yet, the language can be compiled and run independent of the Eclipse platform. 2012 20 8 39 36462606 xtend xtend true 321 0 33 jvm 2 xtend text /******************************************************************************* * Copyright (c) 2012 itemis AG (http://www.itemis.eu) and others. * All rights reserved. This program and the accompanying materials * are made available under the terms of the Eclipse Public License v1.0 * which accompanies this distribution, and is available at * http://www.eclipse.org/legal/epl-v10.html * * Author - Sven Efftinge *******************************************************************************/ package example6 import org.junit.Test import static org.junit.Assert.* import java.io.FileReader import java.util.Set import static extension com.google.common.io.CharStreams.* class Movies { /** * @return the total number of action movies */ @Test def void numberOfActionMovies() { assertEquals(828, movies.filter[categories.contains('Action')].size) } /** * @return the year the best rated movie of 80ies (1980-1989) was released. */ @Test def void yearOfBestMovieFrom80ies() { assertEquals(1989, movies.filter[(1980..1989).contains(year)].sortBy[rating].last.year) } /** * @return the sum of the number of votes of the two top rated movies. */ @Test def void sumOfVotesOfTop2() { val long movies = movies.sortBy[-rating].take(2).map[numberOfVotes].reduce[a, b| a + b] assertEquals(47_229, movies) } val movies = new FileReader('data.csv').readLines.map[ line | val segments = line.split(' ').iterator return new Movie( segments.next, Integer::parseInt(segments.next), Double::parseDouble(segments.next), Long::parseLong(segments.next), segments.toSet ) ] } @Data class Movie { String title int year double rating long numberOfVotes Set categories } Xtend https://twitter.com/xtendlang def sayHello(String name) ''' Hello «name» ! ''' /* */ true true true true true false true true https://en.wikipedia.org/wiki/Xtend 3 0 Xtend xtend-lang.org Xtend https://github.com/staltz/SublimeXtend year|publisher|title|authors|isbn13\n2013|Packt Publishing|Implementing Domain-Specific Languages with Xtext and Xtend|Bettini, Lorenzo|9781782160311\n2013|Packt Publishing|Implementing Domain-Specific Languages with Xtext and Xtend|Bettini, Lorenzo|9781782160304\n31-08-2016|Packt Publishing|Implementing Domain-Specific Languages with Xtext and Xtend|Lorenzo Bettini|9781786463272 Xtend livescript LiveScript 2011 Jeremy Ashkenas and Satoshi Murakami and George Zahariev 31 pl 0 489 3 23668 true 1 civet pl 1780 2273 Slakefile 1905 0 live-script or ls livescript livescript text/x-livescript source.livescript programming false l/LiveScript.ls 263 2010 2017 1 40 javascript.py 2011 javascript haskell coffeescript f-sharp elixir 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. 2001 35 27 53 17731 https://github.com/gkz/LiveScript/issues ls _ls ls ls ls true 395 0 38 3 text http://www.rosettacode.org/wiki/Category:LiveScript United States "console.log ""Hello World"" " "a = -> 1 const b = --> 2 var c = ~> 3 d = ~~> 10_000_000km * 500ms e = (a) -> (b) ~> (c) --> (d, e) ~~> 5 dashes-identifiers = -> a - a b -- c 1-1 1- -1 a- a a -a underscores_i$d = -> /regexp1/ and //regexp2//g 'strings' and ""strings"" and \strings ([2 til 10] or [1 to 50]) |> map (* 2) |> filter (> 5) |> fold (+) class Class extends Anc-est-or (args) -> copy = (from, to, callback) --> error, data <- read file return callback error if error? error <~ write file, data return callback error if error? callback() -> ~> ~~> --> # Comment /* Comment */ " LiveScript https://riju.codes/livescript "console.log ""Hello, world!"" " LiveScript # /* */ console.log """" true true true true true true true true https://github.com/p2edwards/jp-livescript https://en.wikipedia.org/wiki/LiveScript_(programming_language) 0 0 LiveScript https://github.com/paulmillr/LiveScript.tmbundle LiveScript capybara capybara 2009 Jonas Nicklas and Kevin Fitzpatrick 14 library http://teamcapybara.github.io/capybara/ 0 3.40.0 490 0 7 23667 true 0 https://github.com/teamcapybara/capybara library 2009 2024 2009 221 1446 10000 29 false 2009 2024 4772 427 345 14 40710 teamcapybara ruby erb javascript yaml markdown gherkin csv true 14767 0 22 2 false 3 true text United States https://github.com/teamcapybara/capybara 0 0 xl-lang XL 2000 Christophe de Dinechin 25 pl http://xlr.sourceforge.net/ 0 v1.70.0 491 3 13 23665 true 1 tao3d https://github.com/c3d/xl pl 2012 2024 2003 17 15 269 46 false x/XL.xl 2003 2022 5437 23 1369 24 163783 2000 ada basic c fortran java lisp prolog visual-basic smalltalk forth "XL (""eXtensible Language"") is the first and so far the only computer programming language designed to support concept programming.XL features programmer-reconfigurable syntax and semantics. Compiler plug-ins can be used to add new features to the language. A base set of plug-ins implements a relatively standard imperative language. Programmers can write their own plug-ins to implement application-specific notations, such as symbolic differentiation, which can then be used as readily as built-in language features." 2005 26 36 106 2855241 xl css cpp make yaml bash markdown lisp awk html asciidoc python ini javascript true 489 0 42 1 false 1 true https://fosdem.org/2020/schedule/event/xllang/ "0! is 1 N! is N * (N-1)! for I in 1..5 loop print ""The factorial of "", I, "" is "", I!" "// XL programming language: http://xlr.sourceforge.net writeln ""Hello World"" " if true then TrueBody else FalseBody -> TrueBody if false then TrueBody else FalseBody -> FalseBody XL https://github.com/c3d/xl writeln """" True False true true true true true https://en.wikipedia.org/wiki/XL_(programming_language) 3 0 xlr.sourceforge.net year|publisher|title|authors|isbn13\n1983|Phoenix Pub. Associates|The Atari 600 XL program book|Goode, Peter|9780946576111\n2010||Xl (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786130899875\n2010||Xl (xml Programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786131028571 wing Wing 2022 Elad Ben-Israel 15 pl https://winglang.io 0 https://docs.winglang.io/blog v0.74.13 492 1 22 23664 true 0 https://github.com/winglang/wing pl 2022 2024 163 191 4806 861 false 2022 2025 5302 119 3240 164 483810 https://www.winglang.io/play/ markdown typescript json rust yaml javascript toml html css python diff svg jsx bourne-shell scheme dockerfile c go make hcl swift cpp true 5500 0 37 1 false 0 true https://docs.winglang.io "bring cloud; let queue = new cloud.Queue(timeout: 2m); let bucket = new cloud.Bucket(); let counter = new cloud.Counter(initial: 100); queue.on_message(inflight (body: str): str => { let next = counter.inc(); let key = ""myfile-${next}.txt""; bucket.put(key, body); });" https://t.winglang.io/discord https://github.com/winglang/wing 0 0 please-build Please Build 2016 16 pl https://please.build 0 v17.8.7 493 1 18 23662 true 0 https://github.com/thought-machine/please pl 2016 2024 2016 30 205 2436 78 false 2016 2025 4451 150 1079 29 50739 Language for the please.build cross-language build system. The Please build language is a full programming language. Language for the please.build cross-language build system. The Please build language is a full programming language. Thought Machine Group Language for the please.build cross-language build system. The Please build language is a full programming language. go bazel bourne-shell markdown html python xml yaml dockerfile json css c javascript diff cpp svg lisp protobuf true 3203 0 36 make python false 17 true United Kingdom https://please.build/language.html "# Taken from //src/core/BUILD in the Please repo go_library( name = ""core"", srcs = glob([""*.go""], exclude=[""*_test.go"", ""version.go""]) + ["":version""], visibility = [""PUBLIC""], deps = [ ""//third_party/go:gcfg"", ""//third_party/go:logging"", ""//third_party/go:queue"", ] )" https://github.com/thought-machine/please 0 0 ftp FTP 1971 13 protocol 0 494 0 23661 true 1 mosaic protocol false File Transfer Protocol 1971 http smtp tls tcp udp unix linux ascii 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. 2002 2685 1280 2802 53289 MIT 13916 0 13 https://www.rfc-editor.org/rfc/rfc959 na 4060 United States https://reddit.com/r/ftp https://en.wikipedia.org/wiki/File_Transfer_Protocol 0 0 f-prime F Prime 2017 Timothy Canham 14 library https://nasa.github.io/fprime/ 0 v3.4.3 495 0 17 23660 true 0 https://github.com/nasa/fprime library 2017 2024 2017 261 1286 9984 226 false F' 2017 2025 5858 235 3117 433 248536 F' - A flight software and embedded systems framework F' - A flight software and embedded systems framework https://github.com/nasa/ F' - A flight software and embedded systems framework cpp cmake markdown xml python yaml json bash ini bourne-shell restructuredtext c html plantuml xslt svg csv true 14079 0 31 1 false 3 true United States https://github.com/nasa/fprime 0 0 lfortran LFortran 2018 Ondrej Certik 18 pl compiler https://lfortran.org/ 0 https://lfortran.org/blog/ 496 1 21 23658 true 0 https://github.com/lfortran/lfortran pl 2019 2025 22 193 1050 1886 false 2017 2025 19896 142 6005 51 700322 https://dev.lfortran.org/ LFortran is a modern open-source (BSD licensed) interactive Fortran compiler built on top of LLVM. It can execute user's code interactively to allow exploratory work (much like Python, MATLAB or Julia) as well as compile to binaries with the goal to run user's code on modern architectures such as multi-core CPUs and GPUs. LFortran is a modern open-source (BSD licensed) interactive Fortran compiler built on top of LLVM. It can execute user's code interactively to allow exploratory work (much like Python, MATLAB or Julia) as well as compile to binaries with the goal to run user's code on modern architectures such as multi-core CPUs and GPUs. LFortran is a modern open-source (BSD licensed) interactive Fortran compiler built on top of LLVM. It can execute user's code interactively to allow exploratory work (much like Python, MATLAB or Julia) as well as compile to binaries with the goal to run user's code on modern architectures such as multi-core CPUs and GPUs. fortran-90 json markdown cpp fortran-77 python cmake bourne-shell yaml c jupyter-notebook toml reason css nix bash diff svg dockerfile javascript llvmir true 1773 0 40 fortran 1 false https://docs.lfortran.org/ https://groups.io/g/lfortran program expr2 implicit none integer :: x x = (2+3)*5 print *, x end program https://fortran-lang.discourse.group/ https://twitter.com/lfortranorg https://github.com/lfortran/lfortran 0 0 curl Curl 1998 Steve Ward Daniel Stenberg 20 pl http://www.curl.com 0 497 1 23653 8042 true 3 hurl hurl hurl pl false 1997 1998 linux html javascript lisp java csharp css groovy "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." 2002 110 102 197 42537 Curl, Inc && Sumisho Computer Systems Corp && SCSK Corporation https://cheatsheets.zip/curl 571 0 22 1 false text United States {poem || wraps entire poem {stanza || first verse here in any language } {stanza || another verse here in any language } } true https://en.wikipedia.org/wiki/Curl_(programming_language) 2 0 https://hopl.info/showlanguage.prx?exp=8042 Curl curl.com 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 fancy Fancy 2010 32 pl http://www.fancy-lang.org/ 0 v0.10.0 498 1 11 23646 true 0 https://github.com/bakkdoor/fancy pl 108 113 Fakefile 27 0 text source.fancy programming 2010 2024 2010 14 22 262 5 false f/Fancy.fy 37 2010 2017 6 ruby.py 2010 2014 2993 17 332 9 32865 2010 https://github.com/bakkdoor/fancy/issues fy fancypack fy fy fancypack ruby javascript bourne-shell yacc lex markdown css c html lisp yaml true 567 0 45 false 0 true text 6823 http://www.rosettacode.org/wiki/Category:Fancy Germany """Hello World"" println " Fancy Fancy https://github.com/bakkdoor/fancy println """" true true true true true false true https://en.wikipedia.org/wiki/Fancy_(programming_language) 2 0 fancy-lang.org Fancy https://github.com/fancy-lang/fancy-tmbundle 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 Fancy xtext Xtext 2006 17 grammarLanguage https://www.eclipse.org/Xtext/ 0 v2.34.0 499 1 17 23642 true 0 https://github.com/eclipse/xtext grammarLanguage 2011 2024 2008 47 317 758 507 false 2008 2025 38192 202 19789 174 1100113 2019 Xtext is an open-source software framework for developing programming languages and domain-specific languages (DSLs). Unlike standard parser generators, Xtext generates not only a parser, but also a class model for the abstract syntax tree, as well as providing a fully featured, customizable Eclipse-based IDE.Xtext is being developed in the Eclipse Project as part of the Eclipse Modeling Framework Project and is licensed under the Eclipse Public License. 31 41 32232589 xtext java xml xtend ini html javascript gradle bourne-shell css markdown json typescript yaml dockerfile csv objective-cpp svg true 2088 0 35 false 2 true https://dl.acm.org/citation.cfm?id=1869625 "grammar org.eclipse.xtext.common.Terminals hidden(WS, ML_COMMENT, SL_COMMENT) import ""http://www.eclipse.org/emf/2002/Ecore"" as ecore terminal ID: '^'?('a'..'z'|'A'..'Z'|'_')('a'..'z'|'A'..'Z'|'_'|'0'..'9')*; terminal INT returns ecore::EInt: ('0'..'9')+; terminal STRING: '""' ( '\\'('b'|'t'|'n'|'f'|'r'|'u'|'""'|""'""|'\\') | !('\\'|'""') )* '""' | ""'"" ( '\\'('b'|'t'|'n'|'f'|'r'|'u'|'""'|""'""|'\\') | !('\\'|""'"") )* ""'""; terminal ML_COMMENT: '/*' -> '*/'; terminal SL_COMMENT: '//' !('\n'|'\r')* ('\r'? '\n')?; terminal WS: (' '|'\t'|'\r'|'\n')+; terminal ANY_OTHER: .;" https://twitter.com/xtext https://github.com/eclipse/xtext true true https://en.wikipedia.org/wiki/Xtext 3 0 year|publisher|title|authors|isbn13\n2013|Packt Publishing|Implementing Domain-Specific Languages with Xtext and Xtend|Bettini, Lorenzo|9781782160311\n2013|Packt Publishing|Implementing Domain-Specific Languages with Xtext and Xtend|Bettini, Lorenzo|9781782160304\n31-08-2016|Packt Publishing|Implementing Domain-Specific Languages with Xtext and Xtend|Lorenzo Bettini|9781786463272 lfe LFE 2008 Robert Virding 27 pl lisp 1 https://blog.lfe.io/ http://docs.lfe.io/v0.7/classic-docs/release-notes.html 500 2 23642 true 1 cloc pl 14 15 51 0 lisp commonlisp text/x-common-lisp source.lisp programming false 40 2005 2018 4 6 Lisp Flavored Erlang 2008 erlang common-lisp scheme elixir hy lisp 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. 2014 37 33 54 41671035 https://github.com/lfe lfe lfe hrl true 405 0 https://exercism.org/tracks/lfe 29 1 lfe http://docs.lfe.io/current/index.html text http://www.rosettacode.org/wiki/Category:LFE United States https://lfe.io/ ";; Copyright (c) 2013 Duncan McGreggor ;; ;; Licensed under the Apache License, Version 2.0 (the ""License""); ;; you may not use this file except in compliance with the License. ;; You may obtain a copy of the License at ;; ;; http://www.apache.org/licenses/LICENSE-2.0 ;; ;; Unless required by applicable law or agreed to in writing, software ;; distributed under the License is distributed on an ""AS IS"" BASIS, ;; WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. ;; See the License for the specific language governing permissions and ;; limitations under the License. ;; File : church.lfe ;; Author : Duncan McGreggor ;; Purpose : Demonstrating church numerals from the lambda calculus ;; The code below was used to create the section of the user guide here: ;; http://lfe.github.io/user-guide/recursion/5.html ;; ;; Here is some example usage: ;; ;; > (slurp '""church.lfe"") ;; #(ok church) ;; > (zero) ;; #Fun ;; > (church->int1 (zero)) ;; 0 ;; > (church->int1 (three)) ;; 3 ;; > (church->int1 (five)) ;; 5 ;; > (church->int2 #'five/0) ;; 5 ;; > (church->int2 (lambda () (get-church 25))) ;; 25 (defmodule church (export all)) (defun zero () (lambda (s) (lambda (x) x))) (defun one () (lambda (s) (lambda (x) (funcall s x)))) (defun two () (lambda (s) (lambda (x) (funcall s (funcall s x))))) (defun three () (lambda (s) (lambda (x) (funcall s (funcall s (funcall s x)))))) (defun four () (lambda (s) (lambda (x) (funcall s (funcall s (funcall s (funcall s x))))))) (defun five () (get-church 5)) (defun int-successor (n) (+ n 1)) (defun church->int1 (church-numeral) "" Converts a called church numeral to an integer, e.g.: > (church->int1 (five)) "" (funcall (funcall church-numeral #'int-successor/1) 0)) (defun church->int2 (church-numeral) "" Converts a non-called church numeral to an integer, e.g.: > (church->int2 #'five/0) "" (funcall (funcall (funcall church-numeral) #'int-successor/1) 0)) (defun church-successor (church-numeral) (lambda (s) (lambda (x) (funcall s (funcall (funcall church-numeral s) x))))) (defun get-church (church-numeral count limit) (cond ((== count limit) church-numeral) ((/= count limit) (get-church (church-successor church-numeral) (+ 1 count) limit)))) (defun get-church (integer) (get-church (zero) 0 integer)) " "(defun parse-args (flag) ""Given one or more command-line arguments, extract the passed values. For example, if the following was passed via the command line: $ erl -my-flag my-value-1 -my-flag my-value-2 One could then extract it in an LFE program by calling this function: (let ((args (parse-args 'my-flag))) ... ) In this example, the value assigned to the arg variable would be a list containing the values my-value-1 and my-value-2."" (let ((`#(ok ,data) (init:get_argument flag))) (lists:merge data))) (defun get-pages () ""With no argument, assume 'url parameter was passed via command line."" (let ((urls (parse-args 'url))) (get-pages urls))) (defun get-pages (urls) ""Start inets and make (potentially many) HTTP requests."" (inets:start) (plists:map (lambda (x) (get-page x)) urls)) (defun get-page (url) ""Make a single HTTP request."" (let* ((method 'get) (headers '()) (request-data `#(,url ,headers)) (http-options ()) (request-options '(#(sync false)))) (httpc:request method request-data http-options request-options) (receive (`#(http #(,request-id #(error ,reason))) (io:format ""Error: ~p~n"" `(,reason))) (`#(http #(,request-id ,result)) (io:format ""Result: ~p~n"" `(,result))))))" ; true true false https://en.wikipedia.org/wiki/LFE_(programming_language) 0 0 LFE https://github.com/textmate/lisp.tmbundle LFE lfe developer clips CLIPS 1985 28 pl http://www.clipsrules.net/ 0 501 4 23637 1759 true 0 pl 901 991 1638 0 text source.clips programming false c/CLIPS.clips 30 2013 2016 2 3 C Language Integrated Production System 2016 1985 ops5 c lisp java isbn "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." 2003 86 39 274 418603 NASA clp clips 651 0 30 https://tio.run/#clips https://www.clipsrules.net/Documentation.html text 2427 http://www.rosettacode.org/wiki/Category:CLIPS United States (deftemplate car_problem (slot name) (slot status)) (deffacts trouble_shooting (car_problem (name ignition_key) (status on)) (car_problem (name engine) (status wont_start)) (car_problem (name headlights) (status work))) (defrule rule1 (car_problem (name ignition_key) (status on)) (car_problem (name engine) (status wont_start)) => (assert (car_problem (name starter) (status faulty)))) "(defrule hw (f ?x) => (printout t ?x crlf)) (assert (f ""Hello World"")) (run) " ;;; http://www.angusj.com/sudoku/hints ;;; http://www.scanraid.com/BasicStrategies.htm ;;; http://www.sudokuoftheday.com/pages/techniques-overview ;;; http://www.sudokuonline.us/sudoku_solving_techniques ;;; http://www.sadmansoftware.com/sudoku/techniques.htm ;;; http://www.krazydad.com/blog/2005/09/29/an-index-of-sudoku-strategies/ ;;; ####################### ;;; DEFTEMPLATES & DEFFACTS ;;; ####################### (deftemplate possible (slot row) (slot column) (slot value) (slot group) (slot id)) (deftemplate impossible (slot id) (slot value) (slot priority) (slot reason)) (deftemplate technique-employed (slot reason) (slot priority)) (deftemplate technique (slot name) (slot priority)) (deffacts startup (phase grid-values)) (deftemplate size-value (slot size) (slot value)) (deffacts values (size-value (size 1) (value 1)) (size-value (size 2) (value 2)) (size-value (size 2) (value 3)) (size-value (size 2) (value 4)) (size-value (size 3) (value 5)) (size-value (size 3) (value 6)) (size-value (size 3) (value 7)) (size-value (size 3) (value 8)) (size-value (size 3) (value 9)) (size-value (size 4) (value 10)) (size-value (size 4) (value 11)) (size-value (size 4) (value 12)) (size-value (size 4) (value 13)) (size-value (size 4) (value 14)) (size-value (size 4) (value 15)) (size-value (size 4) (value 16)) (size-value (size 5) (value 17)) (size-value (size 5) (value 18)) (size-value (size 5) (value 19)) (size-value (size 5) (value 20)) (size-value (size 5) (value 21)) (size-value (size 5) (value 22)) (size-value (size 5) (value 23)) (size-value (size 5) (value 24)) (size-value (size 5) (value 25))) ;;; ########### ;;; SETUP RULES ;;; ########### ;;; *********** ;;; stress-test ;;; *********** (defrule stress-test (declare (salience 10)) (phase match) (stress-test) (priority ?last) (not (priority ?p&:(> ?p ?last))) (technique (priority ?next&:(> ?next ?last))) (not (technique (priority ?p&:(> ?p ?last)&:(< ?p ?next)))) => (assert (priority ?next))) ;;; ***************** ;;; enable-techniques ;;; ***************** (defrule enable-techniques (declare (salience 10)) (phase match) (size ?) (not (possible (value any))) => (assert (priority 1))) ;;; ********** ;;; expand-any ;;; ********** (defrule expand-any (declare (salience 10)) (phase expand-any) ?f <- (possible (row ?r) (column ?c) (value any) (group ?g) (id ?id)) (not (possible (value any) (id ?id2&:(< ?id2 ?id)))) (size ?s) (size-value (size ?as&:(<= ?as ?s)) (value ?v)) (not (possible (row ?r) (column ?c) (value ?v))) (not (and (size-value (value ?v2&:(< ?v2 ?v))) (not (possible (row ?r) (column ?c) (value ?v2))))) => (assert (possible (row ?r) (column ?c) (value ?v) (group ?g) (id ?id)))) ;;; ***************** ;;; position-expanded ;;; ***************** (defrule position-expanded (declare (salience 10)) (phase expand-any) ?f <- (possible (row ?r) (column ?c) (value any) (group ?g) (id ?id)) (size ?s) (not (and (size-value (size ?as&:(<= ?as ?s)) (value ?v)) (not (possible (row ?r) (column ?c) (value ?v))))) => (retract ?f)) ;;; ########### ;;; PHASE RULES ;;; ########### ;;; *************** ;;; expand-any-done ;;; *************** (defrule expand-any-done (declare (salience 10)) ?f <- (phase expand-any) (not (possible (value any))) => (retract ?f) (assert (phase initial-output)) (assert (print-position 1 1))) ;;; *********** ;;; begin-match ;;; *********** (defrule begin-match (declare (salience -20)) ?f <- (phase initial-output) => (retract ?f) (assert (phase match))) ;;; ***************** ;;; begin-elimination ;;; ***************** (defrule begin-elimination (declare (salience -20)) ?f <- (phase match) (not (not (impossible))) => (retract ?f) (assert (phase elimination))) ;;; ************* ;;; next-priority ;;; ************* (defrule next-priority (declare (salience -20)) (phase match) (not (impossible)) (priority ?last) (not (priority ?p&:(> ?p ?last))) (technique (priority ?next&:(> ?next ?last))) (not (technique (priority ?p&:(> ?p ?last)&:(< ?p ?next)))) => (assert (priority ?next))) ;;; ************ ;;; begin-output ;;; ************ (defrule begin-output (declare (salience -20)) ?f <- (phase match) (not (impossible)) (priority ?last) (not (priority ?p&:(> ?p ?last))) (not (technique (priority ?next&:(> ?next ?last)))) => (retract ?f) (assert (phase final-output)) (assert (print-position 1 1))) (deftemplate car_problem (slot name) (slot status)) (deffacts trouble_shooting (car_problem (name ignition_key) (status on)) (car_problem (name engine) (status wont_start)) (car_problem (name headlights) (status work))) (defrule rule1 (car_problem (name ignition_key) (status on)) (car_problem (name engine) (status wont_start)) => (assert (car_problem (name starter) (status faulty)))) CLIPS ; """" true true false true https://en.wikipedia.org/wiki/CLIPS 0 3 https://hopl.info/showlanguage.prx?exp=1759 clipsrules.net CLIPS https://github.com/psicomante/CLIPS-sublime CLIPS 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 conan-pm Conan 2015 14 packageManager https://conan.io/ 0 2.3.1 502 0 8 23635 false 0 https://github.com/conan-io/conan packageManager 2015 2024 2015 136 957 8031 1368 false c cpp 2015 2025 9049 480 1085 35 160294 2015 Conan, the C / C++ Package Manager for Developers Conan, the C / C++ Package Manager for Developers https://github.com/conan-io Conan, the C / C++ Package Manager for Developers python markdown yaml svg xml dockerfile toml ini true 11384 0 22 false 2 true Spain https://github.com/conan-io/conan 0 0 conan.io pkl Pkl 2024 14 pl https://pkl-lang.org 0 https://pkl-lang.org/blog 503 1 15 23634 true 0 https://github.com/apple/pkl pl 2024 2025 56 284 10459 145 false 2016 2025 456 65 3182 7 138273 A configuration as code language with rich validation and tooling. A configuration as code language with rich validation and tooling. Apple A configuration as code language with rich validation and tooling. pkl java kotlin html asciidoc gradle javascript json yaml xml bourne-shell markdown css toml svg dtd yaml json plist java-properties true 11378 0 34 false "name = ""Swallow"" job { title = ""Sr. Nest Maker"" company = ""Nests R Us"" yearsOfExperience = 2 }" https://github.com/apple/pkl 0 0 quickjs QuickJS 2019 Fabrice Bellard 14 vm https://bellard.org/quickjs/ 0 504 0 6 23631 false 0 https://github.com/bellard/quickjs vm 2020 2024 152 864 8270 104 false 2020 2024 177 17 74 5 102239 http://numcalc.com/ QuickJS is a small and embeddable Javascript engine. It supports the ES2023 specification including modules, asynchronous generators, proxies and BigInt. It optionally supports mathematical extensions such as big decimal floating point numbers (BigDecimal), big binary floating point numbers (BigFloat) and operator overloading. QuickJS is a small and embeddable Javascript engine. It supports the ES2023 specification including modules, asynchronous generators, proxies and BigInt. It optionally supports mathematical extensions such as big decimal floating point numbers (BigDecimal), big binary floating point numbers (BigFloat) and operator overloading. QuickJS is a small and embeddable Javascript engine. It supports the ES2023 specification including modules, asynchronous generators, proxies and BigInt. It optionally supports mathematical extensions such as big decimal floating point numbers (BigDecimal), big binary floating point numbers (BigFloat) and operator overloading. javascript c bourne-shell make yaml diff true 10881 0 21 javascript 1 false https://bellard.org/quickjs/quickjs.html https://www.freelists.org/list/quickjs-devel https://github.com/bellard/quickjs 0 0 io Io 2002 Steve Dekorte 39 pl https://iolanguage.org/ https://iolanguage.org/ 0 505 3 23625 7112 true 0 pl 594 624 2062 0 io io source.io programming false i/Io.Io 33 2005 2014 6 iolang.py 2009 2002 smalltalk newtonscript self lua lisp python ioke 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. 2003 48 59 184 323340 https://github.com/IoLanguage io Io io io 461 0 42 1 false https://tio.run/#io https://iolanguage.org/guide/guide.html text 9022 http://www.rosettacode.org/wiki/Category:Io United States and United Kingdom and Belarus https://news.ycombinator.com/item?id=8867575 """Hello World\n"" print " Io https://riju.codes/io """Hello, world!"" println " https://twitter.com/iolanguage factorial := method(n, if(n == 0, return 1) res := 1 Range 1 to(n) foreach(i, res = res * i) ) Io https://github.com/IoLanguage/io // print := true true true true true true true true false https://en.wikipedia.org/wiki/Io_(programming_language) 2 2 https://hopl.info/showlanguage.prx?exp=7112 iolanguage.org Io https://github.com/textmate/io.tmbundle 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 Io 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 sourcepawn SourcePawn 2014 24 pl 0 506 1 14 23621 true 0 https://github.com/alliedmodders/sourcepawn pl 6524 9023 7547 0 sourcemod text source.sourcepawn programming 2014 2024 2014 36 65 358 84 false 56 2013 2016 6 6 pawn.py 2014 2024 1568 45 1327 8 173165 AlliedModders LLC sp inc sp cpp pascal php csharp c python markdown yaml xml ini bourne-shell sql css javascript true 799 0 40 false text United States "/* Fixed point arithmetic * * (c) Copyright 1998-2011, ITB CompuPhase * This file is provided as is (no warranties). */ #pragma library Fixed const fround_method: { fround_round = 0, fround_floor, fround_ceil, fround_tozero, fround_unbiased } native Fixed:fixed(value); native Fixed:strfixed(const string[]); native Fixed:fmul(Fixed:oper1, Fixed:oper2); native Fixed:fdiv(Fixed:dividend, Fixed:divisor); native Fixed:ffract(Fixed:value); native fround(Fixed:value, fround_method:method=fround_round); native Fixed:fpower(Fixed:value, exponent); native Fixed:fsqroot(Fixed:value); native Fixed:fabs(Fixed:value); #pragma rational Fixed(3) /* user defined operators */ native Fixed:operator*(Fixed:oper1, Fixed:oper2) = fmul; native Fixed:operator/(Fixed:oper1, Fixed:oper2) = fdiv; native Fixed:operator=(oper) = fixed; stock Fixed:operator++(Fixed:oper) return oper + fixed(1); stock Fixed:operator--(Fixed:oper) return oper - fixed(1); stock Fixed:operator*(Fixed:oper1, oper2) return Fixed: (_:oper1 * oper2); /* ""*"" is commutative */ stock Fixed:operator/(Fixed:oper1, oper2) return oper1 / fixed(oper2); stock Fixed:operator/(oper1, Fixed:oper2) return fdiv(fixed(oper1), oper2); stock Fixed:operator+(Fixed:oper1, oper2) return oper1 + fixed(oper2); /* ""+"" is commutative */ stock Fixed:operator-(Fixed:oper1, oper2) return oper1 - fixed(oper2); stock Fixed:operator-(oper1, Fixed:oper2) return fixed(oper1) - oper2; stock bool:operator>(Fixed:oper1, oper2) return oper1 > fixed(oper2); stock bool:operator>(oper1, Fixed:oper2) return fixed(oper1) > oper2; stock bool:operator>=(Fixed:oper1, oper2) return oper1 >= fixed(oper2); stock bool:operator>=(oper1, Fixed:oper2) return fixed(oper1) >= oper2; stock bool:operator<(Fixed:oper1, oper2) return oper1 < fixed(oper2); stock bool:operator<(oper1, Fixed:oper2) return fixed(oper1) < oper2; stock bool:operator<=(Fixed:oper1, oper2) return oper1 <= fixed(oper2); stock bool:operator<=(oper1, Fixed:oper2) return fixed(oper1) <= oper2; stock bool:operator==(Fixed:oper1, oper2) /* ""=="" is commutative */ return oper1 == fixed(oper2); stock bool:operator!=(Fixed:oper1, oper2) /* ""!="" is commutative */ return oper1 != fixed(oper2); /* forbidden operations */ forward operator%(Fixed:oper1, Fixed:oper2); forward operator%(Fixed:oper1, oper2); forward operator%(oper1, Fixed:oper2);" SourcePawn https://github.com/alliedmodders/sourcepawn /* */ true true true true true true true false 0 0 SourcePawn https://github.com/github-linguist/sublime-sourcepawn SourcePawn qalb Qalb 2012 Ramsey Nasser 20 pl http://qlb-repl.herokuapp.com/ 0 507 2 6 23618 true 0 https://github.com/nasser/--- pl 2012 2024 2012 51 85 755 5 false Arabic q/Qalb 2012 2013 114 3 36 1 9095 2012 scheme lisp قلب (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. 2013 20 5 35 38441485 https://github.com/nasser/---/issues javascript css html markdown json ruby true 1135 0 27 1 false text United States "(قول ""Hello World"") " https://riju.codes/qalb "(قول ""مرحبا يا عالم"") " Qalb https://github.com/nasser/--- """" true https://en.wikipedia.org/wiki/Qalb_(programming_language) 0 0 qlb-repl.herokuapp.com dat-protocol dat-protocol 2013 Max Ogden 14 protocol https://dat.foundation/ 0 14.0.3 508 0 6 23617 true 0 https://github.com/datproject/dat protocol 2013 2024 2013 311 450 8236 104 false 2013 2023 2271 101 73 5 11046 2019 https://github.com/dat-ecosystem javascript markdown yaml json bourne-shell csv true 9689 0 20 1 false 14 true Germany and United Kingdom https://github.com/datproject/dat 0 0 dat.foundation groff groff 1990 23 textMarkup https://www.gnu.org/software/groff/groff.html 0 509 1 18 23617 true 2 frundis nroff https://git.savannah.gnu.org/git/groff.git/ textMarkup 20035 25686 false markup.py 1991 2025 11315 78 1404 34 679862 Groff (GNU troff) is a typesetting system that reads plain text mixed with formatting commands and produces formatted output. Output may be PostScript or PDF, html, or ASCII/UTF8 for display at the terminal. Formatting commands may be either low-level typesetting requests (“primitives”) or macros from a supplied set. Users may also write their own macros. All three may be combined. Groff (GNU troff) is a typesetting system that reads plain text mixed with formatting commands and produces formatted output. Output may be PostScript or PDF, html, or ASCII/UTF8 for display at the terminal. Formatting commands may be either low-level typesetting requests (“primitives”) or macros from a supplied set. Users may also write their own macros. All three may be combined. GNU Project Groff (GNU troff) is a typesetting system that reads plain text mixed with formatting commands and produces formatted output. Output may be PostScript or PDF, html, or ASCII/UTF8 for display at the terminal. Formatting commands may be either low-level typesetting requests (“primitives”) or macros from a supplied set. Users may also write their own macros. All three may be combined. [1-9] man 1p 3pm bourne-shell cpp make c html m4 perl protobuf sed objective-cpp csharp css awk tex ruby forth vim-script diff true 456 0 45 troff false https://www.gnu.org/software/groff/manual/html_node/index.html United States .sp 1.5i My thoughts on the subject .sp Groff https://reddit.com/r/groff https://git.savannah.gnu.org/git/groff.git/ "\"" \#" .ig true true true https://en.wikipedia.org/wiki/Groff_(software) 0 0 Groff ngs NGS 2013 Ilya Sher 18 pl https://ngs-lang.org/ 0 v0.2.16 510 0 17 23616 true 0 https://github.com/ilyash/ngs pl 2013 2024 2013 29 43 1417 295 false Next Generation Shell 2013 2024 2988 20 244 6 61946 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. 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. https://github.com/ngs-lang 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. c markdown css scss less bourne-shell yaml javascript make html json dockerfile sed svg cmake vim-script awk true 1568 0 35 1 false 0 true text http://www.rosettacode.org/wiki/Category:NGS Israel and Portugal https://github.com/ilyash/ngs 0 0 ngs-lang.org stylus Stylus 2010 TJ Holowaychuk 20 stylesheetLanguage http://stylus-lang.com/ 6 511 3 23611 true 6 abs ace argdown gerbil glisp pug stylesheetLanguage 315 344 5041 0 stylus source.stylus markup false s/Stylus.styl 113 2012 2017 1 19 2015 2010 sass css jade python 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. 2013 24 22 31 38256010 styl styl true 391 0 22 1 styl text 6948 stylus "body::before content: ""Hello World""" border-radius() -webkit-border-radius arguments -moz-border-radius arguments border-radius arguments a.button border-radius 5px fonts = helvetica, arial, sans-serif body { padding: 50px; font: 14px/1.4 fonts; } form input[type=text] padding: 5px border: 1px solid #eee color: #ddd textarea @extends form input[type=text] padding: 10px $foo color: #FFF .bar background: #000 @extends $foo div.rectangle { -webkit-border-radius: 10px; -moz-border-radius: 10px; border-radius: 10px; } Stylus """" true true https://en.wikipedia.org/wiki/Stylus_(stylesheet_language) 0 0 stylus-lang.com Stylus https://github.com/billymoon/Stylus Stylus vdscript vdscript 2000 Avery Lee 21 pl https://virtualdub.org 0 v1.10.4 512 1 1 23611 true 0 pl false vdscript.png VirtualDub is a free and open-source video capture and video processing utility for Microsoft Windows written by Avery Lee. It is designed to process linear video streams, including filtering and recompression. It uses AVI container format to store captured video.The first version of VirtualDub, written for Windows 95, to be released on SourceForge was uploaded on August 20, 2000. A video capture utility for 32-bit and 64-bit Windows platforms A video capture utility for 32-bit and 64-bit Windows platforms https://virtualdub.org/virtualdub_history.html A video capture utility for 32-bit and 64-bit Windows platforms VirtualDub.jobs cpp true 1021 0 25 1 false 1 true https://virtualdub.org/docs/vdscript.txt https://sourceforge.net/projects/virtualdub/files/virtualdub-win United States https://sourceforge.net/projects/virtualdub "declare foo; foo = VirtualDub.video.filters; foo.Add(""bar"");" declare true https://en.wikipedia.org/wiki/VirtualDub 0 0 fantom Fantom 2005 32 pl http://www.fantom.org 0 513 3 23611 true 0 pl 36 38 176 0 text source.fan programming false f/Fantom.fan 14 2016 2017 2 2 fantom.py 2003 2005 csharp java scala ruby erlang javascript boo ceylon gosu groovy kotlin "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." 2008 60 49 145 18969637 https://github.com/fantom-lang fan fan fan true 521 0 38 jvm https://tio.run/#fantom https://docs.fantom.foundation/ text http://www.rosettacode.org/wiki/Category:Fantom United States "// Hello from Fantom! class HelloWorld { static Void main() { echo(""Hello World"") } } " "/* * Author: Robert Koeninger * License: WTFPL (http://www.wtfpl.net/) */ mixin Expr { abstract Obj? eval() } class Constant : Expr { Obj? value new make(Obj? value) { this.value = value } override Obj? eval() { value } } enum class Op { plus, minus } class Infix : Expr { Op op Expr left Expr right new make(Op op, Expr left, Expr right) { this.op = op this.left = left this.right = right } override Obj? eval() { switch (op) { case Op.plus: return (Int)left.eval() + (Int)right.eval() case Op.minus: return (Int)left.eval() - (Int)right.eval() default: throw Err(""undefined Op"") } } } " Fantom "// Hello from Fantom! class HelloWorld { static Void main() { echo(""Hello, World!"") } }" Fantom // /* */ echo """" true true true true false true https://en.wikipedia.org/wiki/Fantom_(programming_language) 0 0 Fantom fantom.org Fantom https://github.com/rkoeninger/sublime-fantom Fantom pike Pike 1994 Fredrik Hübinette 39 pl https://pike.lysator.liu.se/ 0 514 5 23609 2369 true 0 pl 94 105 145 0 pike text source.pike programming false p/Pike.pike 1 2014 2014 3 1 c_like.py 1994 lpc c 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. 2002 45 66 165 86780 Chalmers Datorförening pike pmod pike pike pmod true 446 0 41 1 https://tio.run/#pike https://pike.lysator.liu.se/docs/man/ text 9961 https://github.com/antlr/grammars-v4/tree/master/pike Pike http://www.rosettacode.org/wiki/Category:Pike pike8.0 Sweden Pike "int main() { write(""Hello World\n""); return 0; } " #!/usr/bin/env pike int main(int argc, array argv) { return 0; } Pike https://riju.codes/pike "int main() { write(""Hello, world!\n""); return 0; } " "mixed anything; anything = (int)5.5; // anything is now the integer value 5 anything = (string)anything; // anything is now the string value ""5""" Pike // write true true true true false https://github.com/kevinior/jupyter-pike-kernel https://en.wikipedia.org/wiki/Pike_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=2369 Pike pike.lysator.liu.se Pike https://github.com/hww3/pike-textmate year|publisher|title|authors|isbn13\n2010||Pike (programming Language)|Surhone and Lambert M. and Timpledon and Miriam T. and Marseken and Susan F.|9786131011245 Pike ncl NCAR Command Language 1994 25 pl weather https://www.ncl.ucar.edu/index.shtml 0 6.6.2 515 2 26 23606 true 0 https://github.com/NCAR/ncl pl 61 64 654 0 text source.ncl programming 2016 2024 1990 36 65 258 125 true 9 2015 2015 16 2 NCAR Command Language ncl.py 1990 2025 14348 51 9271 86 3466760 (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. (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. University Corporation for Atmospheric Research (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. ncl ncl fortran-77 c objective-c matlab mumps c-shell rescript sed mathematica bourne-shell fortran-90 python xml perl make markdown lex java yaml korn-shell yacc csv xslt ini diff visual-basic true 706 0 52 false 6 true text United States ";----------------------------------------------------------------- ; NCL User Guide Example: NUG_bar_chart.ncl ; ; KMF 30.10.14 ;----------------------------------------------------------------- ; These load commands are not required in NCL versions 6.2.0 and later. load ""$NCARG_ROOT/lib/ncarg/nclscripts/csm/gsn_code.ncl"" load ""$NCARG_ROOT/lib/ncarg/nclscripts/csm/gsn_csm.ncl"" begin low = 0.0 high = 1.0 n = 12 x = fspan(1.0, 12.0, n) y = random_uniform(low, high, n) wks = gsn_open_wks(""png"",""NUG_bar_chart"") res = True res@gsnXYBarChart = True res@gsnXYBarChartBarWidth = 0.3 res@gsnXYBarChartColors = ""blue"" res@trXMinF = 0.0 ;-- x-axis min value res@trXMaxF = 13.0 ;-- x-axis max value res@trYMinF = 0.0 ;-- y-axis min value res@trYMaxF = 1.0 ;-- y-axis max value res@tmXBMode = ""Explicit"" ;-- explicit labels res@tmXBValues = ispan(1,12,1) res@tmXBLabels = (/""Jan"",""Feb"",""Mar"",""Apr"",""May"",""Jun"",""Jul"",""Aug"",""Sep"", \ ""Oct"",""Nov"",""Dec""/) res@tmXBLabelFontHeightF = 0.015 res@tiMainString = ""NCL Doc Example: bar chart"" plot = gsn_csm_xy(wks, x, y, res) end" val=102 a=val/4. print(a) NCL https://github.com/NCAR/ncl ; true true false 0 0 NCL https://github.com/rpavlick/language-ncl.git NCL buzz buzz 2021 Benoit Giannangeli 19 pl https://buzz-lang.dev 0 https://github.com/buzz-language/buzz/releases 0.1.0-rc.1 516 0 8 23604 true 0 https://github.com/buzz-language/buzz pl 2021 2024 2021 16 32 1168 78 false buzz.png 2021 2025 1133 13 229 8 60905 A small/lightweight typed scripting language (in development) A small/lightweight typed scripting language (in development) https://github.com/buzz-language/ A small/lightweight typed scripting language (in development) buzz zig lua markdown json yaml dart typescript html true 1279 0 29 lua 1 false 0 true https://github.com/buzz-language/buzz/blob/main/README.md France https://github.com/buzz-language/buzz 0 0 opam-pm opam-pm 2012 Fabrice Le Fessant 16 packageManager https://opam.ocaml.org/ 0 2.2.0-beta2 517 0 14 23600 false 0 https://github.com/ocaml/opam packageManager 2012 2024 2012 62 349 1218 663 false 10000000 2224 ocaml 2012 2025 12425 228 484 43 148030 https://github.com/ocaml ocaml bourne-shell markdown make c m4 yaml bash z-shell xml html dockerfile sed c-shell true 2495 0 30 1 false 2 true Various https://github.com/ocaml/opam 0 0 opam.ocaml.org jsil-compiler jsil-compiler 2010 Kevin Gadd 16 compiler http://jsil.org/ 0 0.7.6 518 0 15 23598 true 0 https://github.com/sq/JSIL compiler 2011 2024 2011 104 242 1728 381 false 2011 2017 3931 36 1759 117 342572 2011 JSIL is a compiler that transforms .NET applications and libraries from their native executable format - CIL bytecode - into standards-compliant, cross-browser JavaScript. JSIL is a compiler that transforms .NET applications and libraries from their native executable format - CIL bytecode - into standards-compliant, cross-browser JavaScript. https://github.com/sq JSIL is a compiler that transforms .NET applications and libraries from their native executable format - CIL bytecode - into standards-compliant, cross-browser JavaScript. csharp javascript html xml css f-sharp cadence-skill asp.net bourne-shell typescript cpp yaml json visual-basic.net markdown true 2492 0 31 1 false 0 true na United States https://github.com/sq/JSIL 0 0 jsil.org arc Arc 2001 Paul Graham and Robert Morris 25 pl lisp https://www.arclanguage.org 0 519 2 23598 3986 true 1 bel pl 417 467 236 0 text none programming false a/ARC.arc http://tryarc.org/ 2001 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 Arc is a dialect of the Lisp programming language developed by Paul Graham and Robert Morris. 2003 82 50 193 188190 arc arc 431 0 29 bel 2 http://www.arclanguage.org/tut.txt text 5327 http://www.rosettacode.org/wiki/Category:Arc United States "(prn ""Hello World"") " "(defop said req (aform [onlink ""click here"" (pr ""you said: "" (arg _ ""foo""))] (input ""foo"") (submit)))" ARC prn """" true true true https://en.wikipedia.org/wiki/Arc_(programming_language) 0 8 https://hopl.info/showlanguage.prx?exp=3986 Arc Arc Arc 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 nsis NSIS 2001 24 pl http://nsis.sourceforge.net 0 520 3 23597 true 0 pl 7167 8095 4747 0 text nsis text/x-nsis source.nsis programming false 75 2011 2016 2 12 Nullsoft Software Install Script installers.py 2001 c eclipse-editor delphi visual-studio-editor python 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. 2003 97 103 476 307436 Nullsoft, Inc nsi nsh nsi nsh 756 0 25 text nsis http://www.rosettacode.org/wiki/Category:NSIS United States "; Hello World in Nullsoft Software Install Script (NSIS) Caption ""Hello World!"" OutFile "".\HelloWorld.exe"" SilentInstall silent Section """" MessageBox MB_OK ""Hello World!"" SectionEnd " "; --------------------- ; x64.nsh ; --------------------- ; ; A few simple macros to handle installations on x64 machines. ; ; RunningX64 checks if the installer is running on x64. ; ; ${If} ${RunningX64} ; MessageBox MB_OK ""running on x64"" ; ${EndIf} ; ; DisableX64FSRedirection disables file system redirection. ; EnableX64FSRedirection enables file system redirection. ; ; SetOutPath $SYSDIR ; ${DisableX64FSRedirection} ; File some.dll # extracts to C:\Windows\System32 ; ${EnableX64FSRedirection} ; File some.dll # extracts to C:\Windows\SysWOW64 ; !ifndef ___X64__NSH___ !define ___X64__NSH___ !include LogicLib.nsh !macro _RunningX64 _a _b _t _f !insertmacro _LOGICLIB_TEMP System::Call kernel32::GetCurrentProcess()i.s System::Call kernel32::IsWow64Process(is,*i.s) Pop $_LOGICLIB_TEMP !insertmacro _!= $_LOGICLIB_TEMP 0 `${_t}` `${_f}` !macroend !define RunningX64 `"""" RunningX64 """"` !macro DisableX64FSRedirection System::Call kernel32::Wow64EnableWow64FsRedirection(i0) !macroend !define DisableX64FSRedirection ""!insertmacro DisableX64FSRedirection"" !macro EnableX64FSRedirection System::Call kernel32::Wow64EnableWow64FsRedirection(i1) !macroend !define EnableX64FSRedirection ""!insertmacro EnableX64FSRedirection"" !endif # !___X64__NSH___ " NSIS https://twitter.com/nsis_tweets "# Modern UI example script !include MUI.nsh Name ""Example 2"" OutFile ""Example2.exe"" !insertmacro MUI_PAGE_WELCOME !insertmacro MUI_PAGE_LICENSE ""license.rtf"" !insertmacro MUI_PAGE_DIRECTORY !insertmacro MUI_PAGE_COMPONENTS !insertmacro MUI_PAGE_INSTFILES !insertmacro MUI_PAGE_FINISH !insertmacro MUI_LANGUAGE ""English"" !insertmacro MUI_LANGUAGE ""German"" !insertmacro MUI_LANGUAGE ""French"" Section ""Extract makensis"" SetOutPath $INSTDIR File ..\makensis.exe SectionEnd" ; true true false https://en.wikipedia.org/wiki/Nullsoft_Scriptable_Install_System 0 0 NSIS nsis.sourceforge.net NSIS https://github.com/github-linguist/NSIS NSIS amber Amber 2022 PhoenixHimself 15 pl https://amber-lang.com/ 0 0.3.1-alpha 521 1 5 23596 true 0 https://github.com/Ph0enixKM/Amber pl 2022 2024 26 77 3700 83 false 2022 2024 521 42 424 2 16521 Programming language that compiles to Bash. It's a high level programming language that makes it easy to create shell scripts. It's particularly well suited for cloud services. Programming language that compiles to Bash. It's a high level programming language that makes it easy to create shell scripts. It's particularly well suited for cloud services. Programming language that compiles to Bash. It's a high level programming language that makes it easy to create shell scripts. It's particularly well suited for cloud services. rust bourne-shell markdown toml yaml bash true 3975 0 22 javascript 1 false 0 true https://docs.amber-lang.com/ "// Define variables let name = ""John"" let age = 30 // Display a greeting echo ""Hello, my name is {name}"" // Perform conditional checks if age < 18 { echo ""I'm not an adult yet"" } else { echo ""I'm an adult"" } // Loop through an array let fruits = [""apple"", ""banana"", ""cherry"", ""date""] echo ""My favorite fruits are:"" loop fruit in fruits { echo fruit }" https://github.com/Ph0enixKM/Amber 0 0 markwhen Markwhen 2022 Rob Koch 15 textMarkup https://markwhen.com/ 0 522 1 9 23593 true 0 https://github.com/mark-when/markwhen textMarkup 2021 2024 31 123 3443 76 false 2022 2023 379 2 148 3 18585 https://markwhen.com/example Make a cascading timeline from Markdown-like text. Make a cascading timeline from Markdown-like text. https://github.com/mark-when Make a cascading timeline from Markdown-like text. typescript json html javascript markdown css svg dockerfile yaml true 3816 0 25 markdown 1 false United States title: Welcome to Markwhen 👋 #Project1: #d336b1 section Welcome #welcome now: This example timeline showcases some of markwhen's features. Feel free to delete everything to start making your own timeline #welcome now: You can also view this example timeline at [markwhen.com/example](https://markwhen.com/example) #welcome Or you can save this timeline so you can refer to it later, by going to Browser storage & files, and clicking Save current. now: For more information, view the documentation [here](https://docs.markwhen.com) or join the [discord](https://discord.gg/kQbqP4uz) #welcome endSection section All Projects group Project 1 #Project1 // Supports ISO8601 2023-01/2023-03: Sub task #John 2023-03/2023-06: Sub task 2 #Michelle More info about sub task 2 - [ ] We need to get this done - [x] And this - [ ] This one is extra 2023-07: Yearly planning endGroup group Project 2 #Project2 2023-04/4 months: Larger sub task #Danielle // Supports American date formats 03/2023 - 1 year: Longer ongoing task #Michelle - [x] Sub task 1 - [x] Sub task 2 - [ ] Sub task 3 - [ ] Sub task 4 - [ ] so many checkboxes omg 10/2023 - 2 months: Holiday season endGroup group Project 3 01/2024: Project kickoff 02/2024-04/2024: Other stuff endGroup endSection 2023-01-03 every other week for 1 year: Biweekly meeting https://github.com/mark-when/markwhen 0 0 pawn PAWN 2006 22 pl https://www.compuphase.com/pawn/pawn.htm 0 v4.1.7152 523 2 10 23590 true 0 https://github.com/compuphase/pawn pl 434 502 3270 0 2015 2024 2006 32 76 477 27 false 168 2014 2018 2 23 2006 2024 119 17 235 25 85357 Informatie-Technologisch Bureau CompuPhase pwn inc pascal c assembly-language tex cmake rexx xslt css markdown cpp true 924 0 33 false 4 true text The Netherlands "#include forward OneSecTimer(); new lasttick = 0; main() { print(""\n----------------------------------""); print("" This is a blank GameModeScript""); print(""----------------------------------\n""); } public OnGameModeInit() { // Set timer of 1 second. SetTimer(""OneSecTimer"", 1000, 1); print(""GameModeInit()""); SetGameModeText(""Timer Test""); AddPlayerClass(0, 1958.3783, 1343.1572, 15.3746, 269.1425, 0, 0, 0, 0, 0, 0); return 1; } public OneSecTimer() { if(lasttick == 0) { lasttick = GetTickCount(); return; } new sText[256]; format(sText,sizeof(sText),""GetTickCountOffset = %d"",GetTickCount() - lasttick); print(sText); SendClientMessageToAll(0xFF0000, sText); lasttick = GetTickCount(); } " https://riju.codes/pawn "#include main() { print(""Hello, world!\n""); } " https://github.com/compuphase/pawn // true true false 2 0 PAWN https://github.com/Southclaw/pawn-sublime-language.git 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 PAWN sanddance SandDance 2018 Steven M. Drucker 14 visual dataVis https://microsoft.github.io/SandDance/ 0 524 0 13 23588 true 0 https://github.com/Microsoft/SandDance visual 2018 2024 112 524 6355 96 false sanddance.png 2018 2025 724 20 799 65 1370653 https://microsoft.github.io/SandDance/app/ Microsoft html typescript json javascript markdown scss css python handlebars yaml svg less bourne-shell true 7949 0 27 1 false https://www.youtube.com/watch?v=sj2tzW2uhZo https://microsoft.github.io/SandDance/docs/ https://github.com/Microsoft/SandDance 0 0 differential-datalog Differential Datalog 2018 Leonid Ryzhyk 17 pl 0 1.2.3 525 0 23 23586 true 0 https://github.com/vmware/differential-datalog pl 2018 2024 2018 30 117 1353 138 false DDlog 2018 2022 2137 44 1073 303 1935210 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. 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. VMware, Inc 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. java rust haskell bourne-shell markdown toml json5 tex go json python yaml make c sql javascript html nix typescript restructuredtext css dockerfile vim-script true 1749 0 40 1 false 1 true https://github.com/vmware/differential-datalog/blob/master/doc/tutorial/tutorial.md United States https://twitter.com/vmwopensource https://github.com/vmware/differential-datalog 0 0 civet Civet 2022 Daniel X Moore 18 pl https://civet.dev/ 0 526 1 13 23584 true 0 https://github.com/DanielXMoore/Civet pl 2022 2024 15 28 1342 123 false 2022 2025 3713 32 372 8 113035 https://civet.dev/playground A TypeScript superset that favors more types and less typing A TypeScript superset that favors more types and less typing A TypeScript superset that favors more types and less typing json typescript markdown javascript svg coffeescript bourne-shell yaml css html awk bash toml typescript javascript https://civet.dev/cheatsheet true 1460 0 44 coffeescript elm livescript flow haskell perl python ruby crystal bash typescript 1 false https://civet.dev/reference "switch x 0 console.log(""zero"") /^\s+$/ console.log(""whitespace"") [{type: ""text"", content}, ...rest] console.log(""leading text"", content)" https://discord.gg/xkrW9GebBc https://github.com/DanielXMoore/Civet 0 0 metal Metal 2014 13 library 7 527 1 23580 true 7 blender-app cloc ffmpeg iterm2 java lobster wonkey library 232 256 79 0 c_cpp clike text/x-c++src source.c++ programming false 359 2005 2018 1 23 2014 ios opengl opencl swift objective-c llvmir unity-engine "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.""" 2014 475 325 183 43545213 Apple metal 2595 0 14 metal text 1466 United States "// Copyright 2014 Isis Innovation Limited and the authors of InfiniTAM #include #include ""../../DeviceAgnostic/ITMSceneReconstructionEngine.h"" #include ""../../DeviceAgnostic/ITMVisualisationEngine.h"" #include ""ITMVisualisationEngine_Metal.h"" using namespace metal; kernel void genericRaycastVH_device(DEVICEPTR(Vector4f) *pointsRay [[ buffer(0) ]], const CONSTPTR(ITMVoxel) *voxelData [[ buffer(1) ]], const CONSTPTR(typename ITMVoxelIndex::IndexData) *voxelIndex [[ buffer(2) ]], const CONSTPTR(Vector2f) *minmaxdata [[ buffer(3) ]], const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(4) ]], uint2 threadIdx [[ thread_position_in_threadgroup ]], uint2 blockIdx [[ threadgroup_position_in_grid ]], uint2 blockDim [[ threads_per_threadgroup ]]) { int x = threadIdx.x + blockIdx.x * blockDim.x, y = threadIdx.y + blockIdx.y * blockDim.y; if (x >= params->imgSize.x || y >= params->imgSize.y) return; int locId = x + y * params->imgSize.x; int locId2 = (int)floor((float)x / minmaximg_subsample) + (int)floor((float)y / minmaximg_subsample) * params->imgSize.x; castRay(pointsRay[locId], x, y, voxelData, voxelIndex, params->invM, params->invProjParams, params->voxelSizes.y, params->lightSource.w, minmaxdata[locId2]); } kernel void genericRaycastVGMissingPoints_device(DEVICEPTR(Vector4f) *forwardProjection [[ buffer(0) ]], const CONSTPTR(int) *fwdProjMissingPoints [[ buffer(1) ]], const CONSTPTR(ITMVoxel) *voxelData [[ buffer(2) ]], const CONSTPTR(typename ITMVoxelIndex::IndexData) *voxelIndex [[ buffer(3) ]], const CONSTPTR(Vector2f) *minmaxdata [[ buffer(4) ]], const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(5) ]], uint2 threadIdx [[ thread_position_in_threadgroup ]], uint2 blockIdx [[ threadgroup_position_in_grid ]], uint2 blockDim [[ threads_per_threadgroup ]]) { int pointId = threadIdx.x + blockIdx.x * blockDim.x; if (pointId >= params->imgSize.z) return; int locId = fwdProjMissingPoints[pointId]; int y = locId / params->imgSize.x, x = locId - y * params->imgSize.x; int locId2 = (int)floor((float)x / minmaximg_subsample) + (int)floor((float)y / minmaximg_subsample) * params->imgSize.x; castRay(forwardProjection[locId], x, y, voxelData, voxelIndex, params->invM, params->invProjParams, params->voxelSizes.y, params->lightSource.w, minmaxdata[locId2]); } kernel void renderICP_device(const CONSTPTR(Vector4f) *pointsRay [[ buffer(0) ]], DEVICEPTR(Vector4f) *pointsMap [[ buffer(1) ]], DEVICEPTR(Vector4f) *normalsMap [[ buffer(2) ]], DEVICEPTR(Vector4u) *outRendering [[ buffer(3) ]], const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(4) ]], uint2 threadIdx [[ thread_position_in_threadgroup ]], uint2 blockIdx [[ threadgroup_position_in_grid ]], uint2 blockDim [[ threads_per_threadgroup ]]) { int x = threadIdx.x + blockIdx.x * blockDim.x, y = threadIdx.y + blockIdx.y * blockDim.y; if (x >= params->imgSize.x || y >= params->imgSize.y) return; processPixelICP(outRendering, pointsMap, normalsMap, pointsRay, params->imgSize.xy, x, y, params->voxelSizes.x, TO_VECTOR3(params->lightSource)); } kernel void renderForward_device(DEVICEPTR(Vector4u) *outRendering [[ buffer(0) ]], const CONSTPTR(Vector4f) *pointsRay [[ buffer(1) ]], const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(2) ]], uint2 threadIdx [[ thread_position_in_threadgroup ]], uint2 blockIdx [[ threadgroup_position_in_grid ]], uint2 blockDim [[ threads_per_threadgroup ]]) { int x = threadIdx.x + blockIdx.x * blockDim.x, y = threadIdx.y + blockIdx.y * blockDim.y; if (x >= params->imgSize.x || y >= params->imgSize.y) return; processPixelForwardRender(outRendering, pointsRay, params->imgSize.xy, x, y, params->voxelSizes.x, TO_VECTOR3(params->lightSource)); } kernel void forwardProject_device(DEVICEPTR(Vector4f) *forwardProjection [[ buffer(0) ]], const CONSTPTR(Vector4f) *pointsRay [[ buffer(1) ]], const CONSTPTR(CreateICPMaps_Params) *params [[ buffer(2) ]], uint2 threadIdx [[ thread_position_in_threadgroup ]], uint2 blockIdx [[ threadgroup_position_in_grid ]], uint2 blockDim [[ threads_per_threadgroup ]]) { int x = (threadIdx.x + blockIdx.x * blockDim.x), y = (threadIdx.y + blockIdx.y * blockDim.y); if (x >= params->imgSize.x || y >= params->imgSize.y) return; int locId = x + y * params->imgSize.x; Vector4f pixel = pointsRay[locId]; int locId_new = forwardProjectPixel(pixel * params->voxelSizes.x, params->M, params->projParams, params->imgSize.xy); if (locId_new >= 0) forwardProjection[locId_new] = pixel; }" https://en.wikipedia.org/wiki/Metal_(API) 0 0 Metal https://github.com/textmate/c.tmbundle Metal csp CSP 1978 18 pl 0 528 1 23578 795 true 0 pl false Communicating Sequential Processes 2002 occam limbo go crystal clojure ada 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). 2003 281 133 456 247370 Oxford University 1425 0 18 https://aiochan.readthedocs.io/en/latest/csp.html text csp United Kingdom COPY = *[c:character; west?c → east!c] https://en.wikipedia.org/wiki/Communicating_sequential_processes 7 21 https://hopl.info/showlanguage.prx?exp=795 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 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 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 invokator invokator 2004 Yann Orlarey 15 pl https://faust.grame.fr/ 0 2.72.14 529 0 43 23574 6393 true 0 https://github.com/grame-cncm/faust pl 2016 2024 2004 88 316 2487 196 false 2004 2025 15241 209 3739 373 6689499 https://github.com/grame-cncm cpp bash standard-ml xml markdown make java cmake javascript c bourne-shell objective-cpp python julia objective-c tex vhdl csharp rust html json yaml css d cson tcl restructuredtext gradle ruby wasm yacc svg llvmir lisp lex mxml r vim-script matlab dockerfile toml ini expect true 3646 0 58 1 false 2 true https://tio.run/#https://faustide.grame.fr/ France http://functional-art.org/2017/slides/orlarey-farm17-slides.pdf https://github.com/grame-cncm/faust 0 0 https://hopl.info/showlanguage.prx?exp=6393 logtalk Logtalk 1998 Paulo Moura 31 pl http://logtalk.org 3 530 3 23569 3555 true 3 ace cloc pygments pl 50 52 65 0 text source.logtalk programming false l/Logtalk.lgt 90 2005 2017 1 5 prolog.py 2002 1998 prolog smalltalk objective-c swi-prolog mercury oz visual-prolog 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. 2012 2 42 1 7792164 https://github.com/LogtalkDotOrg lgt logtalk lgt lgt logtalk 231 0 35 1 lgt logtalk text http://www.rosettacode.org/wiki/Category:Logtalk Portugal write('Hello World') % this is a Logtalk source file :- object(hello_world). % the initialization/1 directive argument is automatically executed % when the object is loaded into memory: :- initialization((nl, write('********** Hello World! **********'), nl)). :- end_object. Logtalk https://twitter.com/logtalkdotorg ?- my_first_object::p2. ERROR: error(permission_error(access, private_predicate, p2), my_first_object::p2, user) Logtalk write ' true true true true true true false true https://en.wikipedia.org/wiki/Logtalk_(programming_language) 0 4 https://hopl.info/showlanguage.prx?exp=3555 logtalk.org Logtalk https://github.com/textmate/logtalk.tmbundle Logtalk 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 algol Algol 1958 17 pl http://algol68.sourceforge.net/ 0 531 2 23565 2966 true 0 pl false 1958 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 "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." 2001 323 453 865 1453 Swiss Federal Institute of Technology alg 1635 0 18 https://public.support.unisys.com/aseries/docs/clearpath-mcp-17.0/pdf/86000098-515.pdf text http://www.rosettacode.org/wiki/Category:ALGOL https://riju.codes/algol "print((""Hello, world!"",new line)) " 'BEGIN' WRITE TEXT('('HELLO%WORLD')'); 'END' https://jmvdveer.home.xs4all.nl/en.algol-68-genie.html := true https://en.wikipedia.org/wiki/ALGOL 31 17 https://hopl.info/showlanguage.prx?exp=2966 Algol 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 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 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 befunge Befunge 1993 Chris Pressey 25 esolang https://catseye.tc/article/Languages.md#befunge-93 0 532 4 23563 1717 true 0 esolang 7 7 1 0 text source.befunge programming false b/Befunge.be 20 2014 2014 2 esoteric.py https://esolangpark.vercel.app/ide/befunge93 1993 forth intercal ascii brainfuck lisp python whitespace malbolge "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." 2002 80 57 228 53391 Cat's Eye Technologies befunge be befunge be bf b93 b98 befunge 620 0 25 1 https://tio.run/#befunge text Befunge http://www.rosettacode.org/wiki/Category:Befunge United States Befunge "v Hello World in Befunge >""dlroW olleH"",,,,,,,,,,,@ " ">""dlroW olleH"",,,,,,,,,,,@ " Befunge https://riju.codes/befunge "64+""!dlrow ,olleH"">:#,_@ " ">25*""!dlrow ,olleH"":v v:,_@ > ^" Befunge https://github.com/amicloud/befunge93 true false https://en.wikipedia.org/wiki/Befunge 0 0 https://hopl.info/showlanguage.prx?exp=1717 Befunge https://github.com/johanasplund/sublime-befunge Befunge mavo mavo 2015 Lea Verou 15 template https://mavo.io/ 0 0.3.0 533 1 7 23562 true 0 https://github.com/mavoweb/mavo template 2015 2024 2015 57 178 2825 269 false 2015 2024 1566 27 117 13 296316 2016 https://github.com/mavoweb javascript css json scss markdown html toml true 3388 0 22 1 false 0 true United States "

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

Do stuff

" https://twitter.com/mavoweb https://github.com/mavoweb/mavo 0 0 mavo.io plpgsql PL/pgSQL 1998 Jan Wieck 20 pl 0 534 1 23562 true 2 bucardo pgbouncer pl 8265 9239 24919 2 "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""" pgsql sql text/x-sql source.sql programming false 224 2005 2016 7 15 sql.py 1998 pl-sql ada postgresql sql-psm sql bison 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. 2005 54 37 89 1545014 The PostgreSQL Global Development Group pgsql sql 490 0 20 1 https://www.postgresql.org/docs/current/plpgsql.html text United States load 'plpgsql'; load 'plpgsql_lint'; DROP FUNCTION IF EXISTS list_sites(); CREATE OR REPLACE FUNCTION list_sites() RETURNS TABLE (fc json) AS $func$ BEGIN RETURN QUERY SELECT row_to_json(feat_col) FROM ( SELECT 'FeatureCollection' AS type, array_to_json(array_agg(feat)) AS features FROM ( SELECT DISTINCT ON (new_id) 'Feature' AS type, ST_ASGeoJSON(loc.geom)::json AS geometry, row_to_json( (SELECT prop FROM (SELECT new_id) AS prop)) AS properties FROM location loc) AS feat) AS feat_col; END; $func$ LANGUAGE plpgsql; DROP FUNCTION IF EXISTS get_observations(character varying, integer); CREATE OR REPLACE FUNCTION get_observations(kind varchar, site_id integer) RETURNS TABLE (fc json) AS $func$ BEGIN IF kind = 'o2_abs' THEN RETURN QUERY SELECT array_to_json(array_agg(row_to_json(obs))) FROM ( SELECT observation_date AS date, o2_abs AS value FROM oxygen WHERE new_id = site_id) AS obs; ELSIF kind = 'o2_rel' THEN RETURN QUERY SELECT array_to_json(array_agg(row_to_json(obs))) FROM ( SELECT observation_date AS date, o2_rel AS value FROM oxygen WHERE new_id = site_id) AS obs; ELSIF kind = 'temp' THEN RETURN QUERY SELECT array_to_json(array_agg(row_to_json(obs))) FROM ( SELECT observation_date AS date, temp AS value FROM oxygen WHERE new_id = site_id) AS obs; END IF; END; $func$ LANGUAGE plpgsql; PL/pgSQL true true true true true https://en.wikipedia.org/wiki/PL/pgSQL 0 0 PLpgSQL https://github.com/textmate/sql.tmbundle PLpgSQL object-pascal Object Pascal 1986 23 pl 0 535 2 23562 1170 true 0 pl false o/Object Pascal.pp 1986 x86-isa arm free-pascal powerpc sparc mips oxygene java javascript turbo-pascal pascal simula smalltalk csharp genie nim ios linux freebsd solaris morfik visual-studio-editor android delphi Object Pascal refers to a branch of object-oriented derivatives of Pascal, mostly known as the primary programming language of Embarcadero Delphi. 2004 149 412 548 630175 https://gitlab.com/groups/freepascal.org/fpc/-/issues p pp pas 765 0 28 false https://castle-engine.io/modern_pascal text United States program ObjectPascalExample; type THelloWorld = class procedure Put; end; procedure THelloWorld.Put; begin Writeln('Hello World'); end; var HelloWorld: THelloWorld; begin HelloWorld := THelloWorld.Create; HelloWorld.Put; HelloWorld.Free; end. type THelloWorld = class procedure Put; begin PrintLn('Hello, World!'); end end; var HelloWorld := THelloWorld.Create; HelloWorld.Put; Object Pascal { } ' true true false true true false true https://en.wikipedia.org/wiki/Object_Pascal 0 0 https://hopl.info/showlanguage.prx?exp=1170 g-code G-code 1950 14 pl 0 536 1 23560 true 0 pl 106 107 4457 0 gcode source.gcode programming false 8 2014 2015 2 3 gcodelexer.py 1950 gerber-image labview punched-tape html css apt "G-code (also RS-274), which has many variants, is the common name for the most widely used numerical control (NC) programming language. It is used mainly in computer-aided manufacturing to control automated machine tools. G-code is sometimes called G programming language, not to be confused with LabVIEW's G programming language. G-code is a language in which people tell computerized machine tools how to make something. The ""how"" is defined by g-code instructions provided to a machine controller (industrial computer) that tells the motors where to move, how fast to move, and what path to follow. The most common situation is that, within a machine tool, a cutting tool is moved according to these instructions through a toolpath and cuts away material to leave only the finished workpiece. The same concept also extends to noncutting tools such as forming or burnishing tools, photoplotting, additive methods such as 3D printing, and measuring instruments." 2004 1329 245 862 1027403 MIT g cnc gco gcode gcode mpt mpf nc 6865 0 14 text United States G28 X0 Y0 G1 X55 Y5 F2000 G1 Y180 G1 X180 G1 Y5 G1 X55 G1 Y180 G1 X180 G1 Y5 G1 X55 M0 g-code https://en.wikipedia.org/wiki/G-code 1 0 G-code https://github.com/robotmaster/sublime-text-syntax-highlighting year|publisher|title|authors|isbn13\n2010|Lulu.com|CNC LATHE G-CODE & M-CODE ILLUSTRATIVE HANDBOOK|Talverdi, Patrick|9780557648368 G-code icon Icon 1977 Ralph Griswold 36 pl http://www.cs.arizona.edu/icon 0 537 4 23559 510 true 1 unicon pl false i/Icon.icn unicon.py 1977 snobol algol python unicon c pascal java smalltalk clu 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. 2001 50 82 184 14801 University of Arizona icn icon ICON 271 0 39 1 https://tio.run/#icon https://www2.cs.arizona.edu/icon/ text 2368 https://github.com/antlr/grammars-v4/tree/master/icon Icon http://www.rosettacode.org/wiki/Category:Icon icont United States "procedure main() write(""Hello World""); end" Icon https://riju.codes/icon "procedure main () write(""Hello, world!"") end " "procedure main() s := ""Mon Dec 8"" s ? write(Mdate() | ""not a valid date"") end # Define a matching function that returns # a string that matches a day month dayofmonth procedure Mdate() # Define some initial values static dates static days initial { days := [""Mon"",""Tue"",""Wed"",""Thr"",""Fri"",""Sat"",""Sun""] dates := [""Jan"",""Feb"",""Mar"",""Apr"",""May"",""Jun"", ""Jul"",""Aug"",""Sep"",""Oct"",""Nov"",""Dec""] } every suspend (retval <- tab(match(!days)) || # Match a day ="" "" || # Followed by a blank tab(match(!dates)) || # Followed by the month ="" "" || # Followed by a blank matchdigits(2) # Followed by at least 2 digits ) & (="" "" | pos(0) ) & # Either a blank or the end of the string retval # And finally return the string end # Matching function that returns a string of n digits procedure matchdigits(n) suspend (v := tab(many(&digits)) & *v <= n) & v end" Icon # write """" true true true true true true false true https://en.wikipedia.org/wiki/Icon_(programming_language) 3 19 https://hopl.info/showlanguage.prx?exp=510 Icon 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 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 hazel Hazel 2016 Cyrus Omar 20 pl visual http://hazel.org/ 0 538 1 9 23558 true 0 https://github.com/hazelgrove/hazel pl 2017 2024 2017 14 48 724 273 false hazel.png 2017 2025 15558 115 378 176 84650 https://hazel.org/build/dev/ 1997 Hazel is a live functional programming environment organized around typed holes. Hazel is a live functional programming environment that is able to typecheck, manipulate, and even run incomplete programs, i.e. programs with holes. There are no meaningless editor states. Hazel is a live functional programming environment organized around typed holes. Hazel is a live functional programming environment that is able to typecheck, manipulate, and even run incomplete programs, i.e. programs with holes. There are no meaningless editor states. University of Michigan Hazel is a live functional programming environment organized around typed holes. Hazel is a live functional programming environment that is able to typecheck, manipulate, and even run incomplete programs, i.e. programs with holes. There are no meaningless editor states. reason markdown ocaml css tex yaml make html svg javascript true 985 0 30 1 false text United States let v = {} in v : num https://github.com/hazelgrove/hazel true 0 0 hazel.org fay fay 2012 Chris Done 17 pl https://github.com/faylang/fay/wiki 0 0.1.0 539 1 9 23556 true 0 https://github.com/faylang/fay pl 2012 2024 2012 70 86 1284 24 false 2012 2021 1159 51 524 3 18419 https://github.com/faylang/ haskell rescript html markdown yaml bourne-shell bash json xml javascript true 1595 0 27 1 false 0 true text Australia and Sweden and United States "{-# LANGUAGE EmptyDataDecls #-} module Hello where import FFI data Event alert :: String -> Fay () alert = ffi ""alert(%1)"" setBodyHtml :: String -> Fay () setBodyHtml = ffi ""document.body.innerHTML = %1"" addWindowEvent :: String -> (Event -> Fay ()) -> Fay () addWindowEvent = ffi ""window.addEventListener(%1, %2)"" greet :: Event -> Fay () greet event = do putStrLn ""The document has loaded"" setBodyHtml ""Hello HTML!"" main :: Fay () main = do putStrLn ""Hello Console!"" alert ""Hello Alert!"" addWindowEvent ""load"" greet" https://twitter.com/fayhaskell https://github.com/faylang/fay 0 0 dockerfile Dockerfile 2013 20 pl https://docs.docker.com/engine/reference/builder/ 227 540 1 23554 true 228 abcl-lang abs ace alumina ante apache-hbase arkscript arret arrow-format asciidots atprotocol blz bun c3 carbon carth catala chisel cir claro clash click cloc cmake codecept comby common-workflow-language conan-pm coq couchdb crmsh cryptol cuelang cuneiform dale dasel dasm deno dexvis dgraph differential-datalog docker dogescript dub-pm ecl eiffel elm elvish enso erlang euphoria eve eyg fact-lang fish flatbuffers flow flow9 flownote fql fstar gerbil gforth gintonic gleam go gogs-editor golo gridstudio-editor gun h-lang hacspec hamler hedy hhvm highlightjs hobbes homebrew-pm hurl hush hy ibis imhex impala infusion-framework inko invokator jakt jekyll jq jsonnet julia juvix k-framework katex ko koka kotlin kubernetes ladybird lamdu-editor lamdu latino ldpl lem-editor lesma lfortran lift ligo lucid-lang luna m3db mal manim markwhen mastodon mdq mech-lang mermaid mesh mgmt michelson mimium minidsdb mochi mojo mongodb nadesiko netbeans-editor neut nextflow ngnk ngs nit nodejs noisecraft noms-db nushell oden oil opa opam-pm opencv openscad openverse orange orca oxyl pandas paraview phel php plasma please-build pony powershell preforth project-mentat prometheus prql pygments python pytorch racket reach red reko-decompiler rescript retdec rholang ricscript roc rocksdb roslyn-compiler rpscript ruby rust rye saltstack savi score scryer sdms seif seq sile skip slab smpl solidity souper sqrl streem surrealdb sympy tea-pm tensorflow terra testml textile tibet tiledb tldraw tornado triton typescript ultralisp-pm unison unseemly v vale-assembly vale vcpkg-pm vimwiki vyper wasmer wasp-lang wing wiredtiger xgboost-model xgboost xodio xtclang xtext yamp yggdrasil yii zephir pl 19957 26335 Containerfile Dockerfile 339978 13 "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""" Containerfile dockerfile dockerfile text/x-dockerfile source.dockerfile programming false 52 2014 2017 1 11 Docker, Inc. dockerfile typescript true 201 0 23 Dockerfile dockerfile text dockerfile United States "# This file describes the standard way to build Docker, using docker docker-version 0.4.2 from ubuntu:12.04 maintainer Solomon Hykes # Build dependencies run apt-get install -y -q curl run apt-get install -y -q git # Install Go run curl -s https://go.googlecode.com/files/go1.1.1.linux-amd64.tar.gz | tar -v -C /usr/local -xz env PATH /usr/local/go/bin:/usr/local/bin:/usr/local/sbin:/usr/bin:/usr/sbin:/bin:/sbin env GOPATH /go env CGO_ENABLED 0 run cd /tmp && echo 'package main' > t.go && go test -a -i -v # Download dependencies run PKG=github.com/kr/pty REV=27435c699; git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV run PKG=github.com/gorilla/context/ REV=708054d61e5; git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV run PKG=github.com/gorilla/mux/ REV=9b36453141c; git clone http://$PKG /go/src/$PKG && cd /go/src/$PKG && git checkout -f $REV # Run dependencies run apt-get install -y iptables # lxc requires updating ubuntu sources run echo 'deb http://archive.ubuntu.com/ubuntu precise main universe' > /etc/apt/sources.list run apt-get update run apt-get install -y lxc run apt-get install -y aufs-tools # Upload docker source add . /go/src/github.com/dotcloud/docker # Build the binary run cd /go/src/github.com/dotcloud/docker/docker && go install -ldflags ""-X main.GITCOMMIT '??' -d -w"" env PATH /usr/local/go/bin:/go/bin:/usr/local/bin:/usr/local/sbin:/usr/bin:/usr/sbin:/bin:/sbin cmd [""docker""]" https://twitter.com/docker https://github.com/rcjsuen/dockerfile-language-server-nodejs # true true false 0 0 Dockerfile https://github.com/asbjornenge/Docker.tmbundle Dockerfile praat-script Praat Script 1997 16 pl https://www.fon.hum.uva.nl/praat/manual/Praat_script.html 0 541 1 12 23552 true 0 https://github.com/praat/praat pl 2014 2024 2005 52 233 1434 73 false 2005 2025 9013 17 3772 246 2625194 The language is bundled with Praat, a speech analysis tool, to execute menu and action commands. The language is bundled with Praat, a speech analysis tool, to execute menu and action commands. Universiteit van Amsterdam The language is bundled with Praat, a speech analysis tool, to execute menu and action commands. c cpp make meson html xml markdown python yaml svg csv r true 2152 0 29 false The Netherlands "clearinfo # print fizzbuzz result procedure fizzbuzz: .i if .i mod 15 == 0 appendInfoLine: ""fizzbuzz"" elsif .i mod 3 == 0 appendInfoLine: ""fizz"" elsif .i mod 5 == 0 appendInfoLine: ""buzz"" else appendInfoLine: .i endif endproc for i from 1 to 100 @fizzbuzz: i endfor" https://github.com/praat/praat # true true false 0 0 emscripten Emscripten 2010 Alon Zakai 13 compiler https://emscripten.org/ 0 3.1.60 542 0 32 23551 true 0 https://github.com/emscripten-core/emscripten compiler 2011 2024 589 3254 25442 2072 false 2010 2025 28565 1018 9515 252 2919951 c cpp javascript python cmake make restructuredtext html bourne-shell m4 opencl markdown json pascal xml hlsl visual-basic assembly-language yaml typescript css svg nix lua idl powershell tex qt dtd ini llvmir bash wasm true 36244 0 48 c cpp 1 false 3 true https://github.com/emscripten-core/emscripten https://en.wikipedia.org/wiki/Emscripten 0 0 srl SRL 2016 Karim Geiger 16 queryLanguage https://simple-regex.com/ 0 543 1 5 23550 true 0 https://github.com/SimpleRegex/SRL-PHP queryLanguage 2016 2024 2016 52 112 1800 13 false Simple Regex Language 2016 2017 61 4 51 1 3182 2016 https://github.com/SimpleRegex php markdown json xml yaml true 2142 0 21 1 false text Estonia "begin with any of (digit, letter, one of ""._%+-"") once or more, literally ""@"", any of (digit, letter, one of "".-"") once or more, literally ""."", letter at least 2 times, must end, case insensitive" https://github.com/SimpleRegex/SRL-PHP 0 0 simple-regex.com filebench-wml Filebench WML 2011 Vasily Tarasov 23 pl https://github.com/filebench/filebench/wiki 0 1.4.9 544 1 7 23542 true 0 https://github.com/filebench/filebench pl 16 19 566 0 text none programming 2016 2024 2011 22 122 339 73 false 2011 2020 223 14 136 2 32220 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). 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). https://github.com/filebench 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). f fortran-77 c make cpp yacc m4 lex true 721 0 31 1 false 1 true text United States https://github.com/filebench/filebench/wiki/Workload-model-language "# # CDDL HEADER START # # The contents of this file are subject to the terms of the # Common Development and Distribution License (the ""License""). # You may not use this file except in compliance with the License. # # You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE # or http://www.opensolaris.org/os/licensing. # See the License for the specific language governing permissions # and limitations under the License. # # When distributing Covered Code, include this CDDL HEADER in each # file and include the License file at usr/src/OPENSOLARIS.LICENSE. # If applicable, add the following below this CDDL HEADER, with the # fields enclosed by brackets ""[]"" replaced with your own identifying # information: Portions Copyright [yyyy] [name of copyright owner] # # CDDL HEADER END # # # Copyright 2009 Sun Microsystems, Inc. All rights reserved. # Use is subject to license terms. # set $dir=/tmp set $nfiles=1000 set $meandirwidth=20 set $meanfilesize=16k set $iosize=1m set $nthreads=1 set mode quit firstdone define fileset name=bigfileset,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth,prealloc=100,paralloc define fileset name=destfiles,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth define process name=filereader,instances=1 { thread name=filereaderthread,memsize=10m,instances=$nthreads { flowop openfile name=openfile1,filesetname=bigfileset,fd=1 flowop readwholefile name=readfile1,fd=1,iosize=$iosize flowop createfile name=createfile2,filesetname=destfiles,fd=2 flowop writewholefile name=writefile2,fd=2,srcfd=1,iosize=$iosize flowop closefile name=closefile1,fd=1 flowop closefile name=closefile2,fd=2 } } echo ""Copyfiles Version 3.0 personality successfully loaded"" " https://github.com/filebench/filebench # true true false 0 0 Filebench WML Filebench WML inform Inform 1993 Graham Nelson 25 pl http://inform7.com/ 0 545 4 23541 true 0 pl 56 60 1046854 true 0 i7 or inform7 text source.inform7 programming false i/Inform.inform 29 2016 2018 2 2 int_fiction.py 2009 1993 linux z-machine basic tads isbn 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. 2003 73 129 426 227989 https://inform-fiction.org/ ni i7x inform ni i7x 586 0 26 1 https://ganelson.github.io/inform-website/doc/ text 5526 United Kingdom "! ""Hello world"" in Inform [ Main; print ""Hello world^""; ]; " """Hello World"" by ""I.F. Author"" The world is a room. When play begins, say ""Hello World"" " """Test Case"" by Andrew Plotkin. Include Trivial Extension by Andrew Plotkin. Volume 1 - overview Chapter - setting the scene The Kitchen is a room. [Comment: this kitchen is modelled after the one in Zork, although it lacks the detail to establish this to the player.] Section - the kitchen table The spicerack is a container in the Kitchen. Table of Spices Name Flavor ""cinnamon"" 5 ""nutmeg"" 4 ""szechuan pepper"" 8 The description of the spicerack is ""It's mostly empty."" Chapter - a character A purple cow called Gelett is in the Kitchen. [This comment spans multiple lines.. ...and this line contains [nested square[] brackets]... ...which is legal in Inform 7.] Instead of examining Gelett: say ""You'd rather see than be one."" Instead of examining Gelett: say ""You'd rather see than be one."" Check smelling Gelett: say ""This text contains several lines. A blank line is displayed as a paragraph break, but a simple line break is not.""; stop the action. Section - cow catching Gelett has a number called the mooness. Instead of taking Gelett: increment the mooness of Gelett; if the mooness of Gelett is one: say ""Gelett moos once.""; else: say ""Gelett moos [mooness of Gelett in words] times.""; Volume 2 - the turn cycle Every turn: say ""A turn passes[one of][or] placidly[or] idly[or] tediously[at random]."" " Inform 7 """Hello Deductible"" by ""I.F. Author"" The story headline is ""An Interactive Example"". The Living Room is a room. ""A comfortably furnished living room."" The Kitchen is north of the Living Room. The Front Door is south of the Living Room. The Front Door is a door. The Front Door is closed and locked. The 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. A briefcase is carried by the insurance salesman. The description is ""A slightly worn, black briefcase."" Understand ""case"" as the briefcase. The insurance paperwork is in the briefcase. The description is ""Page after page of small legalese."" Understand ""papers"" or ""documents"" or ""forms"" as the paperwork. Instead of listening to the insurance salesman: say ""The salesman bores you with a discussion of life insurance policies. From his briefcase he pulls some paperwork which he hands to you.""; move the insurance paperwork to the player." Inform """" true true https://en.wikipedia.org/wiki/Inform 2 5 Inform inform7.com Inform 7 https://github.com/erkyrath/language-inform7 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 Inform 7 "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" m3db m3db 2016 Xi Chen 14 database https://www.m3db.io/ 0 v1.5.0 546 0 17 23540 false 0 https://github.com/m3db/m3 database 2016 2024 2016 113 450 4709 211 false 2016 2025 8808 160 3603 108 176187 2018 A distributed time series database. A distributed time series database. https://github.com/m3db A distributed time series database. go markdown yaml bourne-shell svg protobuf json javascript dockerfile html css make hcl toml bash thrift assembly-language true 6221 0 31 1 false 1 true United States https://github.com/m3db/m3 0 0 m3db.io argdown Argdown 2014 20 textMarkup https://argdown.org/ 0 547 1 11 23540 true 0 https://github.com/christianvoigt/argdown textMarkup 2014 2024 2014 27 28 860 149 false 2014 2025 997 8 661 101 711553 https://argdown.org/sandbox/html 2018 Karlsruhe Institute of Technology typescript markdown json javascript svg css html xml bourne-shell stylus powershell true 954 0 34 false true Germany " # Welcome to Argdown! [Intro]: Argdown is a simple syntax for defining argumentative structures, inspired by Markdown. + Writing a *pro & contra list* in Argdown is as simple as writing a twitter message (actually we are right in the middle of one). + But you can also **logically reconstruct** more complex dialectical relations between arguments or dive into the details of their premise-conclusion structures. + Finally, you can export Argdown as a graph and create **argument maps** of whole debates. This Argdown document only demonstrates the basic syntax elements. The argument map produced is a ""bogus debate"". To read a reconstruction of a *real* debate, select one of the **example debates** by moving your mouse to the *""Examples""* button on the upper left, above the text editor. ## Argdown Basics This is a normal statement with __bold__ and _italic_ text, a #tag and a [link](https://github.com/christianvoigt/argdown-parser). [Statement 1]: Another statement (after a blank line), this time with a title defined in square brackets. We can use the title to refer to this statement later or mention it in other statements. #(Another tag) [Statement 2]: Let's do that now: The previous statement was @[Statement 1]. + : Statements can be supported by __arguments__. Arguments are defined by using angle brackets. #tag - : This arguments attacks @[Statement 2]. #tag - : Arguments can also be supported or attacked. #yet-another-tag We can also do that the other way around: [Intro] -> Headings can be used to group arguments and statements together. In the map these groups are visualized as grey boxes. Tags are visualized by the colors of the arguments and statements in the map. ### Argument reconstructions So far, we have ignored the internal structure of arguments. Arguments consist of premises from which conclusions are inferred. We can precisely define this premise-conclusion structure with Argdown: (1) First premise (this is is a normal statement and you can do everything with it, we have done with the statements above). (2) [Statement 2]: We have already defined a statement with this title. Argdown allows you to add multiple statements to the same ""equivalence class"" by giving them the same title. The statements will then be treated as logically equivalent. -- Some inference rule (Some additional info: 1,2) -- (3) And now the conclusion -> Outgoing relations of the conclusion, are also interpreted as outgoing relations of the whole argument. +> -> [Statement 1] We can also link to headings: [Back to top](#heading-welcome-to-argdown)" https://github.com/christianvoigt/argdown // true true true true 0 0 argdown.org turing Turing 1982 Ric Holt 27 pl 0 548 4 23539 1023 true 0 pl 153 167 524 0 text source.turing programming false t/Turing.t 62 2016 2017 2 1 1982 euclid pascal sp-k mips txl Turing is a Pascal-like programming language developed in 1982 by Ric Holt and James Cordy, then of University of Toronto, Canada. Turing is a descendant of Euclid, Pascal and SP/k that features a clean syntax and precise machine-independent semantics. Turing 4.1.0 is the latest stable version of Turing. Turing 4.1.1 and Turing 4.1.2 do not allow for stand alone .EXE files to be created and versions before Turing 4.1.0 have outdated syntax and outdated functions. 2001 61 51 281 31105 t tu t 525 0 30 1 https://turing.ml/v0.21/docs/using-turing/ text https://github.com/antlr/grammars-v4/tree/master/turing http://www.rosettacode.org/wiki/Category:Turing Canada "% Accepts a number and calculates its factorial function factorial (n: int) : real if n = 0 then result 1 else result n * factorial (n - 1) end if end factorial var n: int loop put ""Please input an integer: "" .. get n exit when n >= 0 put ""Input must be a non-negative integer."" end loop put ""The factorial of "", n, "" is "", factorial (n)" "put ""Hello World"" " "% Accepts a number and calculates its factorial function factorial (n: int) : real if n = 0 then result 1 else result n * factorial (n - 1) end if end factorial var n: int loop put ""Please input an integer: "" .. get n exit when n >= 0 put ""Input must be a non-negative integer."" end loop put ""The factorial of "", n, "" is "", factorial (n)" "% Accepts a number and calculates its factorial function factorial (n: int) : real if n = 0 then result 1 else result n * factorial (n - 1) end if end factorial var n: int loop put ""Please input an integer: "" .. get n exit when n >= 0 put ""Input must be a non-negative integer."" end loop put ""The factorial of "", n, "" is "", factorial (n)" Turing % put """" true true true false true https://en.wikipedia.org/wiki/Turing_(programming_language) 34 12 https://hopl.info/showlanguage.prx?exp=1023 Turing https://github.com/Alhadis/language-turing year|publisher|title|authors|isbn13\n1995|Springer|Programming with Turing and Object Oriented Turing (Mathematics)|Grogono, Peter|9780387945170\n1984|Brady (robert J.) Co ,u.s.|Introduction To Computer Science Using The Turing Programming Language|R.c. Holt; J.n.p. Hume|9780835931670\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\n2005|The MIT Press|Turing (A Novel about Computation)|Papadimitriou, Christos H.|9780262250788\n1989-05-01T00:00:01Z|W H Freeman & Co|Turing Omnibus: 61 Excursions in Computer Science|Dewdney, A. K.|9780716781547\n2016|Springer|Turing Computability: Theory and Applications (Theory and Applications of Computability)|Soare, Robert I.|9783642319327\n2016|Springer|Turing Computability: Theory and Applications (Theory and Applications of Computability)|Soare, Robert I.|9783642319334\n2007|Springer|Parsing the Turing Test: Philosophical and Methodological Issues in the Quest for the Thinking Computer|Jan Naudts|9781402067105\n2012|Birkhäuser|Neural Networks and Analog Computation: Beyond the Turing Limit (Progress in Theoretical Computer Science)|Siegelmann, Hava T.|9781461207078\n2013|人民邮电出版社|Turing Programming Series : SQL must know will be ( 4th Edition )(Chinese Edition)|[美]Ben Forta 钟鸣，刘晓霞|9787115313980\n2020|Princeton University Press|A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) (Annals of Mathematics Studies)|Downey, Rod and Greenberg, Noam|9780691200217\n1987|Addison-Wesley|Structured Induction in Expert Systems (The Turing Institute Press)|Shapiro, Alen D.|9780201178135\n2013|人民邮电出版社|Turing Programming Series : C # Graphic Guide ( 4th Edition )(Chinese Edition)|[美]Daniel M.Solis 姚琪琳，苏林，朱晔，等|9787115320902\n2003-04-29T00:00:01Z|CreateSpace Independent Publishing Platform|COSMOS AND CONSCIOUSNESS: Quantum Computers, SuperStrings, Programming, Egypt, Quarks, Mind Body Problem, and Turing Machines|Blaha, Stephen|9780972079549\n2002-07-18T00:00:01Z|Janus Associates Inc.|Cosmos and Consciousness: Quantum Computers, SuperStrings, Programming, Egypt, Quarks, Mind Body Problem, and Turing Machines Second Edition|Blaha, Stephen|9780972079556\n2014|Springer|Programming with Turing and Object Oriented Turing|Grogono, Peter|9781461242390\n2014|People Post Press|Turing Programming Series: Learning R(Chinese Edition)|[ MEI ] Richard.Cotton|9787115351708\n20170530|Springer Nature|Philosophical Explorations of the Legacy of Alan Turing|Manuel Gessner|9783319532806\n2001|North Holland|Mathematical Logic (Collected Works of A.M. Turing Book 4)|Gandy, R. O. and Yates, C. E. M.|9780080535920\n2013|People Post Press|Turing Programming Series: Ming Xie C language(Chinese Edition)|[ RI ] CHAI TIAN WANG YANG|9787115299796\n2013-04-01|People Post Press|Turing Programming Series: Learn the regular expression(Chinese Edition)|[ MEI ]Michael Fitzgerald|9787115311498\n2014|People Post Press|Marrow Turing programming books Code: Programming Language Core Concepts(Chinese Edition)|[ RI ] XI WEI TAI HE|9787115361530\n2013|Springer|Computing Nature: Turing Centenary Perspective (Studies in Applied Philosophy, Epistemology and Rational Ethics Book 7)|Gordana Dodig-Crnkovic|9783642372254\n2014|People Post Press|Turing programming books 30 days of software development: Farewell to embrace agile waterfall(Chinese Edition)|[ MEI ] Ken Schwaber . Jeff Sut...|9787115338891\n2013|People Post Press|Pattern-Oriented Software Architecture Volume 2: Concurrency and networking Turing programming object model series(Chinese Edition)|[ MEI ]Douglas Schmidt , [ DE ]Michael Stal , [ DE ]Hans Rohnert|9787115332141\n2012||Turing (programming Language)|Emory Christer|9786201736108\n2001|Holt Software Associates|Introduction To Programming In Turing|J. N. P. Hume|9780921598428\n||Method Of Lines Analysis Of Turing Models|W. E. Schiesser|9789813226708\n1988|Prentice Hall|The Turing Programming Language: Design And Definition|Richard C. Holt and Philip A. Matthews and J. Alan Rosselet and James R. Cordy|9780139331367\n20170628|World Scientific Publishing|Method Of Lines Analysis Of Turing Models|William E Schiesser|9789813226715\n1984|Reston Pub. Co|Introduction To Computer Science Using The Turing Programming Language|Holt and R. C|9780835931687\n2002|Pingree Hill Pub 2002-06-01|Cosmos And Consciousness: Quantum Computers, Superstrings, Programming, Egypt, Quarks, Mind Body Problem, And Turing Machines|Blaha and Stephen|9780972079518\n2000|1st Books Library|Cosmos And Consciousness: Quantum Computers, Superstrings, Mysticism, C++ Programming, Egypt, Quarks, Mind-body Problem, Aliens, Linguistics, And Turing Machines|Blaha, Stephen.|9780759602083 Turing year|title|doi|citations|influentialCitations|authors|paperId\n1988|The Turing programming language|10.1145/53580.53581|114|7|R. Holt and J. Cordy|7306df441c399654c31cce482fb3ad6df48b38df\n1994|Turing completeness in the language of genetic programming with indexed memory|10.1109/ICEC.1994.350027|90|6|Astro Teller|ba47de24709d420f40237974c70a3b36193f2e5e\n1993|Real-time deques, multihead Turing machines, and purely functional programming|10.1145/165180.165225|29|3|Tyng-Ruey Chuang and B. Goldberg|9f7bd031383264d27aa7806176ecd82192ba8138\n2020|Can GPT-3 Pass a Writer’s Turing Test?|10.22148/001C.17212|19|0|Katherine Elkins and Jon Chun|ee2a011810b5442c28b66f97422564de02a4e319\n2014|Mathematical programming: Turing completeness and applications to software analysis|10.1007/s10878-014-9715-3|16|0|Leo Liberti and F. Marinelli|9e2600e25dac039040d699bdf5057233e7bb8bfa\n2020|Verified programming of Turing machines in Coq|10.1145/3372885.3373816|16|0|Y. Forster and F. Kunze and Maximilian Wuttke|5ad36475e45e3f17be1d5cd5a77154cfba2a6994\n1994|Introducing undergraduates to object orientation using the Turing language|10.1145/191029.191160|6|0|R. Holt|4ebbe3cbae981a963a41ada74c733beae64c5d79\n2002|Turing Universality of Recursive Patterns for Parallel Programming|10.1142/S012962640200094X|5|0|J. Fischer and S. Gorlatch|68fdb6c171d4c0915cc418965a00a0f6f9316eb5\n2012|Higher Types, Finite Domains and Resource-bounded Turing Machines|10.1093/logcom/exq009|4|0|L. Kristiansen|91ccdad2fa0eb9c0d8db41545fa5f6cc64c452d1\n2008|Using Genetic Programming for Turing Machine Induction|10.1007/978-3-540-78671-9_30|4|1|A. Naidoo and N. Pillay|7d6d7d9a291f0d15ef10abbd12daf2cf4cb93e2d\n2014|Turing machine approach to runtime software adaptation|10.7494/csci.2014.15.3.293|2|0|J. Rudy|51524898bc4db7b543126e498cf75a813958cf71\n2020|Declarative and Imperative Approaches for Proving Turing Completeness of SPIDER|10.1145/3407982.3407993|1|0|E. Golemanova and T. Golemanov|27709fa8bb403d1a0198a88c5a4f34e9e4b1b362 sile sile 2012 16 textMarkup https://sile-typesetter.org 0 0.14.17 549 0 18 23530 true 0 https://github.com/sile-typesetter/sile textMarkup 2013 2024 2012 49 97 1624 305 false 2012 2025 6921 84 969 57 134055 2014 SILE is a typesetting system. Its job is to produce beautiful printed documents from raw content. SILE is a typesetting system. Its job is to produce beautiful printed documents from raw content. Worldview Center for Intercultural Studies SILE is a typesetting system. Its job is to produce beautiful printed documents from raw content. lua yaml xml c m4 bourne-shell diff nix svg markdown make cmake json cpp tex objective-c dockerfile javascript true 2001 0 35 latex false 0 true Australia https://news.ycombinator.com/item?id=22393099 https://github.com/sile-typesetter/sile 0 0 sile-typesetter.org nix Nix 2003 21 packageManager 84 550 2 23526 false 84 ace ante asciidots asterius-compiler austral borgo candy carp catala chisel clash cloc coq crystal dex dhall differential-datalog ecr emscripten enso erg expresso factor fardlang felix forest-lang fp3 fstar futhark ghc gwion hhvm hobbes ibis idris imp-lang jakt jank k-framework ladybird lamdu-editor lamdu lawvere lfortran ligo lil luna megaparsec michelson minizinc mlscript mobl-lang monte mushroom odin oil openscad pact poke popr prql pygments quint ramen raptorjit reason reflex-framework rholang roc savi sile simplictiy slab slick surrealdb terra ucg uiua unison urweb vcpkg-pm wasmer worst zest packageManager 1808 2673 3 "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""" nixos nix source.nix programming false 36 2014 2017 1 5 49610 nix.py NixOS Foundation nix nix true 200 0 32 nix text http://www.rosettacode.org/wiki/Category:Nix The Netherlands https://nixos.org/ "{ boot.loader.grub.device = ""/dev/sda""; fileSystems.""/"".device = ""/dev/sda1""; services.sshd.enable = true; }" "{ stdenv, fetchurl, fetchgit, openssl, zlib, pcre, libxml2, libxslt, expat , rtmp ? false , fullWebDAV ? false , syslog ? false , moreheaders ? false, ...}: let version = ""1.4.4""; mainSrc = fetchurl { url = ""http://nginx.org/download/nginx-${version}.tar.gz""; sha256 = ""1f82845mpgmhvm151fhn2cnqjggw9w7cvsqbva9rb320wmc9m63w""; }; rtmp-ext = fetchgit { url = git://github.com/arut/nginx-rtmp-module.git; rev = ""1cfb7aeb582789f3b15a03da5b662d1811e2a3f1""; sha256 = ""03ikfd2l8mzsjwx896l07rdrw5jn7jjfdiyl572yb9jfrnk48fwi""; }; dav-ext = fetchgit { url = git://github.com/arut/nginx-dav-ext-module.git; rev = ""54cebc1f21fc13391aae692c6cce672fa7986f9d""; sha256 = ""1dvpq1fg5rslnl05z8jc39sgnvh3akam9qxfl033akpczq1bh8nq""; }; syslog-ext = fetchgit { url = https://github.com/yaoweibin/nginx_syslog_patch.git; rev = ""165affd9741f0e30c4c8225da5e487d33832aca3""; sha256 = ""14dkkafjnbapp6jnvrjg9ip46j00cr8pqc2g7374z9aj7hrvdvhs""; }; moreheaders-ext = fetchgit { url = https://github.com/agentzh/headers-more-nginx-module.git; rev = ""refs/tags/v0.23""; sha256 = ""12pbjgsxnvcf2ff2i2qdn39q4cm5czlgrng96j8ml4cgxvnbdh39""; }; in stdenv.mkDerivation rec { name = ""nginx-${version}""; src = mainSrc; buildInputs = [ openssl zlib pcre libxml2 libxslt ] ++ stdenv.lib.optional fullWebDAV expat; patches = if syslog then [ ""${syslog-ext}/syslog_1.4.0.patch"" ] else []; configureFlags = [ ""--with-http_ssl_module"" ""--with-http_spdy_module"" ""--with-http_xslt_module"" ""--with-http_sub_module"" ""--with-http_dav_module"" ""--with-http_gzip_static_module"" ""--with-http_secure_link_module"" ""--with-ipv6"" # Install destination problems # ""--with-http_perl_module"" ] ++ stdenv.lib.optional rtmp ""--add-module=${rtmp-ext}"" ++ stdenv.lib.optional fullWebDAV ""--add-module=${dav-ext}"" ++ stdenv.lib.optional syslog ""--add-module=${syslog-ext}"" ++ stdenv.lib.optional moreheaders ""--add-module=${moreheaders-ext}""; preConfigure = '' export NIX_CFLAGS_COMPILE=""$NIX_CFLAGS_COMPILE -I${libxml2 }/include/libxml2"" ''; # escape example postInstall = '' mv $out/sbin $out/bin ''' ''${ ${ if true then ${ """" } else false } ''; meta = { description = ""A reverse proxy and lightweight webserver""; maintainers = [ stdenv.lib.maintainers.raskin]; platforms = stdenv.lib.platforms.all; inherit version; }; }" Nix rec with let in inherit assert if else then ... true true true 0 0 Nix https://github.com/wmertens/sublime-nix Nix chisel chisel 2015 14 hardwareDescriptionLanguage https://www.chisel-lang.org/ 0 v7.0.0-M1 551 0 14 23525 true 0 https://github.com/freechipsproject/chisel3 hardwareDescriptionLanguage 2015 2024 2015 151 579 3854 462 false 2015 2025 10399 231 826 134 33422 2016 University of California Berkeley scala markdown yaml scheme svg javascript json python make css cpp nix dockerfile xml true 5824 0 28 false 7 true United States https://chisel.eecs.berkeley.edu/ https://twitter.com/chisel_lang https://github.com/freechipsproject/chisel3 0 0 chisel-lang.org reia Reia 2008 20 pl http://reia-lang.org 0 552 1 5 23525 true 0 https://github.com/tarcieri/reia pl 2008 2024 2008 14 41 777 7 false 2008 2012 1465 14 110 8 7860 2008 https://github.com/tarcieri/reia/issues reason erlang bourne-shell ruby markdown true 916 0 28 false United States http://www.unlimitednovelty.com/2011/06/why-im-stopping-work-on-reia.html "# Hello, world! ""Hello, world!"".puts() # Assignment number = 42 opposite = true # Conditions number = -42 if opposite # Lists (stored as immutable singly-linked lists) list = [1, 2, 3, 4, 5] # Tuples (think of them as immutable arrays) tuple = (1, 2, 3, 4, 5) # Atoms (known as symbols to Ruby people) # Think of them as an open-ended enumeration atom = :up_and_atom # Dicts (also known as hashes to Ruby people) dict = {:foo => 1, :bar => 2, :baz => 3} # Strings (unlike Erlang, Reia has a real String type!) string = ""I'm a string! Woohoo I'm a string! #{'And I interpolate too!'}"" # Ranges range = 0..42 # Funs (anonymous functions, a.k.a. lambdas, procs, closures, etc.) # Calling me with plustwo(40) would return 42 plustwo = fun(n) { n + 2 } # Modules (collections of functions) # Calling Plusser.addtwo(40) would return 42 module Plusser def addtwo(n) n + 2 end end # Classes (of immutable objects. Once created objects can't be changed!) class Adder # Reia supports binding instance variables directly when they're passed # as arguments to initialize def initialize(@n); end def plus(n) @n + n end end # Instantiate classes by calling Classname(arg1, arg2, ...) # For you Ruby people who want Classname.new(...) this is coming soon! fortytwo = Adder(40).plus(2) # Function references can be obtained by omitting parens from a function call, # like JavaScript or Python numbers = [1,2,3] reverser = [1,2,3].reverse # Function references can be invoked just like lambdas reversed = reverser() # reversed is now [3,2,1] # You can add a ! to the end of any method to rebind the method receiver to # the return value of the given method minus the bang. numbers.reverse!() # numbers is now [3,2,1] # List comprehensions doubled = [n * 2 for n in numbers] # doubled is [6,4,2]" https://github.com/tarcieri/reia # puts = true true true 0 0 reia-lang.org 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 sympy SymPy 2007 Ondrej Certik 13 library mathematics https://www.sympy.org/ 0 553 0 19 23521 true 0 https://github.com/sympy/sympy library 2010 2024 2007 295 4357 12652 5104 false 2007 2025 60155 1358 2029 195 839796 2007 python restructuredtext svg markdown jupyter-notebook perl yaml bourne-shell xslt json tex xml make toml css javascript html dockerfile scheme true 27103 0 34 mathematica sagemath 1 false https://twitter.com/sympy https://github.com/sympy/sympy https://en.wikipedia.org/wiki/SymPy 0 0 sympy.org blitzmax BlitzMax 2014 26 pl 0 554 1 15 23519 true 0 https://github.com/blitz-research/blitzmax pl 46 52 219 0 bmax text source.blitzmax programming 2014 2024 2014 19 55 151 8 false 35 2009 2016 1 2 basic.py 2014 2023 99 9 2272 42 732859 Blitz Research bmx bmx c cpp lua assembly-language objective-c html make xml css bourne-shell objective-cpp cmake ini wasm perl true 526 0 41 false text http://www.rosettacode.org/wiki/Category:BlitzMax New Zealand SuperStrict Framework Brl.StandardIO Type TMyType Field property:int Function A:int(param:int) 'do nothing End Function Method B:int(param:int) 'do nothing End Method End Type Global my:TMyType = new TMyType ?Win32 my.A() my.B() ?Linux my.B() my.A() ? BlitzMax https://github.com/blitz-research/blitzmax true true true true true true true true 6 0 BlitzMax https://github.com/textmate/blitzmax.tmbundle 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 BlitzMax 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 whiley Whiley 2009 David J. Pearce 33 pl http://whiley.org/ 0 v0.10.18 555 2 3 23518 true 0 https://github.com/Whiley/WhileyCompiler pl 1 1 2 text source.whiley programming 2010 2024 2010 16 35 216 42 false w/Whiley.whiley whiley.py 2010 2022 8032 23 1539 48 34249 http://whileylabs.com 2009 2018 "Whiley is an experimental programming language that combines features from the functional and imperative paradigms, and supports formal specification through function preconditions, postconditions and loop invariants. The language uses flow-sensitive typing also known as ""flow typing."" The Whiley project began in 2009 in response to the ""Verifying Compiler Grand Challenge"" put forward by Tony Hoare in 2003. The first public release of Whiley was in June, 2010.Primarily developed by David Pearce, Whiley is an open source project with contributions from a small community. The system has been used for student research projects and in teaching undergraduate classes. It was supported between 2012 and 2014 by the Royal Society of New Zealand's Marsden Fund.The Whiley compiler generates code for the Java virtual machine and can inter-operate with Java and other JVM based languages." 10 9 48747326 A Programming Language with Extended Static Checking A Programming Language with Extended Static Checking A Programming Language with Extended Static Checking whiley whiley whiley java markdown yaml true 416 0 39 1 false 0 true // Define the type of natural numbers type nat is (int x) where x >= 0 public function indexOf(int[] items, int item) -> (int|null index) // If int returned, element at this position matches item ensures index is int ==> items[index] == item // If int returned, element at this position is first match ensures index is int ==> no { i in 0 .. index | items[i] == item } // If null returned, no element in items matches item ensures index is null ==> no { i in 0 .. |items| | items[i] == item }: // nat i = 0 // while i < |items| // No element seen so far matches item where no { j in 0 .. i | items[j] == item }: // if items[i] == item: return i i = i + 1 // return null "import std::ascii import std::io method main(ascii::string[] args): io::println(""Hello World"") " Whiley https://twitter.com/whileylang Whiley https://github.com/Whiley/WhileyCompiler // io::println """" true true true true true true true true false true https://en.wikipedia.org/wiki/Whiley_(programming_language) 0 0 whiley.org Whiley Whiley uiua Uiua 2023 Kai Schmidt 16 pl https://www.uiua.org/ 0 0.11.1 556 0 10 23516 true 0 https://github.com/uiua-lang/uiua pl 2023 2024 25 105 1485 10 false 2023 2025 7244 112 205 22 93431 https://www.uiua.org/pad A stack-based array programming language A stack-based array programming language A stack-based array programming language ua rust svg markdown toml yaml json html css nix javascript true 1914 0 28 j 1 false 0 true https://www.uiua.org/docs/ https://news.ycombinator.com/item?id=37673127 https://github.com/uiua-lang/uiua 0 0 objective-cpp Objective C++ 1993 22 pl 37 557 2 23514 true 38 arrow-format bazel blender-app blitzmax cir cmake dlvm factor flow9 gcc generate-ninja ghc gradle groff halide invokator iterm2 kotlin kumir ladybird lwjgl mongodb monkeyx opencv openscad paraview pytorch react-native revolution-programming-language score swift taichi tao3d tensorflow tiscript uno wonkey xtext pl 14642 17925 535669 2 "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.""" obj-c++ or objc++ or objectivec++ objectivec clike text/x-objectivec source.objc++ programming false 499 2005 2018 2 14 objectivecpp objective.py Objective-C++ is simply source code that mixes Objective-C classes and C++ classes. Objective-C++ is simply source code that mixes Objective-C classes and C++ classes. Apple Objective-C++ is simply source code that mixes Objective-C classes and C++ classes. mm mm hh 200 0 26 mm text United States https://en.wikipedia.org/wiki/Objective-C "// grabbed from https://raw.github.com/AOKP/external_webkit/61b2fb934bdd3a5fea253e2de0bcf8a47a552333/Source/WebCore/page/mac/EventHandlerMac.mm /* * Copyright (C) 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include ""config.h"" #include ""EventHandler.h"" #include ""AXObjectCache.h"" #include ""BlockExceptions.h"" #include ""Chrome.h"" #include ""ChromeClient.h"" #include ""ClipboardMac.h"" #include ""DragController.h"" #include ""EventNames.h"" #include ""FocusController.h"" #include ""Frame.h"" #include ""FrameLoader.h"" #include ""FrameView.h"" #include ""KeyboardEvent.h"" #include ""MouseEventWithHitTestResults.h"" #include ""NotImplemented.h"" #include ""Page.h"" #include ""PlatformKeyboardEvent.h"" #include ""Pl" Objective-C++ https://riju.codes/objectivecpp "#import int main() { NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init]; NSLog(@""Hello, world!""); [pool drain]; return 0; } " // /* */ true true true false 0 0 Objective-C++ https://github.com/textmate/objective-c.tmbundle Objective-C++ lasso Lasso 1995 Kyle Jessup 32 pl http://www.lassosoft.com 0 http://www.lassosoft.com/Lasso-News 558 3 23513 true 0 pl 388 435 464 2 "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""" lassoscript text file.lasso programming false 11 2013 2014 4 1 javascript.py 2005 1995 c linux dylan smalltalk scala html php python java sql unicode utf-8 cfml applescript mysql eclipse-editor asp "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." 2004 35 35 429 524247 LassoSoft Inc lasso LassoApp lasso las lasso8 lasso9 lasso lasso[89] lasso LassoApp false 396 142 39 1 https://docs.lassox.com/ text http://www.rosettacode.org/wiki/Category:Lasso Canada // Hello world in Lasso Hello world! " /** trait_json_serialize Objects with this trait will be assumed to convert to json data when its ->asString method is called */ define trait_json_serialize => trait { require asString() } define json_serialize(e::bytes)::string => ('""' + (string(#e)->Replace(`\`, `\\`) & Replace('\""', '\\""') & Replace('\r', '\\r') & Replace('\n', '\\n') & Replace('\t', '\\t') & Replace('\f', '\\f') & Replace('\b', '\\b') &) + '""') define json_serialize(e::string)::string => ('""' + (string(#e)->Replace(`\`, `\\`) & Replace('\""', '\\""') & Replace('\r', '\\r') & Replace('\n', '\\n') & Replace('\t', '\\t') & Replace('\f', '\\f') & Replace('\b', '\\b') &) + '""') define json_serialize(e::json_literal)::string => (#e->asstring) define json_serialize(e::integer)::string => (#e->asstring) define json_serialize(e::decimal)::string => (#e->asstring) define json_serialize(e::boolean)::string => (#e->asstring) define json_serialize(e::null)::string => ('null') define json_serialize(e::date)::string => ('""' + #e->format(#e->gmt ? '%QT%TZ' | '%Q%T') + '""') /* define json_serialize(e::array)::string => { local(output) = ''; local(delimit) = ''; #e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; } return('[' + #output + ']'); } define json_serialize(e::staticarray)::string => { local(output) = ''; local(delimit) = ''; #e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; } return('[' + #output + ']'); } */ define json_serialize(e::trait_forEach)::string => { local(output) = ''; local(delimit) = ''; #e->foreach => { #output += #delimit + json_serialize(#1); #delimit = ', '; } return('[' + #output + ']'); } define json_serialize(e::map)::string => { local(output = with pr in #e->eachPair select json_serialize(#pr->first->asString) + ': ' + json_serialize(#pr->second)) return '{' + #output->join(',') + '}' } define json_serialize(e::json_object)::string => { local(output) = ''; local(delimit) = ''; #e->foreachpair => { #output += #delimit + #1->first + ': ' + json_serialize(#1->second); #delimit = ', '; } return('{' + #output + '}'); } define json_serialize(e::trait_json_serialize) => #e->asString define json_serialize(e::any)::string => json_serialize('' + #e->serialize + '') // Bil Corry fixes for decoding json define json_consume_string(ibytes::bytes) => { local(obytes) = bytes; local(temp) = 0; while((#temp := #ibytes->export8bits) != 34); #obytes->import8bits(#temp); (#temp == 92) ? #obytes->import8bits(#ibytes->export8bits); // Escape \ /while; local(output = string(#obytes)->unescape) //Replace('\\""', '\""') & Replace('\\r', '\r') & Replace('\\n', '\n') & Replace('\\t', '\t') & Replace('\\f', '\f') & Replace('\\b', '\b') &; if(#output->BeginsWith('') && #output->EndsWith('')); Protect; return serialization_reader(xml(#output - '' - ''))->read /Protect; else( (#output->size == 16 or #output->size == 15) and regexp(`\d{8}T\d{6}Z?`, '', #output)->matches) return date(#output, -Format=#output->size == 16?`yyyyMMdd'T'HHmmssZ`|`yyyyMMdd'T'HHmmss`) /if return #output } // Bil Corry fix + Ke fix define json_consume_token(ibytes::bytes, temp::integer) => { local(obytes = bytes->import8bits(#temp) &, delimit = array(9, 10, 13, 32, 44, 58, 93, 125)) // \t\r\n ,:]} while(#delimit !>> (#temp := #ibytes->export8bits)) #obytes->import8bits(#temp) /while #temp == 125? // } #ibytes->marker -= 1 //============================================================================ // Is also end of token if end of array[] #temp == 93? // ] #ibytes->marker -= 1 //............................................................................ local(output = string(#obytes)) #output == 'true'? return true #output == 'false'? return false #output == 'null'? return null string_IsNumeric(#output)? return (#output >> '.')? decimal(#output) | integer(#output) return #output } // Bil Corry fix define json_consume_array(ibytes::bytes)::array => { Local(output) = array; local(delimit) = array( 9, 10, 13, 32, 44); // \t\r\n , local(temp) = 0; While((#temp := #ibytes->export8bits) != 93); // ] If(#delimit >> #temp); // Discard whitespace Else(#temp == 34); // "" #output->insert(json_consume_string(#ibytes)); Else(#temp == 91); // [ #output->insert(json_consume_array(#ibytes)); Else(#temp == 123); // { #output->insert(json_consume_object(#ibytes)); Else; #output->insert(json_consume_token(#ibytes, #temp)); (#temp == 93) ? Loop_Abort; /If; /While; Return(#output); } // Bil Corry fix define json_consume_object(ibytes::bytes)::map => { Local('output' = map, 'delimit' = array( 9, 10, 13, 32, 44), // \t\r\n , 'temp' = 0, 'key' = null, 'val' = null); While((#temp := #ibytes->export8bits) != 125); // } If(#delimit >> #temp); // Discard whitespace Else((#key !== null) && (#temp == 34)); // "" #output->insert(#key = json_consume_string(#ibytes)); #key = null; Else((#key !== null) && (#temp == 91)); // [ #output->insert(#key = json_consume_array(#ibytes)); #key = null; Else((#key !== null) && (#temp == 123)); // { #output->insert(#key = json_consume_object(#ibytes)); #key = null; Else((#key !== null)); #output->insert(#key = json_consume_token(#ibytes, #temp)); #key = null; Else; #key = json_consume_string(#ibytes); while(#delimit >> (#temp := #ibytes->export8bits)); /while; #temp != 58 ? Loop_Abort; /If; /While; If((#output >> '__jsonclass__') && (#output->Find('__jsonclass__')->isa('array')) && (#output->Find('__jsonclass__')->size >= 2) && (#output->Find('__jsonclass__')->First == 'deserialize')); Return(#output->find('__jsonclass__')->Second->First); Else((#output >> 'native') && (#output >> 'comment') && (#output->find('comment') == 'http://www.lassosoft.com/json')); Return(#output->find('native')); /If; Return(#output); } // Bil Corry fix + Ke fix define json_deserialize(ibytes::bytes)::any => { #ibytes->removeLeading(bom_utf8); //============================================================================ // Reset marker on provided bytes #ibytes->marker = 0 //............................................................................ Local(temp) = #ibytes->export8bits; If(#temp == 91); // [ Return(json_consume_array(#ibytes)); Else(#temp == 123); // { Return(json_consume_object(#ibytes)); else(#temp == 34) // "" return json_consume_string(#ibytes) /If; } define json_deserialize(s::string) => json_deserialize(bytes(#s)) /**! json_literal - This is a subclass of String used for JSON encoding. A json_literal works exactly like a string, but will be inserted directly rather than being encoded into JSON. This allows JavaScript elements like functions to be inserted into JSON objects. This is most useful when the JSON object will be used within a JavaScript on the local page. [Map: 'fn'=Literal('function(){ ...})] => {'fn': function(){ ...}} **/ define json_literal => type { parent string } /**! json_object - This is a subclass of Map used for JSON encoding. An object works exactly like a map, but when it is encoded into JSON all of the keys will be inserted literally. This makes it easy to create a JavaScript object without extraneous quote marks. Object('name'='value') => {name: ""value""} **/ define json_object => type { parent map public onCreate(...) => ..onCreate(:#rest or (:)) } define json_rpccall(method::string, params=map, id='', host='') => { #id == '' ? #host = Lasso_UniqueID; #host == '' ? #host = 'http://localhost/lassoapps.8/rpc/rpc.lasso'; Return(Decode_JSON(Include_URL(#host, -PostParams=Encode_JSON(Map('method' = #method, 'params' = #params, 'id' = #id))))); } " Lasso // Define type define bottles_of_beer => type { // Define internal data data private bottles = 99 // Define private methods private br => '' private s => .bottles != 1 ? 's' | '' // Generate lyrics when object represented as a string public asstring => { local(out = '') // Use Lasso query syntax to generate the lyrics with n in 99 to 1 by -1 do { .bottles = #n #out += .bottles + ' bottle' + .s + ' of beer on the wall, ' + .br #out += .bottles + ' bottle' + .s + ' of beer; ' + .br .bottles-- #out += 'Take one down, pass it around, ' + .br #out += .bottles + ' bottle' + .s + ' of beer on the wall. ' + (.br * 2) } // Return result return #out } } bottles_of_beer // /* */ true false true true true true false https://en.wikipedia.org/wiki/Lasso_(programming_language) 0 4 Lasso lassosoft.com Lasso https://github.com/bfad/Sublime-Lasso Lasso lasso engineer 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 lilypond LilyPond 1996 22 pl http://lilypond.org 0 559 2 23511 true 0 pl 263 298 2059 0 text source.lilypond programming false l/LilyPond.ly 28 2006 2012 4 lilypond.py 1998 1996 scheme metafont postscript python linux freebsd musicxml pdf svg guile latex tex utf-8 emacs-editor org mediawiki sibelius-software 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. 2003 102 286 569 169144 https://gitlab.com/lilypond ly ily ly ly true 731 0 22 text http://www.rosettacode.org/wiki/Category:Lilypond Various \markup { Hello World } LilyPond "\relative c' { f d f a d f e d cis a cis e a g f e }" LilyPond true true true true false https://en.wikipedia.org/wiki/LilyPond 0 0 lilypond.org LilyPond https://github.com/textmate/lilypond.tmbundle LilyPond streem Streem 2014 Yukihiro Matsumoto 14 pl https://github.com/matz/streem 0 560 1 8 23507 true 0 https://github.com/matz/streem pl 2014 2024 356 237 4601 25 false 2014 2022 986 41 63 1 13260 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. 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. Ruby Association,NaCl 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. c markdown yaml make bourne-shell yacc lex dockerfile true 5355 0 37 1 false Japan # channel to broadcast to all clients broadcast = chan() tcp_server(8008) | {s -> broadcast | s # connect to broadcast channel s | broadcast # broadcast incoming message } case class def else emit false if import method namespace new nil return skip true https://github.com/matz/streem 0 0 cloc cloc 2006 Al Danial 13 commandLineApp 0 v1.96.1 561 0 138 23503 false 0 https://github.com/AlDanial/cloc commandLineApp 2015 2024 2015 216 1010 19025 23 false Count Lines Of Code 2015 2025 1203 132 967 6 https://github.com/AlDanial yaml cpp perl c java python bourne-shell pascal fortran-90 csharp javascript typescript make assembly-language go haskell puppet xml markdown r csv dockerfile matlab json sql cobol lua forth tex idris prolog smalltalk visual-basic scss asp.net mustache php mathematica graphql xslt razor logos idl fortran-77 julia elm logtalk cmake racket svg diet rescript zig ruby hoon imba thrift bash xtend odin lean scheme mxml haml swift raml clean saltstack meson jcl fennel nix nim hcl metal raku ring agda robotframework ejs asciidoc information-processing-language wasm glsl squirrel gherkin umka bazel scala objective-c lfe lisp haxe brainfuck toml stata json5 blade smarty jupyter-notebook gleam ttcn solidity pl-m igor-pro roku-brightscript mojo gradle pig f-sharp ecr vtl-lang sugarss starlark restructuredtext slim vala svelte mako kotlin fxml ini elixir chapel plantuml pl-i reason apl dhall tcl ocaml llvmir groovy coldfusion xbase xquery mumps focus true 22188 0 151 1 false 1 true United States http://cloc.sourceforge.net/ https://github.com/AlDanial/cloc 0 0 url URL 1994 Tim Berners-Lee 12 standard schema https://url.spec.whatwg.org/ 0 562 1 23502 true 2 multiaddr uri standard false Uniform Resource Locator 1985 ftp http html utf-8 A Uniform Resource Locator (URL), colloquially termed a web address, is a reference to a web resource that specifies its location on a computer network and a mechanism for retrieving it. A URL is a specific type of Uniform Resource Identifier (URI), although many people use the two terms interchangeably. URLs occur most commonly to reference web pages (http), but are also used for file transfer (ftp), email (mailto), database access (JDBC), and many other applications. Most web browsers display the URL of a web page above the page in an address bar. A typical URL could have the form http://www.example.com/index.html, which indicates a protocol (http), a hostname (www.example.com), and a file name (index.html). 2001 3566 4264 3008 47817022 17850 0 12 1 https://developer.apple.com/documentation/xcode/defining-a-custom-url-scheme-for-your-app 793 https://github.com/antlr/grammars-v4/tree/master/url scheme:[//[user[:password]@]host[:port]][/path][?query][#fragment] https://github.com/whatwg/url https://en.wikipedia.org/wiki/URL 0 0 roc Roc 2020 Richard Feldman 13 pl https://www.roc-lang.org/ 0 563 1 20 23501 true 1 scrapscript https://github.com/roc-lang/roc pl 2019 2024 119 290 3930 1132 false 2019 2025 33140 341 3796 135 507521 https://github.com/roc-lang rust toml markdown yaml zig typescript bourne-shell c nix json javascript html dockerfile svg css swift python java perl ruby true 5143 0 https://exercism.org/tracks/roc 33 1 false United States "credits = List.map(songs, |song| ""Performed by ${song.artist}"" )" https://github.com/roc-lang/roc 0 0 rhai Rhai 2016 Sophia J. Turner 14 pl https://rhai.rs/ 0 564 1 5 23500 true 0 https://github.com/rhaiscript/rhai pl 2016 2025 31 191 4520 44 false 2016 2025 4538 67 411 15 104066 https://rhai.rs/playground A small, fast, easy-to-use scripting language and evaluation engine that integrates tightly with Rust. Builds for most common targets including no-std and WASM. A small, fast, easy-to-use scripting language and evaluation engine that integrates tightly with Rust. Builds for most common targets including no-std and WASM. https://www.sophiajt.com/embedded-scripting-in-rust/ A small, fast, easy-to-use scripting language and evaluation engine that integrates tightly with Rust. Builds for most common targets including no-std and WASM. rust markdown toml yaml json true 5162 0 19 1 false "fn run(a) { let b = a + 1; print(""Hello world! a = "" + a); } run(10); " https://discord.gg/HquqbYFcZ9 https://github.com/rhaiscript/rhai 0 0 rascal Rascal 2013 19 grammarLanguage https://www.rascal-mpl.org/ 0 565 1 15 23496 true 0 https://github.com/usethesource/rascal grammarLanguage 99 107 722 0 text source.rascal programming 2012 2024 2008 28 79 398 513 false 39 2016 2017 4 3 2008 2025 24686 109 1638 1081 240239 2010 2009 linux unix antlr 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. 2010 7 11 23 26118915 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. 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. https://github.com/usethesource 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. rsc java markdown json ini c xml csv yaml html tex ruby python javascript diff bourne-shell true 1001 0 34 false text http://www.rosettacode.org/wiki/Category:Rascal The Netherlands "module Syntax extend lang::std::Layout; extend lang::std::Id; start syntax Machine = machine: State+ states; syntax State = @Foldable state: ""state"" Id name Trans* out; syntax Trans = trans: Id event "":"" Id to; " https://github.com/usethesource/rascal https://en.wikipedia.org/wiki/RascalMPL 0 0 rascal-mpl.org Rascal https://github.com/usethesource/rascal-syntax-highlighting Rascal textile Textile 2002 netcarver 18 textMarkup https://textile-lang.com 0 v4.1.0 566 2 7 23490 true 0 https://github.com/textile/php-textile textMarkup 0 true 0 textile textile text/x-textile none prose 2010 2024 2010 27 44 213 24 false 2010 2025 1539 13 98 3 15066 2002 markdown php perl python ruby javascript csharp html qt ios android 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. 2005 141 75 496 2375629 textile yaml php markdown dockerfile xml make json true 1135 0 25 1 false 4 true text 8426 textile """"""" _This_ is a *test.* * One * Two * Three Link to ""Slashdot"":http://slashdot.org/ """"""" https://riju.codes/textile Hello, world! https://github.com/textile/php-textile https://en.wikipedia.org/wiki/Textile_(markup_language) 0 0 Textile csound Csound 1985 25 pl http://csound.com 0 567 2 23489 5383 true 0 pl 57 65 50 0 csound-orc csound_orchestra source.csound programming false 207 2015 2018 3 5 csound.py 2008 1985 c saol python java lisp tcl haskell bison max emacs-editor 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. 2002 60 111 309 149998 MIT csd sco orc udo csd true 521 0 28 text United States "sr = 44100 kr = 44100 ksmps = 1 nchnls = 2 ; pvanal -n 512 -w 8 allglass1-L.wav allglass1-L.pvc ; pvanal -n 512 -w 8 allglass1-R.wav allglass1-R.pvc instr 1 ktime line 0, p3, 17.5018 arL pvoc ktime, 1, ""allglass1-L.pvc"" arR pvoc ktime, 1, ""allglass1-R.pvc"" out arL, arR endin " Csound Document csound -W -d -o tone.wav sr = 96000 ; Sample rate. kr = 9600 ; Control signal rate. ksmps = 10 ; Samples per control signal. nchnls = 1 ; Number of output channels. instr 1 a1 oscil p4, p5, 1 ; Oscillator: p4 and p5 are the arguments from the score, 1 is the table number. out a1 ; Output. endin f1 0 8192 10 1 ; Table containing a sine wave. Built-in generator 10 produces a sum of sinusoids, here only one. i1 0 1 20000 1000 ; Play one second of one kHz at amplitude 20000. e ; true true true false https://en.wikipedia.org/wiki/Csound 5 2 https://hopl.info/showlanguage.prx?exp=5383 csound.com Csound https://github.com/nwhetsell/language-csound 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 Csound 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 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 melody Melody 2022 Yoav Lavi 14 pl https://yoav-lavi.github.io/melody/book/ 0 0.19.0 568 0 15 23488 true 0 https://github.com/yoav-lavi/melody pl 2022 2024 2022 17 55 4617 8 false 2022 2024 776 13 172 5 14737 Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable https://github.com/yoav-lavi/melody/issues Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable rust java markdown json typescript toml javascript yaml kotlin svg gradle css bourne-shell html xml true 4797 0 29 1 false 0 true Israel https://reddit.com/r/ProgrammingLanguages/comments/stpvpn/melody_a_language_that_compiles_to_regular/ https://github.com/yoav-lavi/melody 0 0 slim-framework Slim Framework 2013 13 framework https://www.slimframework.com 0 4.13.0 569 1 5 23487 false 0 https://github.com/slimphp/Slim framework 2010 2024 503 1943 11884 10 false 2010 2024 5048 315 145 8 17132 https://github.com/slimphp php markdown yaml xml json true 18030 0 18 false 4 true https://www.slimframework.com/docs/v4/ United States and United Kingdom and Canada "get('/hello/{name}', function (Request $request, Response $response, array $args) { $name = $args['name']; $response->getBody()->write(""Hello, $name""); return $response; }); $app->run();" https://github.com/slimphp/Slim 0 0 comby comby 2019 Rijnard van Tonder 15 grammarLanguage https://comby.dev/ 0 1.8.1 570 1 11 23486 true 0 https://github.com/comby-tools/comby grammarLanguage 2019 2024 2019 23 59 2344 74 false 2019 2024 634 14 345 3 35929 2019 https://github.com/comby-tools ocaml markdown bourne-shell json c toml dockerfile diff go make yaml true 2537 0 26 1 false 1 true United States if (:[_] && :[height] :[_]) https://twitter.com/rvtond https://github.com/comby-tools/comby 0 0 comby.dev minizinc MiniZinc 2012 20 pl http://www.minizinc.org/ 0 2.8.4 571 1 18 23481 true 0 https://github.com/MiniZinc/libminizinc pl 2015 2024 2012 39 78 494 94 false 2012 2025 7205 64 2464 31 312808 Monash University cpp restructuredtext python cmake json svg html markdown yaml xml c css nix javascript make tex bash ini true 794 0 38 false 2 true text MiniZinc http://www.rosettacode.org/wiki/Category:MiniZinc minizinc Australia https://riju.codes/minizinc "solve satisfy; output [""Hello, world!\n""]; " https://twitter.com/minizinc https://github.com/MiniZinc/libminizinc 1 0 minizinc.org year|publisher|title|authors|isbn13\n2020|Springer|Building Decision Support Systems: Using Minizinc|Wallace, Mark|9783030417314 papyrus Papyrus 2015 14 pl 0 572 1 23480 true 0 pl 58 79 3518 0 text source.papyrus.skyrim programming false 523 2014 2017 3 3 1830 isbn doi 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. 2002 868 1929 1920 23664 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. 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. Bethesda Softworks LLC 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. psc csharp 4560 0 14 text United States https://www.creationkit.com/index.php?title=Category:Papyrus Scriptname vMFX_FXPlugin extends Quest https://github.com/joelday/papyrus-lang https://en.wikipedia.org/wiki/Papyrus 0 0 Papyrus https://github.com/Kapiainen/SublimePapyrus Papyrus ghc GHC 1992 Kevin Hammond 18 compiler https://www.haskell.org/ghc/ 0 https://www.haskell.org/ghc/blog.html https://www.haskell.org/ghc/download.html 9.10.1 573 0 31 23480 true 0 https://gitlab.haskell.org/ghc/ghc compiler false Glasgow Haskell Compiler 2005 2025 92583 1091 24648 280 2096537 University of Glasgow haskell c make html restructuredtext m4 markdown javascript python bourne-shell json tex bash yaml assembly-language css xml nix cpp svg typescript logos yacc objective-c pascal racket d perl objective-cpp haxe lisp true 1112 0 50 haskell 1 false 9 true https://downloads.haskell.org/ghc/latest/docs/users_guide/ Scotland https://gitlab.haskell.org/ghc/ghc https://en.wikipedia.org/wiki/Glasgow_Haskell_Compiler 0 0 p4 P4 2014 22 pl http://p4.org 0 574 1 23478 true 0 pl 29 38 574 0 text source.p4 programming false 30 2016 2017 2 3 2002 2014 c python 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”. 2015 89 6 28 46347117 Barefoot Networks && Intel && Stanford University && Princeton University && Google && Microsoft p4 p4 true 666 0 31 p4 text United States "// Copyright 2015, Barefoot Networks, Inc. // // Licensed under the Apache License, Version 2.0 (the ""License""); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an ""AS IS"" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. action set_mirror_id(session_id) { clone_ingress_pkt_to_egress(session_id); } table mirror_acl { reads { ingress_metadata.if_label : ternary; ingress_metadata.bd_label : ternary; /* ip acl */ ingress_metadata.lkp_ipv4_sa : ternary; ingress_metadata.lkp_ipv4_da : ternary; ingress_metadata.lkp_ip_proto : ternary; /* mac acl */ ingress_metadata.lkp_mac_sa : ternary; ingress_metadata.lkp_mac_da : ternary; ingress_metadata.lkp_mac_type : ternary; } actions { nop; set_mirror_id; } size : INGRESS_MIRROR_ACL_TABLE_SIZE; } " https://twitter.com/p4org // /* */ true true true false https://en.wikipedia.org/wiki/P4_(programming_language) 0 0 p4.org P4 https://github.com/TakeshiTseng/atom-language-p4 P4 clay clay 2010 KS Sreeram and Joe Groff 24 pl http://claylabs.com/clay 0 v0.1.2 575 1 14 23476 true 0 https://github.com/jckarter/clay pl 2010 2024 2010 25 33 402 63 false c_like.py 2010 2014 8315 40 1530 31 412353 https://claylabs.com/ clay cpp make xml python cmake c java markdown vim-script go bourne-shell css svg lisp true 543 0 40 2 false 0 true Various Clay https://bitbucket.org/kssreeram/clay/src/default/ "import printer.(println); factorial1(n) { if (n == 0) return 1; return n*factorial1(n-1); } factorial2(n) { var p = 1; again : if (n == 0) return p; p *: n; n -: 1; goto again; } factorial3(n) { var p = 1; while (true) { if (n == 0) break; p *: n; n -: 1; } return p; } factorial4(n) { var p = 1; for (i in range(n)) p *: i+1; return p; } main() { var n = 7; n -: 1; var f = factorial4(n); println(""factorial("", n, "") = "", f); return 0; }" Clay https://twitter.com/claylabs https://github.com/jckarter/clay println true true true true true true 0 0 wasp-lang Wasp 2019 Martin Šošić 13 pl https://wasp-lang.dev/ 0 v0.13.2 576 0 19 23475 true 0 https://github.com/wasp-lang/wasp pl 2020 2024 2018 65 1148 12925 503 false Web App Specification Language 2018 2025 3423 109 4696 645 543377 typescript haskell markdown javascript json jsx sql css svg toml html yaml dockerfile bourne-shell tex xml bash logos powershell true 16480 0 32 1 false 0 true https://www.reddit.com/r/ProgrammingLanguages/comments/f7r8n9/brother_and_i_are_developing_a_declarative_dsl/ https://github.com/wasp-lang/wasp 0 0 wasp-lang.dev e E 1997 Mark S. Miller 31 pl http://erights.org/ 0 577 4 23474 1990 true 0 pl 291 304 354 0 rune text none programming false e/E.e 1998 1997 gnu-e joule java python pascal 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. 2005 77 75 104 1377046 E is an object-oriented programming language for secure distributed computing. E is an object-oriented programming language for secure distributed computing. Combex, Inc. E is an object-oriented programming language for secure distributed computing. e e true 406 0 34 1 false text 82 http://www.rosettacode.org/wiki/Category:E United States # E snippet from # http://wiki.erights.org/wiki/Walnut/Distributed_Computing/Promises when (tempVow) -> { #...use tempVow } catch prob { #.... report problem } finally { #....log event } "println(""Hello World"") " def makeMint(name) :any { def [sealer, unsealer] := makeBrandPair(name) def mint { to makePurse(var balance :(int >= 0)) :any { def decr(amount :(0..balance)) :void { balance -= amount } def purse { to getBalance() :int { return balance } to sprout() :any { return mint.makePurse(0) } to getDecr() :any { return sealer.seal(decr) } to deposit(amount :int, src) :void { unsealer.unseal(src.getDecr())(amount) balance += amount } } return purse } } return mint } E # println """" true true true false true https://en.wikipedia.org/wiki/E_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=1990 erights.org E E urweb UrWeb 2008 17 pl http://www.impredicative.com/ur/ 0 578 1 18 23470 true 0 https://github.com/urweb/urweb pl 62 64 83 0 Ur/Web or Ur text source.ur programming 2015 2024 2008 35 66 806 61 false 79 2012 2015 2 8 2008 2024 2844 54 1329 54 106700 ur urs standard-ml python c lisp make bourne-shell m4 coq javascript nix css html tex lex markdown lua yaml sql true 1260 0 37 false text "open Parse.String val digit = satisfy isdigit val decimal_of_len n = ds <- count n digit; return (List.foldl (fn d acc => 10*acc + ((ord d)-(ord #""0""))) 0 ds) val date = y <- decimal_of_len 4; char' #""-""; m <- decimal_of_len 2; char' #""-""; d <- decimal_of_len 2; if m > 0 && m <= 12 then return {Year=y, Month=(Datetime.intToMonth (m-1)), Day=d} else fail (* We parse fractions of a second, but ignore them since Datetime doesn't permit representing them. *) val time = h <- decimal_of_len 2; char' #"":""; m <- decimal_of_len 2; s <- maybe (char' #"":""; s <- decimal_of_len 2; maybe' (char' #"".""; skipWhile isdigit); return s); return {Hour=h, Minute=m, Second=Option.get 0 s} val timezone_offset = let val zulu = char' #""Z""; return 0 val digits = decimal_of_len 2 val sign = or (char' #""+""; return 1) (char' #""-""; return (-1)) in zulu `or` (s <- sign; h <- digits; m <- (maybe' (char' #"":""); or digits (return 0)); return (s*(h*60+m))) end val datetime_with_tz = d <- date; char' #""T""; t <- time; tz <- timezone_offset; return (d ++ t ++ {TZOffsetMinutes=tz}) val datetime = d <- datetime_with_tz; return (d -- #TZOffsetMinutes) fun process v = case parse (d <- datetime_with_tz; eof; return d) v of Some r => let val {Year=year,Month=month,Day=day, Hour=hour,Minute=minute,Second=second} = Datetime.addMinutes (r.TZOffsetMinutes) (r -- #TZOffsetMinutes) fun pad x = if x < 10 then ""0"" `strcat` show x else show x in {[pad hour]}:{[pad minute]}:{[pad second]} {[month]} {[day]}, {[year]} end | None => none fun main () : transaction page = input <- source ""2012-01-01T01:10:42Z""; return Enter an ISO 8601 datetime here:
" https://github.com/urweb/urweb (* *) true true false 0 0 UrWeb https://github.com/gwalborn/UrWeb-Language-Definition.git UrWeb dlvm dlvm 2017 Chris Lattner 20 ir http://dlvm.org/ 0 579 1 26 23468 true 0 https://github.com/dlvm-team/swift ir 2017 2024 2010 2 0 0 0 false 2010 2017 67857 769 14310 259 1888648 2022 Modern Compiler Infrastructure for Deep Learning Systems Modern Compiler Infrastructure for Deep Learning Systems University of Illinois Urbana-Champaign && Purdue University Modern Compiler Infrastructure for Deep Learning Systems swift cpp cmake python restructuredtext json markdown objective-c objective-cpp bash bourne-shell llvmir c vim-script lisp xml make html d yaml css ini javascript ruby perl matlab true 771 0 48 1 false text United States https://dlvm-team.github.io/ // Dimension-erased functions are flexible because input shapes are dynamic. // They may be slower and less optimized than their shape-specialized counterparts. // f(x, w, b) = dot(x, w) + pad(b, at: 0) func @f: (<_ x _ x f32>, <_ x _ x f32>, <_ x f32>) -> <_ x _ x f32> { 'entry(%x: <_ x _ x f32>, %w: <_ x _ x f32>, %b: <_ x f32>): %0.0 = dot %x: <_ x _ x f32>, %w: <_ x _ x f32> %0.1 = padShape %b: <_ x f32> at 0 %0.2 = add %0.0: <_ x _ x f32>, %0.1: <1 x _ x f32> return %0.2: <_ x _ x f32> } https://github.com/dlvm-team/swift // true true false 0 0 dlvm.org purebasic PureBasic 1998 29 pl http://www.purebasic.com 0 https://www.purebasic.fr/blog/ https://www.purebasic.com/news.php 580 3 23468 true 0 pl 556 647 6366 3 "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""" text none programming false p/PureBasic.pb 2 2000 1998 basic linux x86-isa powerpc isbn "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." 2002 41 135 349 60643 Fantaisie Software pb pbi pb 426 0 32 https://www.purebasic.com/documentation/index.html https://www.purebasic.com/faq.php text http://www.rosettacode.org/wiki/Category:PureBasic "If OpenConsole() PrintN(""Hello World"") EndIf " "EnableExplicit ; ##################################################### Includes #################################################### XIncludeFile ""Includes/AudioOut.pbi"" ; ##################################################### Prototypes ################################################## ; ##################################################### Structures ################################################## ; ##################################################### Constants ################################################### #Samplerate = 44100 ; ##################################################### Structures ################################################## Structure Main *AudioOut Quit.i EndStructure Global Main.Main Structure Main_Window ID.i TrackBar.i [10] EndStructure Global Main_Window.Main_Window ; ##################################################### Variables ################################################### Global Frequency.d = 1000 Global Amplitude.d = 0.25 ; ##################################################### Procedures ################################################## Procedure Main_Window_Open() Main_Window\ID = OpenWindow(#PB_Any, 0, 0, 800, 100, ""AudioOut Example"", #PB_Window_SystemMenu | #PB_Window_MinimizeGadget | #PB_Window_ScreenCentered) If Main_Window\ID Main_Window\TrackBar[0] = TrackBarGadget(#PB_Any, 10, 10, 780, 30, 0, 20000) SetGadgetState(Main_Window\TrackBar[0], Frequency) Main_Window\TrackBar[1] = TrackBarGadget(#PB_Any, 10, 40, 780, 30, 0, 1000) SetGadgetState(Main_Window\TrackBar[1], Amplitude*1000) EndIf EndProcedure Procedure Notifier_CallBack(*AudioOut) Protected *Temp, Temp_Size.i Static Rotation.d While AudioOut::GetQueuedBlocks(*AudioOut) <= 3 Temp_Size = AudioOut::GetBufferBlocksize(*AudioOut) If Temp_Size > 0 *Temp = AllocateMemory(Temp_Size) Define Left.d, Right.d, i For i = 0 To Temp_Size / 4 - 1 Left = Sin(Rotation) * Amplitude Right = Sin(Rotation) * Amplitude PokeW(*Temp + i*4 , Left*32767) PokeW(*Temp + i*4 + 2, Right*32767) Rotation + 2.0*#PI / #Samplerate * Frequency Next AudioOut::Write_Data(Main\AudioOut, *Temp, Temp_Size) FreeMemory(*Temp) EndIf Wend EndProcedure ; ##################################################### Initialisation ############################################## Main_Window_Open() AudioOut::GetDevices() ForEach AudioOut::Device() Debug PeekS(AudioOut::@Device()\szPname) Next Main\AudioOut = AudioOut::Initialize(#WAVE_MAPPER, #Samplerate, 2, 16, @Notifier_CallBack()) If Not Main\AudioOut Debug AudioOut::GetError() End EndIf Notifier_CallBack(Main\AudioOut) ; ##################################################### Main ######################################################## Repeat Repeat Select WaitWindowEvent(100) Case #PB_Event_Gadget Select EventGadget() Case Main_Window\TrackBar[0] Frequency = GetGadgetState(Main_Window\TrackBar[0]) Debug Frequency Case Main_Window\TrackBar[1] Amplitude = GetGadgetState(Main_Window\TrackBar[1]) / 1000 EndSelect Case #PB_Event_CloseWindow Main\Quit = #True Case 0 Break EndSelect ForEver Until Main\Quit ; ##################################################### End ######################################################### AudioOut::Deinitialize(Main\AudioOut) ; IDE Options = PureBasic 5.30 Beta 2 (Windows - x64) ; CursorPosition = 109 ; FirstLine = 79 ; Folding = - ; EnableUnicode ; EnableThread ; EnableXP " Structure type_name field_name.type ; Single field. Perhaps the structures attachment. field_name[count].type ; Static arrays. ; ... ; Optional construction StructureUnion .. EndStructureUnion allows you ; to combine multiple fields into one area of memory ; that is sometimes required for the conversion types. StructureUnion type_name.type ; ... EndStructureUnion EndStructure PureBasic ; PrintN """" true true true false true https://en.wikipedia.org/wiki/PureBasic 2 0 purebasic.com PureBasic https://github.com/telnet23/language-basic 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 PureBasic purebasic developer bucardo Bucardo 2009 Jon Jensen 18 application https://bucardo.org/Bucardo/ 0 5.6.0 581 0 6 23467 false 0 https://github.com/bucardo/bucardo application 2009 2024 35 101 733 44 false 2007 2025 2585 33 75 10 29671 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. 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. https://github.com/bucardo/bucardo 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. perl html yaml bourne-shell bash diff true 1071 0 28 postgresql sql plpgsql perl 1 false 5 true https://bucardo.org/Bucardo/ United States https://wiki.postgresql.org/wiki/Bucardo https://github.com/bucardo/bucardo 0 0 bucardo.org lmdb lmdb 2011 Howard Chu 14 library http://www.openldap.org/software/repo.html 0 582 0 2 23463 true 0 https://github.com/LMDB/lmdb library 2015 2024 2011 164 578 2512 0 false 2011 2025 1817 38 30 3 18857 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. 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. https://github.com/LMDB 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. c make true 4286 0 16 1 false text United States http://www.lmdb.tech/doc/group__mdb.html https://github.com/LMDB/lmdb 0 0 foxpro FoxPRO 1992 17 pl 0 583 1 23461 2056 true 0 pl false f/FoxPro.prg foxpro.py 1992 visual-foxpro dbase linux freebsd 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. 2006 244 71 236 7419372 Fox Software prg PRG prg 1240 0 18 text United States "? ""Hello World"" " FoxPro FoxPro """" true true true https://en.wikipedia.org/wiki/FoxPro 53 0 https://hopl.info/showlanguage.prx?exp=2056 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 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 glicol Glicol 2020 Qichao Lan 15 musicalNotation https://glicol.org 0 v0.13.5 584 1 9 23459 true 0 https://github.com/chaosprint/glicol musicalNotation 2020 2024 2020 32 73 2145 43 false 2020 2025 673 14 207 113 61459 https://glicol.org/demo 2021 University of Oslo rust javascript json markdown toml yaml css html bourne-shell true 2380 0 24 1 false 0 true Norway "~gate: speed 2.0 >> seq 60 _60 _~a 48; ~a: choose 48 48 48 72 0 0 0 ~amp: ~gate >> envperc 0.001 0.1; ~pit: ~gate >> mul ##Math.pow(2, (60-69)/12) * 440# // mix js to get 261.63 ~lead: saw ~pit >> mul ~amp >> lpf ~mod 5.0 >> meta ` output = input.map(|x|x*0.1); output ` // rhai script, same as ""mul 0.1"" ~mod: sin 0.2 >> mul 1300 >> add 1500; out: ~lead >> add ~drum >> plate 0.1 // optinal semicolon ~drum: speed 4.0 >> seq 60 >> sp \808bd; // live drag and drop your sample ^^^" https://github.com/chaosprint/glicol 0 0 glicol.org livecode LiveCode 2001 25 pl https://livecode.org/ 0 585 3 23456 true 1 revolution-programming-language pl false l/LiveCode revolution 2012 2001 linux android ios hypertalk hypercard sql "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." 2003 60 55 303 30890362 LiveCode Ltd 321 0 27 text http://www.rosettacode.org/wiki/Category:LiveCode Scotland LiveCode "-- Hello world in LiveCode (formerly called Revolution, formerly called Transcript) answer ""Hello World!""" "answer ""Hello World!"" " "put url ""binfile:picture.jpg"" into url ""ftp://john:passwd@ftp.example.net:2121/picture.jpg""" LiveCode -- answer true true true false https://en.wikipedia.org/wiki/LiveCode 9 0 LiveCode livecode.org 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 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 jule Jule 2021 Mertcan Davulcu 112 pl lisp https://jule.dev 1 586 3 2 23456 true 1 jule https://github.com/julelang/jule pl 2021 2024 2021 9 12 127 4 false 2021 2025 5722 16 547 17 128619 2022 Jule is the simple, efficient, statically typed and compiled system programming language. Jule is the simple, efficient, statically typed and compiled system programming language. https://github.com/julelang Jule is the simple, efficient, statically typed and compiled system programming language. .jule jule cpp true 181 0 174 c cpp rust go 1 true false https://jule.dev/pages/manual.html?page=jule-lang text Turkey use std::math::{PI} trait Shape { fn area(self): f32 } struct Rectangle { width: int height: int } impl Shape for Rectangle { fn area(self): f32 { ret self.width * self.height } } struct Circle { r: f32 } impl Shape for Circle { fn area(self): f32 { ret PI * self.r * self.r } } fn main() { let rect: Shape = Rectangle{90, 5} let circ: Shape = Circle{90.5} outln(rect.area()) outln(circ.area()) } fn 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 defer select chan map https://github.com/julelang/jule // /* */ println """" = true false use true false true true true true true true false true true true true true true true true true true true true true true true true true true true true true false true false true true true true true true true true true true true true true true false true true true true true false true false true false true true true true false true true true true true true true false true true false true true false true true true true true 0 0 jule.dev lispyscript lispyscript 2012 Santosh Rajan 20 pl lisp http://lispyscript.com 0 1.0.2 587 1 8 23454 true 0 https://github.com/santoshrajan/lispyscript pl 2012 2024 2012 40 57 572 18 false 2012 2020 271 7 439 2 85683 2021 A javascript With Lispy Syntax And Macros! A javascript With Lispy Syntax And Macros! https://github.com/santoshrajan/lispyscript/issues A javascript With Lispy Syntax And Macros! javascript markdown json css html make yaml coffeescript true 752 0 29 1 false 1 true India http://web.archive.org/web/20180123072250/http://lispyscript.com/ ";; test with and without the ""./"" ;;(var k (require ""square.ls"")) ;;(var k (require ""./square.ls"")) ;; or test .ls files requiring .js files: ;;(var k (require ""square.js"")) ;;(var k (require ""./square.js"")) ;; or test omitting .ls extensions: (var k (require ""square"")) ;;(var k (require ""./square"")) (console.log (k 10))" https://github.com/santoshrajan/lispyscript ; true true false 0 0 lispyscript.com json-with-comments JSON with Comments 2001 Muhammad Muzzammil 26 dataNotation 0 v1.0.1 588 2 3 23454 true 0 https://github.com/muhammadmuzzammil1998/jsonc dataNotation .babelrc .devcontainer.json .eslintrc.json .jscsrc .jshintrc .jslintrc api-extractor.json devcontainer.json jsconfig.json language-configuration.json tsconfig.json tslint.json 0 JSON jsonc javascript javascript text/javascript source.js data 2019 2024 2019 5 20 196 3 false 1133 2013 2018 12 103 jsonc 2019 2024 50 6 13 2 335 https://github.com/muhammadmuzzammil1998/jsonc/issues 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 markdown go yaml true 463 0 33 json 1 false 1 true text India https://github.com/Microsoft/node-jsonc-parser "/* * JSLint's implementation of JSHint * The JSLint options and makeup of this file were created based on the documentation of JSLint by * Douglas Crockford: http://www.jslint.com/lint.html */ { ""foobar"" : true, // Not checked in JSHint }" "[ { ""command"": ""haxe_run_build"" } ]" https://github.com/muhammadmuzzammil1998/jsonc // /* */ true true true false 0 0 https://github.com/atom/language-javascript JSON with Comments gdscript GDScript 2008 29 pl 3d http://docs.godotengine.org/en/3.0/getting_started/scripting/gdscript/gdscript_basics.html 2 589 3 23450 true 2 gap pygments pl 513 681 39447 2 "author name avatar url language languageColor stars forks currentPeriodStars description\ngodotengine godot-demo-projects https://github.com/godotengine.png https://github.com/godotengine/godot-demo-projects GDScript #355570 846 454 39 ""Demonstration and Template Projects""" text source.gdscript programming false g/GDScript.gd 29 2014 2018 4 5 gdscript.py GDScript is a high level, dynamically typed programming language used to create content. It uses a syntax similar to Python (blocks are indent-based and many keywords are similar). Its goal is to be optimized for and tightly integrated with Godot Engine, allowing great flexibility for content creation and integration. GDScript is a high level, dynamically typed programming language used to create content. It uses a syntax similar to Python (blocks are indent-based and many keywords are similar). Its goal is to be optimized for and tightly integrated with Godot Engine, allowing great flexibility for content creation and integration. https://github.com/godotengine GDScript is a high level, dynamically typed programming language used to create content. It uses a syntax similar to Python (blocks are indent-based and many keywords are similar). Its goal is to be optimized for and tightly integrated with Godot Engine, allowing great flexibility for content creation and integration. gd gd gd 201 0 33 gd text https://github.com/antlr/grammars-v4/tree/master/gdscript Various https://en.wikipedia.org/wiki/Godot_(game_engine) "# A file is a class! # Inheritance extends BaseClass # Member Variables var a = 5 var s = ""Hello"" var arr = [1, 2, 3] var dict = {""key"": ""value"", 2:3} # Constants const ANSWER = 42 const THE_NAME = ""Charly""" "extends Node2D func _ready(): print(""Hello World"") " "# Taken from https://github.com/okamstudio/godot/wiki/gdscript # a file is a class! # inheritance extends BaseClass # member variables var a = 5 var s = ""Hello"" var arr = [1, 2, 3] var dict = {""key"":""value"", 2:3} # constants const answer = 42 const thename = ""Charly"" # built-in vector types var v2 = Vector2(1, 2) var v3 = Vector3(1, 2, 3) # function func some_function(param1, param2): var local_var = 5 if param1 < local_var: print(param1) elif param2 > 5: print(param2) else: print(""fail!"") for i in range(20): print(i) while(param2 != 0): param2 -= 1 var local_var2 = param1+3 return local_var2 # subclass class Something: var a = 10 # constructor func _init(): print(""constructed!"") var lv = Something.new() print(lv.a)" GDScript GDScript # print """" true true true true true true false true 0 0 GDScript https://github.com/beefsack/GDScript-sublime GDScript dub-pm dub-pm 2012 Sönke Ludwig 16 packageManager https://code.dlang.org/ 0 v1.38.0-beta.1 590 0 9 23447 false 0 https://github.com/dlang/dub packageManager 2012 2024 2012 65 228 666 498 false 1498 d 2012 2025 4077 196 1043 9 67867 https://github.com/dlang d bourne-shell json yaml markdown xml bash c dockerfile true 1548 0 25 1 false 1 true United States https://dub.pm/package-format-json https://github.com/dlang/dub 0 0 code.dlang.org dtd DTD 1996 13 grammarLanguage 21 591 1 23445 true 24 ballerina ceylon click commonmark eiffel emscripten erlang factor gradle hhvm java mythryl netbeans-editor netlogo open-nn php pkl pygments python relax smallbasic trex vlc xduce grammarLanguage false document type definition html.py 2009 xml html 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. 2001 235 72 583 8537 ISO dtd 1195 0 14 dtd text Switzerland DTD " ]> Fred Bloggs 2008-11-27 Male " https://en.wikipedia.org/wiki/Document_type_definition 2 0 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 euphoria Euphoria 1993 Jeremy Cowgar and Robert Craig and Matt Lewis and Derek Parnell 36 pl http://openeuphoria.org 0 4.1.0 592 4 16 23445 2020 true 0 https://github.com/OpenEuphoria/euphoria pl 46 47 75 eui euiw text source.euphoria programming 2018 2024 2006 16 23 86 1 false e/Euphoria.ex End User Programming Hierarchial Objects for Robust Interpreted Applications 2006 2025 6646 36 871 122 288097 2007 1993 linux freebsd c basic ascii lua python rebol ruby 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. 2001 25 34 266 9647 Rapid Deployment Software e ex exw edb e ex ex e ex exw edb elixir c bourne-shell make wasm html json javascript css yaml markdown tex prolog xml lex dockerfile true 338 0 https://exercism.org/tracks/euphoria 62 4 false 4 true text http://www.rosettacode.org/wiki/Category:Euphoria Canada Euphoria "-- Hello World in Euphoria puts(1, ""Hello World!\n"") " "puts(1, ""Hello World"") " https://riju.codes/euphoria "puts(1, ""Hello, world!\n"") " global function replace_item( object old, object new, sequence group ) integer pos -- Code begins -- pos = find( old, group ) if pos > 0 then group[pos] = new end if return group end function Euphoria https://github.com/OpenEuphoria/euphoria -- puts """" true true true false true https://en.wikipedia.org/wiki/Euphoria_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=2020 Euphoria openeuphoria.org Euphoria Euphoria bpkg-pm bpkg-pm 2017 Joseph Werle 15 packageManager http://www.bpkg.sh/ 0 1.1.4 593 0 6 23443 false 0 https://github.com/bpkg/bpkg packageManager 2014 2024 2014 35 96 1888 36 false 26 bash 2014 2023 370 36 58 1 7189 2017 The bpkg Team bourne-shell markdown json make yaml bash true 2214 0 21 1 false 1 true Various https://github.com/bpkg/bpkg 0 0 bpkg.sh igor-pro IGOR Pro 1993 20 pl 1 594 1 23441 true 1 cloc pl 48 80 146 0 igor or igorpro text source.igor programming false 2 igor.py 2018 c 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++. 2005 39 29 68 2515207 WaveMetrics, Inc ipf ipf 415 0 39 ipf text United States https://groups.google.com/forum/#!search/igor-pro/comp.sys.mac.scitech/1QMC8N6AyLw/1Vvaa5rZPBwJ "#pragma rtGlobals=3 StrConstant myConstString=""abcd"" // some comment constant myConst=123 Structure struct1 string str variable var EndStructure static Structure struct2 string str variable var EndStructure #include ""someFile"" #ifdef NOT_DEFINED // conditional compilation #endif " Igor override ThreadSafe MultiThread static Proc Picture Prompt DoPrompt macro window function end Structure EndStructure EndMacro Menu SubMenu // true true true false https://en.wikipedia.org/wiki/IGOR_Pro 0 0 IGOR Pro https://github.com/byte-physics/language-igor IGOR Pro asciidoc AsciiDoc 2002 Stuart Rackham 14 textMarkup https://asciidoc.org/ http://asciidoc.org/ 26 595 3 23439 true 27 ace apache-hbase bucklescript cairo caramel ceylon cloc crmsh glush golo gradle kakoune-editor kotlin ninja olc oxyl partiql pkl ramen rescript rust spiderbasic tridash txt2tags xl-lang xodio yamp textMarkup 21 true 0 asciidoc text.html.asciidoc prose false 37 2008 2015 3 8 2002 python ruby xml html tex unix java 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. 2006 89 69 116 6697014 asciidoc adoc asc adoc true 666 0 16 1 adoc asciidoc text AsciiDoc Home Page ================== Title ----- Example Articles ~~~~~~~~~~~~~~~~ - Item 1 - Item 2 - Item 3 https://riju.codes/asciidoc Hello, world! = My Article J. Smith https://wikipedia.org[Wikipedia] is an on-line encyclopaedia, available in English and *many* other languages. == Software You can install 'package-name' using the `gem` command: gem install package-name == Hardware Metals commonly used include: * copper * tin * lead https://github.com/asciidoc/asciidoc https://en.wikipedia.org/wiki/AsciiDoc 0 0 asciidoc.org https://github.com/zuckschwerdt/asciidoc.tmbundle AsciiDoc checked-c checked-c 2015 David Tarditi 14 pl https://www.microsoft.com/en-us/research/project/checked-c/ 0 v0.7.1-final 596 0 7 23438 true 0 https://github.com/Microsoft/checkedc pl 2016 2024 2016 106 186 3196 63 false 2016 2024 591 45 256 5 51416 Microsoft c tex markdown make r cmake csv true 3801 0 21 1 false 0 true United States https://www.microsoft.com/en-us/research/project/checked-c/ https://github.com/Microsoft/checkedc 0 0 hamler hamler 2019 Feng Lee 17 pl https://www.hamler-lang.org/ 0 0.4.1 597 1 8 23436 true 0 https://github.com/hamler-lang/hamler pl 2019 2024 2019 31 39 1026 32 false 2019 2021 601 28 315 2 26233 2020 Hamler is a strongly-typed language with compile-time typechecking and built-in support for concurrency and distribution. Hamler is a strongly-typed language with compile-time typechecking and built-in support for concurrency and distribution. https://github.com/hamler-lang/ Hamler is a strongly-typed language with compile-time typechecking and built-in support for concurrency and distribution. erlang haskell make dockerfile yaml markdown bourne-shell xml true 1173 0 25 1 false 0 true China https://news.ycombinator.com/item?id=23491516 "module Main where import System.IO main = print ""Hello, World!""" https://twitter.com/hamlerlang https://github.com/hamler-lang/hamler 0 0 hamler-lang.org logos Logos 2010 20 pl 24 598 2 23432 true 24 cir cloc cperl cryptol eiffel expresso fo futhark ghc go hacspec haml haste jal-compiler kitlang koka nesc opal pygments rust wasp-lang wyvern xtclang yasl pl 3774 4497 6281 0 text source.logos programming false 10 2013 2016 5 6 objective.py 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. 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. https://github.com/DHowett/theos-logos-examples/issues 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. xm x xi x xi xm xmi 200 0 23 x xm text 3920 United States https://github.com/DHowett/theos-logos-examples %group iOS8 %hook IOS8_SPECIFIC_CLASS // your code here %end // end hook %end // end group ios8 %group iOS9 %hook IOS9_SPECIFIC_CLASS // your code here %end // end hook %end // end group ios9 %ctor { if (kCFCoreFoundationVersionNumber > 1200) { %init(iOS9); } else { %init(iOS8); } } "# APPLE LOCAL file string workaround 4943900 if { [istarget ""*-*-darwin\[9123\]*""] } { set additional_flags ""-framework Foundation -fconstant-cfstrings"" } return 0 " Logos // true true false 0 0 Logos https://github.com/Cykey/Sublime-Logos Logos easybuild Easybuild 2014 Kenneth Hoste 17 application http://easybuilders.github.io/easybuild/ 0 v1.8.2 599 1 5 23431 false 0 https://github.com/easybuilders/easybuild application 0 Python python python text/x-python source.python data 2012 2024 2012 36 142 457 102 false 415 2015 2018 1 13 2012 2024 2793 77 47 599 1401 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. 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. https://github.com/easybuilders/ 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. eb yaml bourne-shell python restructuredtext markdown true 1162 0 22 1 false 1 true text Various "# not really (there's an EB_bzip2 easyblock), but fine for use in unit tests easyblock = 'ConfigureMake' name = 'bzip2' version = '1.0.6' homepage = 'http://www.bzip.org/' description = """"""bzip2 is a freely available, patent free, high-quality data compressor. It typically compresses files to within 10% to 15% of the best available techniques (the PPM family of statistical compressors), whilst being around twice as fast at compression and six times faster at decompression."""""" toolchain = {'name': 'GCC', 'version': '4.9.2'} toolchainopts = {'pic': True} sources = [SOURCE_TAR_GZ] source_urls = ['http://www.bzip.org/%(version)s'] builddependencies = [('gzip', '1.6')] moduleclass = 'tools' " https://github.com/easybuilders/easybuild 0 0 https://github.com/MagicStack/MagicPython Easybuild angelscript Angelscript 2003 Andreas Jönsson 32 pl http://angelcode.com/angelscript 0 600 2 23431 true 0 pl 275 286 1140 0 text clike text/x-c++src source.angelscript programming false 22 2012 2018 2 4 2003 eclipse-editor 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. 2013 29 23 58 39538319 as angelscript 366 0 162 1 text https://github.com/antlr/grammars-v4/tree/master/angelscript http://www.rosettacode.org/wiki/Category:AngelScript "// Hello world in AngelScript void main() { print(""Hello world\n""); }" "/* * This is a sample script. */ #include ""BotManagerInterface.acs"" BotManager::BotManager g_BotManager( @CreateDumbBot ); CConCommand@ m_pAddBot; void PluginInit() { g_BotManager.PluginInit(); @m_pAddBot = @CConCommand( ""addbot"", ""Adds a new bot with the given name"", @AddBotCallback ); } void AddBotCallback( const CCommand@ args ) { if( args.ArgC() < 2 ) { g_Game.AlertMessage( at_console, ""Usage: addbot "" ); return; } BotManager::BaseBot@ pBot = g_BotManager.CreateBot( args[ 1 ] ); if( pBot !is null ) { g_Game.AlertMessage( at_console, ""Created bot "" + args[ 1 ] + ""\n"" ); } else { g_Game.AlertMessage( at_console, ""Could not create bot\n"" ); } } final class DumbBot : BotManager::BaseBot { DumbBot( CBasePlayer@ pPlayer ) { super( pPlayer ); } void Think() { BotManager::BaseBot::Think(); // If the bot is dead and can be respawned, send a button press if( Player.pev.deadflag >= DEAD_RESPAWNABLE ) { Player.pev.button |= IN_ATTACK; } else Player.pev.button &= ~IN_ATTACK; KeyValueBuffer@ pInfoBuffer = g_EngineFuncs.GetInfoKeyBuffer( Player.edict() ); pInfoBuffer.SetValue( ""topcolor"", Math.RandomLong( 0, 255 ) ); pInfoBuffer.SetValue( ""bottomcolor"", Math.RandomLong( 0, 255 ) ); if( Math.RandomLong( 0, 100 ) > 10 ) Player.pev.button |= IN_ATTACK; else Player.pev.button &= ~IN_ATTACK; for( uint uiIndex = 0; uiIndex < 3; ++uiIndex ) { m_vecVelocity[ uiIndex ] = Math.RandomLong( -50, 50 ); } } } BotManager::BaseBot@ CreateDumbBot( CBasePlayer@ pPlayer ) { return @DumbBot( pPlayer ); } " AngelScript "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 // /* */" // /* */ print true false true true true true true true true true false true true https://en.wikipedia.org/wiki/AngelScript 0 0 Angelscript AngelScript https://github.com/wronex/sublime-angelscript AngelScript abc ABC 1980 21 pl 0 601 4 23430 1290 true 0 pl false a/ABC.abc 1980 setl algol-68 python basic pascal awk c unix isbn 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. 2002 121 43 122 147585 Centrum Wiskunde & Informatica abc 625 0 23 https://tio.run/#abc text 4100 Netherlands "\ Hello world in ABC WRITE ""Hello, World!"" /" "WRITE ""Hello World"" " https://riju.codes/abc "WRITE ""Hello, world!"" / " HOW TO RETURN words document: PUT {} IN collection FOR line IN document: FOR word IN split line: IF word not.in collection: INSERT word IN collection RETURN collection ABC WRITE """" true true true https://en.wikipedia.org/wiki/ABC_(programming_language) 0 4 https://hopl.info/showlanguage.prx?exp=1290 ABC 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 tinyc-compiler Tiny C Compiler 2001 Fabrice Bellard 14 compiler http://bellard.org/tcc/ 0 602 0 6 23429 true 0 https://github.com/TinyCC/tinycc compiler 2016 2024 2001 71 355 1902 15 false TCC TinyCC 2001 2025 3544 213 514 7 136084 2013 c assembly-language linux unix x86-isa small-c The Tiny C Compiler (a.k.a. TCC, tCc, or TinyCC) is an x86, X86-64 and ARM processor C compiler created by Fabrice Bellard. It is designed to work for slow computers with little disk space (e.g. on rescue disks). Windows operating system support was added in version 0.9.23 (17 Jun 2005). TCC is distributed under the GNU Lesser General Public License (LGPL). TCC claims to implement all of ANSI C (C89/C90), much of the C99 ISO standard, and many GNU C extensions including inline assembly. 2005 97 89 219 3538024 c assembly-language make bourne-shell perl yaml true 3687 0 20 1 false na https://github.com/antlr/grammars-v4/tree/master/tinyc https://github.com/TinyCC/tinycc https://en.wikipedia.org/wiki/Tiny_C_Compiler 0 0 bibtex BibTeX 1985 15 application https://www.ctan.org/pkg/bibtex 0 603 3 23428 false 0 application TeX tex stex text/x-stex text.bibtex markup false bibtex.py 1985 latex tex url common-lisp unicode scribe html emacs-editor pdf 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. 2003 417 197 583 239392 The TeX Users Group bib bib bibtex bib 2106 0 16 text https://github.com/antlr/grammars-v4/tree/master/bibtex United States @inproceedings{Gousi13, author = {Gousios, Georgios}, title = {The GHTorrent dataset and tool suite}, booktitle = {Proceedings of the 10th Working Conference on Mining Software Repositories}, series = {MSR '13}, year = {2013}, isbn = {978-1-4673-2936-1}, location = {San Francisco, CA, USA}, pages = {233--236}, numpages = {4}, url = {http://dl.acm.org/citation.cfm?id=2487085.2487132}, acmid = {2487132}, publisher = {IEEE Press}, address = {Piscataway, NJ, USA}, } BibTeX "@Book{abramowitz+stegun, author = ""Milton {Abramowitz} and Irene A. {Stegun}"", title = ""Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables"", publisher = ""Dover"", year = 1964, address = ""New York City"", edition = ""ninth Dover printing, tenth GPO printing"" }" https://en.wikipedia.org/wiki/BibTeX 0 0 BibTeX lamdu-editor lamdu-editor 2011 Eyal Lotem and Yair Chuchem 15 editor https://lamdu.org 0 v0.8.1 604 0 13 23424 false 0 https://github.com/lamdu/lamdu editor 2011 2024 2011 55 66 1852 21 false 2011 2025 11233 30 459 35 210460 2015 This project aims to create a next-generation, live programming environment that radically improves the programming experience. This project aims to create a next-generation, live programming environment that radically improves the programming experience. https://github.com/lamdu This project aims to create a next-generation, live programming environment that radically improves the programming experience. haskell json markdown nix bourne-shell yaml javascript bash xml dockerfile dhall html lisp true 2082 0 29 2 false 0 true Israel https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0 https://github.com/lamdu/lamdu 0 0 lamdu.org gherkin Gherkin 2008 21 pl https://docs.cucumber.io/gherkin/ 12 605 1 23421 true 12 ace capybara cloc codecept crmsh gradle hamdown jekyll linux multiaddr pygments ramen pl 4098 4844 7787 0 cucumber text text.gherkin.feature programming false 261 2008 2017 35 Cucumber testing.py Executable specifications Executable specifications SmartBear Software Executable specifications feature story feature 201 0 23 feature text United States https://docs.cucumber.io/gherkin/reference/ "Feature: Guess the word # The first example has two steps Scenario: Maker starts a game When the Maker starts a game Then the Maker waits for a Breaker to join # The second example has three steps Scenario: Breaker joins a game Given the Maker has started a game with the word ""silky"" When the Breaker joins the Maker's game Then the Breaker must guess a word with 5 characters" Gherkin # true true false 0 0 Gherkin https://github.com/cucumber/cucumber-tmbundle Gherkin cg Cg 2003 18 shadingLanguage 0 606 1 23419 6204 false 0 shadingLanguage false C for Graphics 2012 c opengl unity-engine 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. 2003 189 122 233 390212 Nvidia 965 0 19 text 7928 United States https://arxiv.org/pdf/cs/0302013.pdf // input vertex struct VertIn { float4 pos : POSITION; float4 color : COLOR0; }; // output vertex struct VertOut { float4 pos : POSITION; float4 color : COLOR0; }; // vertex shader main entry VertOut main(VertIn IN, uniform float4x4 modelViewProj) { VertOut OUT; OUT.pos = mul(modelViewProj, IN.pos); // calculate output coords OUT.color = IN.color; // copy input color to output OUT.color.z = 1.0f; // blue component of color = 1.0f return OUT; } // true true false https://en.wikipedia.org/wiki/Cg_(programming_language) 5 0 https://hopl.info/showlanguage.prx?exp=6204 cg 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 gzip Gzip 1992 Jean-loup Gailly and Mark Adler 13 binaryDataFormat http://www.gnu.org/software/gzip/ 0 607 0 23416 false 2 spz sqlar-format binaryDataFormat false 2016 c unix freebsd html rfc "gzip is a file format and a software application used for file compression and decompression. The program was created by Jean-loup Gailly and Mark Adler as a free software replacement for the compress program used in early Unix systems, and intended for use by GNU (the ""g"" is from ""GNU""). Version 0.1 was first publicly released on 31 October 1992, and version 1.0 followed in February 1993." 2001 555 441 503 12783 GNU Project true 2796 0 14 2 binary 9973 Gzip gzip https://en.wikipedia.org/wiki/Gzip 0 0 rfc RFC 1969 Steve Crocker 14 notation 0 608 1 23416 true 0 notation false Request for Comments 1969 ascii 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. 2001 700 739 757 25540 University of California Los Angeles 3520 0 14 1 https://www.ietf.org/standards/rfcs/ text 5769 United States RFC 2046 Media Types November 1996 A. Collected Grammar .................................... 43 1. Introduction The first document in this set, RFC 2045, defines a number of header fields, including Content-Type. The Content-Type field is used to specify the nature of the data in the body of a MIME entity, by giving media type and subtype identifiers, and by providing auxiliary information that may be required for certain media types. After the https://en.wikipedia.org/wiki/Request_for_Comments 1 1 year|publisher|title|authors|isbn13\n2022-02-21|tredition|SAP interface programming with RFC and VBA|Karl Josef Hensel|9783347574793 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 jscript JScript 1996 18 pl https://msdn.microsoft.com/library/hbxc2t98.aspx 0 609 1 23415 true 0 pl false j/JScript.js 1996 javascript asp vbscript visual-studio-editor json csharp "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." 2003 187 719 351 263872 Microsoft js jse wsf wsc js js jse wsf wsc 956 0 24 text "WScript.Echo(""Hello World"");" JScript WScript.Echo """" true true https://en.wikipedia.org/wiki/JScript 5 0 JScript 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 title|year|author|goodreadsId|rating|ratings|reviews\nJScript? .Net Programming|2001|Essam Ahmed|83357|3.00|1|1 s S 1976 16 pl http://ect.bell-labs.com/sl/S/ 0 610 0 23414 1117 true 0 pl false r.py 1976 r s-plus c apl polymorphic-programming-language fortran unix postscript "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." 2004 281 82 164 919313 Bell Labs S R .Rhistory .Rprofile .Renviron 1426 0 16 text 90 United States S true https://en.wikipedia.org/wiki/S_(programming_language) 3 0 https://hopl.info/showlanguage.prx?exp=1117 S 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 linotte Linotte 2005 cpc6128 17 pl http://langagelinotte.free.fr/ 0 611 1 6 23414 true 0 https://github.com/cpc6128/LangageLinotte pl 2019 2024 2019 4 3 37 4 false French 2019 2024 524 6 886 6 28428 2005 php java-server-pages "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""." 2015 8 4 6 47833395 https://github.com/cpc6128/LangageLinotte/issues java xml yaml powershell visual-basic markdown true 1114 0 23 1 false text https://bitbucket.org/metalm/langagelinotte/downloads/ France "BonjourLeMonde: début affiche ""Bonjour le monde !""" https://github.com/cpc6128/LangageLinotte https://en.wikipedia.org/wiki/Linotte 0 0 langagelinotte.free.fr smpl Semantic Patch Language 2006 Yoann Padioleau 17 grammarLanguage http://coccinelle.lip6.fr/ 0 1.1.1 612 0 24 23414 true 0 https://github.com/coccinelle/coccinelle grammarLanguage 114 120 15 coccinelle text source.smpl programming 2010 2024 2006 32 101 602 267 false 2006 2025 7804 87 5417 50 399357 2018 Coccinelle (French for ladybug) is an open-source utility for matching and transforming the source code of programs written in the C programming language. 20 13 31592209 Inria cocci ocaml c rescript cpp make tex bourne-shell markdown python perl m4 dockerfile yaml lisp bash hcl vim-script diff c-shell awk json xml html css true 1114 0 41 1 false 1 true France https://github.com/coccinelle/coccinelle https://en.wikipedia.org/wiki/Coccinelle_(software) 0 0 coccinelle.lip6.fr SmPL SmPL clipper Clipper 1985 23 pl http://www.grafxsoft.com/clipper.htm 0 613 3 23414 1909 true 0 pl false c/Clipper.prg 1985 xbase c visual-objects visual-basic delphi xbasepp linux unix visual-foxpro sql dbase 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. 2003 99 70 235 246367 Nantucket Corporation prg 516 0 25 https://www.youtube.com/watch?v=Opv647iFbAk text http://www.rosettacode.org/wiki/Category:Clipper United States "// Hello World in Clipper ? ""Hello World""" "? ""Hello World"" " "USE Customer SHARED NEW clear @ 1, 0 SAY ""CustNum"" GET Customer->CustNum PICT ""999999"" VALID Customer->CustNum > 0 @ 3, 0 SAY ""Contact"" GET Customer->Contact VALID !empty(Customer->Contact) @ 4, 0 SAY ""Address"" GET Customer->Address READ" Clipper // """" true true false true https://en.wikipedia.org/wiki/Clipper_(programming_language) 21 1 https://hopl.info/showlanguage.prx?exp=1909 Clipper 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 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 stan Stan 2012 22 pl http://mc-stan.org/ 0 614 1 1 23412 true 0 pl 134 154 774 0 text source.stan programming false 86 2015 2018 3 2 modeling.py 2012 ia-32 r matlab stata 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. 2014 68 116 34 42243853 https://github.com/stan-dev stan stan cpp true 561 0 23 false text 9401 Various data { int N; vector[N] incumbency_88; vector[N] vote_86; vector[N] vote_88; } parameters { vector[3] beta; real sigma; } model { vote_88 ~ normal(beta[1] + beta[2] * vote_86 + beta[3] * incumbency_88,sigma); } Stan https://twitter.com/mcmc_stan true true true https://en.wikipedia.org/wiki/Stan_(software) 2 0 mc-stan.org Stan https://github.com/jrnold/atom-language-stan 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 Stan astroml astroml 2012 Jacob Vanderplas 15 library http://www.astroml.org/ 0 v1.0.2 615 0 7 23411 true 0 https://github.com/astroML/astroML library 2012 2024 2012 96 310 1032 67 false 2012 2024 608 31 199 10 18610 2013 Google python restructuredtext make html yaml ini toml true 1995 0 22 1 false 1 true text United States https://github.com/astroML/astroML 0 0 astroml.org pact Pact 2016 Stuart Popejoy 18 contractLanguage http://kadena.io/try-pact/ 0 v4.12.0 616 1 13 23410 true 0 https://github.com/kadena-io/pact contractLanguage 2016 2024 43 100 580 135 false 2016 2025 4821 65 453 17 126150 Kadena LLC haskell yaml markdown c restructuredtext bourne-shell nix json csv python css html xml false true 947 0 31 1 false 4 true https://pact-language.readthedocs.io/en/stable/ United States (map (+ 1) [1 2 3]) https://github.com/kadena-io/pact 3 0 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 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 dojo Dojo 2005 Alex Russal 14 pl https://dojotoolkit.org/ 0 617 0 1 23409 true 0 https://github.com/dojo/dojo pl 2013 2024 158 540 1549 42 false 2007 2023 5365 157 1338 13 230157 https://dojotoolkit.org/community/ javascript javascript true 3348 0 16 1 false https://dojotoolkit.org/documentation/ https://github.com/dojo/dojo https://en.wikipedia.org/wiki/Dojo_Toolkit 0 0 algol-68 ALGOL 68 1968 Adriaan van Wijngaarden and Barry J. Mailloux and John E. L. Peck and Cornelis H. A. Koster 17 pl 0 618 2 23408 311 true 1 mary pl false a/ALGOL 68.algol68 1968 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 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. 2004 121 246 813 692880 International Federation for Information Processing 625 0 22 4 text "begin print((""Hello World"",newline)) end " proc test = (real a, b) :... ... test (x plus 1, x); ALGOL 68 print """" true true true https://en.wikipedia.org/wiki/ALGOL_68 3 0 https://hopl.info/showlanguage.prx?exp=311 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 snowball-programming-language Snowball 2001 Martin Porter 16 pl https://snowballstem.org 0 v2.2.0 619 0 17 23402 true 0 https://github.com/snowballstem/snowball pl 2013 2024 35 174 736 27 false dsls.py 2003 2025 1152 40 124 2 37007 2006 snobol java ascii c "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' ""." 2004 10 9 32 919808 https://lists.tartarus.org/pipermail/snowball-discuss sbl c python rust go ada csharp java perl pascal javascript restructuredtext markdown make yaml diff xml toml true 1370 0 33 1 false 2 true https://github.com/antlr/grammars-v4/tree/master/esolang/snowball United Kingdom http://snowball.tartarus.org Snowball https://github.com/snowballstem/snowball https://en.wikipedia.org/wiki/Snowball_%28programming_language%29 0 0 desmos Desmos 2011 Eli Luberoff 13 pl https://www.desmos.com/calculator 0 620 0 23401 true 0 pl false Desmos Studio, PBC 8918 0 16 latex 1 true United States https://reddit.com/r/desmos = -> https://en.wikipedia.org/wiki/Desmos_(graphing) 0 0 maven-pom Apache Maven 2004 14 application http://maven.apache.org/ 0 621 2 23401 false 0 application pom.xml 0 XML xml xml text/xml text.xml.pom data false 43 2007 2014 1 3 2002 java xml csharp ruby scala c eclipse-editor yaml groovy 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. 2004 619 327 657 1333305 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. 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. Apache Software Foundation 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. true 3316 0 14 text United States " 4.0.0 renpengben spring4mvc-jpa war 0.0.1-SNAPSHOT spring4mvc-jpa Maven Webapp https://renpengben.github.io spring4mvc-jpa UTF-8 1.7 4.11 1.7.7 1.2.17 4.0.5.RELEASE 1.6.0.RELEASE 2.1_3 5.1.31 4.3.5.Final 5.1.1.Final 1.0.6 junit junit ${junit.version} test org.slf4j slf4j-api ${slf4j.version} org.slf4j slf4j-log4j12 ${slf4j.version} log4j log4j ${log4j.version} org.springframework spring-core ${spring.version} commons-logging commons-logging org.springframework spring-beans ${spring.version} org.springframework spring-context ${spring.version} org.springframework spring-aop ${spring.version} org.springframework spring-expression ${spring.version} org.springframework spring-tx ${spring.version} org.springframework spring-aspects ${spring.version} org.springframework spring-context-support ${spring.version} org.springframework spring-jdbc ${spring.version} org.springframework spring-orm ${spring.version} org.springframework spring-web ${spring.version} org.springframework spring-webmvc ${spring.version} org.springframework spring-test ${spring.version} test org.springframework.data spring-data-jpa ${spring.data.jpa.version} junit-dep junit cglib cglib-nodep ${cglib.version} org.hibernate hibernate-core ${hibernate.version} org.hibernate hibernate-entitymanager ${hibernate.version} org.hibernate hibernate-validator ${hibernate-validator.version} compile mysql mysql-connector-java ${mysql.version} runtime com.alibaba druid ${druid-version} org.apache.maven.plugins maven-compiler-plugin 2.0.2 1.7 1.7 " 1 validate 2 generate-sources 3 process-sources 4 generate-resources 5 process-resources 6 compile 7 process-test-sources 8 process-test-resources 9 test-compile 10 test 11 package 12 install 13 deploy https://en.wikipedia.org/wiki/Apache_Maven 0 0 maven.apache.org https://github.com/textmate/maven.tmbundle Maven POM manhood manhood 2014 14 pl http://berkin.me/rant 0 v3.0.0 622 0 9 23399 true 0 https://github.com/TheBerkin/Manhood pl 2014 2024 2014 81 106 2964 9 false 2014 2020 991 15 363 5 154221 https://github.com/TheBerkin/rant3/issues csharp markdown html javascript xml yaml css svg json true 3299 0 23 false 3 true United States https://github.com/TheBerkin/Manhood 1 0 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 year|publisher|title|authors|isbn13\n2006|Wingspan Press|Manhood In Black Americans|Joseph A. Bailey|9781595940643 limbo Limbo 1995 Rob Pike 28 pl http://www.vitanuova.com/inferno/limbo.html 0 623 5 23399 2166 true 0 pl 360 367 529 0 text none programming false l/Limbo.b inferno.py 1995 c pascal csp alef newsqueak stackless-python go rust ada isbn 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. 2003 73 119 138 236298 https://groups.google.com/g/inferno-os b m b b true 386 0 29 1 http://resibots.eu/limbo/ text https://github.com/antlr/grammars-v4/tree/master/limbo http://www.rosettacode.org/wiki/Category:Limbo United States "Lock: module { PATH: con ""/dis/lib/lock.dis""; Semaphore: adt { c: chan of int; obtain: fn(nil: self ref Semaphore); release: fn(nil: self ref Semaphore); new: fn(): ref Semaphore; }; init: fn(); };" "implement Hello; include ""sys.m""; sys: Sys; include ""draw.m""; Hello: module { init: fn(ctxt: ref Draw->Context, argv: list of string); }; init(ctxt: ref Draw->Context, argv: list of string) { sys = load Sys Sys->PATH; sys->print(""Hello World\n""); } " Limbo https://riju.codes/limbo "implement Cmd; include ""sys.m""; include ""draw.m""; Cmd : module { init : fn (ctxt : ref Draw->Context, args : list of string); }; init(nil : ref Draw->Context, nil : list of string) { sys := load Sys Sys->PATH; sys->print(""Hello, world!\n""); } " "implement Command; include ""sys.m""; sys: Sys; init(Context, nil: list of string) { sys = load Sys Sys->PATH; print(""Hello World!\n""); }" Limbo sys->print true false https://en.wikipedia.org/wiki/Limbo_(programming_language) 3 1 https://hopl.info/showlanguage.prx?exp=2166 Limbo Limbo 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 Limbo 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 bc basic calculator 1975 19 pl 1 624 3 23395 true 1 idio pl false b/BC.bc basic calculator algebra.py 1975 c unix dc reverse-polish-notation yacc bash "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)." 2004 84 221 236 646359 Bell Labs bc bc 440 0 20 https://tio.run/#bc text 2585 http://www.rosettacode.org/wiki/Category:Bc United States """Hello World"" " BC https://riju.codes/bc """Hello, world! "" " "$ result=$(echo ""scale=2; 5 * 7 /3;"" | bc) $ echo $result 11.66" BC """" true true true https://en.wikipedia.org/wiki/Bc_(programming_language) 0 0 bucklescript Bucklescript 2010 Evan Martin 13 pl https://bucklescript.github.io 0 12.0.0-alpha.1 625 0 19 23393 true 0 https://github.com/BuckleScript/bucklescript pl 2016 2024 2010 130 440 6621 242 false 2010 2025 15052 432 6397 1880 754559 ReScript Association rescript javascript ocaml typescript json cpp markdown bourne-shell python yaml asciidoc c css make xslt lisp vim-script html svg true 8375 0 32 1 false 12 true Unknown https://github.com/BuckleScript/bucklescript 0 0 bucklescript.github.io xslt XSLT 1998 19 xmlFormat 48 626 3 23393 3482 true 49 apache-hbase bucklescript ceylon click cloc dynamo-visual-language ecl eiffel erlang f-prime frost git gradle hhvm ixml jal-compiler java leo-editor linux mal minilang mps ncl netbeans-editor netlogo nexml ninja objectscript open-nn p-star pandas paraview pawn-scripting-language pawn php postgresql powershell pygments python redis reko-decompiler rescript rust saltstack slony smallbasic sympy tibet xt3d xmlFormat 25643 32204 25274 0 xsl xml xml text/xml text.xml.xsl programming false x/XSLT.xslt 97 2004 2018 1 12 html.py xslt xsl xslt xsl xslt xpl 200 0 23 XSL xsl XSLT xslt text http://www.rosettacode.org/wiki/Category:XSLT " Hello World " "
My CD Collection

Title Artist

" XSLT https://riju.codes/xslt "
Hello, world!
" XSLT true true true false 24 0 https://hopl.info/showlanguage.prx?exp=3482 XSLT https://github.com/textmate/xml.tmbundle year|publisher|title|authors|isbn13\n2002|Sybex|Mastering XSLT|Chuck White|9780782140941\n2009|Wrox|Beginning XSLT and XPath: Transforming XML Documents and Data|Williams, Ian|9780470477250\n2003|Wiley|Web Design with XML: Generating Web Pages with XML ,CSS, XSLT and Formatting Objects|Knobloch, Manfred and Kopp, Matthias|9780470847183\n2008|Wrox|XSLT 2.0 and XPath 2.0 Programmer's Reference|Kay, Michael|9780470192740\n2002|Sams Publishing|Sams Teach Yourself XSLT in 21 Days|Van Otegem, Michiel|9780672323188\n2005|O'Reilly Media|XSLT Cookbook: Solutions and Examples for XML and XSLT Developers, 2nd Edition|Mangano, Sal|9780596009748\n2004|Wrox|XSLT 2.0 Programmer's Reference (Programmer to Programmer)|Kay, Michael|9780764569098\n2003|O'Reilly Media|Learning XSLT: A Hands-On Introduction to XSLT and XPath|Michael James Fitzgerald|9780596003272\n2002|For Dummies|XSLT For Dummies|Wagner, Richard|9780764536519\n2004|Apress|Beginning XSLT|Tennison, Jeni|9781590592601\n2009|McGraw-Hill Education|XML: A Beginner's Guide: Go Beyond the Basics with Ajax, XHTML, XPath 2.0, XSLT 2.0 and XQuery|Holzner, Steven|9780071606264\n2009|McGraw-Hill Education|XML: A Beginner's Guide: Go Beyond the Basics with Ajax, XHTML, XPath 2.0, XSLT 2.0 and XQuery|Holzner, Steven|9780071606271\n2001|Prentice Hall|XSLT and Xpath: A Guide to XML Transformations|Gardner, John Robert and Gardner, James Robert and Rendon, Zarella L.|9780130404466\n2007|Visual|XML: Your visual blueprint for building expert websites with XML, CSS, XHTML, and XSLT|Huddleston, Rob|9780471933830\n20051214|O'Reilly Media, Inc.|XSLT Cookbook|Sal Mangano|9780596553302\n20131111|Springer Nature|Beginning XSLT|Jeni Tennison|9781430253686\n20031114|O'Reilly Media, Inc.|Learning XSLT|Michael Fitzgerald|9780596516901\n20051214|O'Reilly Media, Inc.|XSLT Cookbook|Sal Mangano|9780596519070\n20031114|O'Reilly Media, Inc.|Learning XSLT|Michael Fitzgerald|9781449365653\n20061102|Springer Nature|Beginning XSLT 2.0|Jeni Tennison|9781430200468\n2011-05-04|Wiley|XSLT For Dummies|Richard Wagner|9781118085394\n2010|General Books|Xml-based Programming Languages: Xslt|Books and LLC|9781156454862\n2005||Xslt Cookbook,2e (coversxslt 1.0 And 2.0)|Mangano|9788184040784\nOctober 2002||Developing Web User Interface Behaviors: Cutting Edge Webtop Programming Using XML, CSS and XSLT|Slovinski|9780789727794 XSLT chuck Ch 2003 Ge Wang 22 pl http://chuck.cs.princeton.edu 0 627 1 23392 true 0 pl 85 95 571 0 java clike text/x-java source.java programming false 283 2004 2018 21 2003 linux ios "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""." 2004 63 118 319 478750 chuck team ck 536 0 23 1 false text 6367 http://www.rosettacode.org/wiki/Category:ChucK United States // our signal graph (patch) SinOsc f => dac; // set gain .3 => f.gain; // an array of pitch classes (in half steps) [ 0, 2, 4, 6, 9, 10 ] @=> int hi[]; // infinite loop while( true ) { // choose a note, shift registers, convert to frequency Std.mtof( 65 + Std.rand2(0,1) * 43 + hi[Std.rand2(0,hi.cap()-1)] ) => f.freq; // advance time by 120 ms 120::ms => now; } // true true false https://en.wikipedia.org/wiki/ChucK 0 0 Ch chuck.cs.princeton.edu ChucK https://github.com/textmate/java.tmbundle ChucK jython Jython 2001 18 pl 0 628 1 23391 true 0 pl false j/Jython.py 2001 python java c java-bytecode Jython is an implementation of the Python programming language designed to run on the Java platform. It is the successor of JPython. 2003 173 197 364 390263 https://github.com/jython py 885 0 20 text United States and United Kingdom "print ""Hello World""" Jython print """" true true https://github.com/suvarchal/IJython https://en.wikipedia.org/wiki/Jython 10 2 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 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 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 jade JADE 1996 23 pl 0 629 3 23391 2130 true 0 pl false j/Jade.jade 1996 java c pascal modula-2 linc-4gl 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. 2005 84 33 172 5887624 Jade Software Corporation jade 490 0 26 text 9715 jade New Zealand "// Hello World in JADE write ""Hello World"";" "helloWorld(); begin write ""Hello World""; end;" "helloWorld(); begin write ""Hello, World!""; end;" Jade // write """" true true true false true https://en.wikipedia.org/wiki/JADE_(programming_language) 4 0 https://hopl.info/showlanguage.prx?exp=2130 JADE 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 cobra Cobra 2006 Charles Esterbrook 25 pl http://cobra-language.com/ 0 630 3 23390 true 0 pl false c/Cobra.cobra 2008 2006 python eiffel csharp objective-c 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. 2007 82 104 136 13862555 Cobra Language LLC cobra cobra cobra true 431 0 28 1 https://tio.run/#cobra text http://www.rosettacode.org/wiki/Category:Cobra United States Cobra """""""Hello world in Cobra"""""" class Hello def main print 'Hello, world.'" class Hello def main print 'Hello World' class Person var _name as String var _age as int cue init(name as String, age as int) _name, _age = name, age def toString as String is override return 'My name is [_name] and I am [_age] years old' Cobra print ' true true true https://en.wikipedia.org/wiki/Cobra_(programming_language) 1 0 Cobra cobra-language.com 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 chevrotain chevrotain 2015 14 library http://sap.github.io/chevrotain/ 0 v11.0.3 631 1 10 23388 true 0 https://github.com/SAP/chevrotain library 2015 2024 2015 31 201 2450 52 false 2015 2024 3122 78 376 39 68866 SAP typescript javascript markdown json html yaml bourne-shell css json5 csv true 3133 0 24 false 11 true text Germany """use strict"" /** * An Example of implementing a CSV Grammar with Chevrotain. * * Based on: https://github.com/antlr/grammars-v4/blob/master/csv/CSV.g4 * * Note that this is a pure grammar without any actions (either embedded or via a CST Visitor). */ const { createToken, Lexer, Parser, EMPTY_ALT } = require(""chevrotain"") // ----------------- lexer ----------------- const Text = createToken({ name: ""Text"", pattern: /[^,\n\r""]+/ }) const Comma = createToken({ name: ""Comma"", pattern: /,/ }) const NewLine = createToken({ name: ""NewLine"", pattern: /\r?\n/ }) const String = createToken({ name: ""String"", pattern: /""(?:""""|[^""])*""/ }) const allTokens = [Text, String, Comma, NewLine] const CsvLexer = new Lexer(allTokens) // Parser class CsvParser extends Parser { constructor() { super(allTokens) // not mandatory, using $ (or any other sign) to reduce verbosity const $ = this $.RULE(""csvFile"", () => { $.SUBRULE($.hdr) $.AT_LEAST_ONE(() => { $.SUBRULE2($.row) }) }) $.RULE(""hdr"", () => { $.SUBRULE($.row) }) $.RULE(""row"", () => { $.SUBRULE($.field) $.MANY(() => { $.CONSUME(Comma) $.SUBRULE2($.field) }) $.CONSUME(NewLine) }) $.RULE(""field"", () => { $.OR([ { ALT: () => $.CONSUME(Text) }, { ALT: () => $.CONSUME(String) }, { ALT: EMPTY_ALT(""empty field"") } ]) }) // very important to call this after all the rules have been defined. // otherwise the parser may not work correctly as it will lack information // derived during the self analysis phase. this.performSelfAnalysis() } } // wrapping it all together // reuse the same parser instance. const parser = new CsvParser([]) module.exports = function(text) { // 1. Tokenize the input. const lexResult = CsvLexer.tokenize(text) // 2. Set the Parser's input parser.input = lexResult.tokens // 3. invoke the desired parser rule const cst = parser.csvFile() return { cst: cst, lexResult: lexResult, parseErrors: parser.errors } }" https://github.com/SAP/chevrotain 0 0 score score 2013 Jean-Michaël Celerier 15 pl https://ossia.io 0 v3.1.14 632 0 19 23388 true 0 https://github.com/OSSIA/score pl 2013 2024 2013 58 101 1469 357 false 2013 2025 11945 73 4403 66 555023 2017 https://github.com/OSSIA cpp svg cmake bourne-shell c yaml xml objective-cpp markdown qml bash html python json javascript objective-c dockerfile powershell z-shell true 1847 0 34 1 false 3 true true France https://github.com/OSSIA/score 0 0 ossia.io 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 egison Egison 2013 Satoshi Egi 17 pl https://www.egison.org/ 0 4.1.3 633 1 7 23388 true 0 https://github.com/egison/egison/ pl 2013 2024 45 32 905 21 false 2013 2022 3810 33 348 10 29271 University of Tokyo egi haskell restructuredtext markdown yaml lisp python make true 1036 0 33 1 false 4 true Japan -- Extract all twin primes from the infinite list of prime numbers with pattern matching! def twinPrimes := matchAll primes as list integer with | _ ++ $p :: #(p + 2) :: _ -> (p, p + 2) as integer list matchAll multiset set with https://github.com/egison/egison/ -- true 0 0 bnf BNF 1956 John Backus and Peter Naur 13 grammarLanguage 0 634 1 23386 1865 true 2 parsers square grammarLanguage false Backus–Naur Form grammar_notation.py 1956 algol-58 algol algol-60 compiler-compiler yacc symbol ascii regex pl-i peg antlr java haskell coco-r gold bison xpl isbn 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). 488 130 62247 IBM bnf 2460 0 14 2 text https://github.com/antlr/grammars-v4/tree/master/bnf United States BNF " ::= | ::= ""<"" "">"" ""::="" ::= "" "" | """" ::= | ""|"" ::= | ::= | ::= | ""<"" "">"" ::= '""' '""' | ""'"" ""'"" ::= """" | ::= """" | ::= | | ::= ""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"" ::= ""0"" | ""1"" | ""2"" | ""3"" | ""4"" | ""5"" | ""6"" | ""7"" | ""8"" | ""9"" ::= ""|"" | "" "" | ""-"" | ""!"" | ""#"" | ""$"" | ""%"" | ""&"" | ""("" | "")"" | ""*"" | ""+"" | "","" | ""-"" | ""."" | ""/"" | "":"" | "";"" | "">"" | ""="" | ""<"" | ""?"" | ""@"" | ""["" | ""\"" | ""]"" | ""^"" | ""_"" | ""`"" | ""{"" | ""}"" | ""~"" ::= | ""'"" ::= | '""' ::= | ::= | | ""-""" https://en.wikipedia.org/wiki/Backus–Naur_form 0 0 https://hopl.info/showlanguage.prx?exp=1865 monkey Monkey 2011 Anthony Diamond 36 pl https://web.archive.org/web/20171205070657/http://monkey-x.com/ 0 635 3 3 23384 true 0 https://github.com/Regal-Internet-Brothers/webcc-monkey pl 53 116 254 0 text source.monkey programming 2015 2023 2015 3 0 0 1 false m/Monkey 113 2011 2016 5 4 basic.py 2015 2023 36 5 116 1 29597 2011 linux blitzbasic c csharp javascript java basic android ios python opengl webgl objective-c llvmir haxe 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). 2013 14 91 1 31116115 https://github.com/Regal-Internet-Brothers monkey monkey2 monkey javascript html markdown true 297 0 42 1 false https://regal-internet-brothers.github.io/monkey/docs/Tutorials_Getting%20started.html text 6182 http://www.rosettacode.org/wiki/Category:Monkey United States "puts(""Hello World"") " "'Showcases use of Lambda functions and Generics. #Import """" Using std.. Function Main() Local testStack := New Stack< MyObject > For Local n := 1 To 20 Local newItem := New MyObject newItem.depth = Rnd( 0, 100 ) testStack.Push( newItem ) Next testStack.Sort( Lambda:Int( x:MyObject,y:MyObject ) Return x.depth<=>y.depth End ) For Local n := Eachin testStack Print( n.depth ) Next End Struct MyObject Field depth := 0 End" Monkey ' The 'Player' class, as referenced previously (Placement does not matter): Class Player ' Declare all of our fields (Class-local variables): ' These two variables will act as our position on the screen. ' (Alternatively, an 'Array or third-party class could be used) Field x:Float, y:Float ' This will be a reference to an 'Image' object we'll specify. Field image:Image ' Constructor(s): ' Overloading 'New' mainly works the same way as constructors in other languages. ' Returning is generally not recommended for constructors. Method New(img:Image, x:Float=100, y:Float=100) ' Due to the arguments using the same names, 'Self' ' is required to resolve our fields' names: Self.image = img Self.x = x Self.y = y End ' Methods: ' This will be our main render-method for this object: Method Draw:Void() ' Draw the 'image' object to the screen using our 'x' and 'y' fields. DrawImage(image, x, y) ' Returning in a 'Void' function is not required. (Some still recommend it) Return End End Monkey https://github.com/Regal-Internet-Brothers/webcc-monkey ' puts """" true true true true true true true true false true https://en.wikipedia.org/wiki/Monkey_(programming_language) 3 0 Monkey https://github.com/gingerbeardman/monkey.tmbundle 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 Monkey intercal INTERCAL 1972 19 esolang 0 636 4 23374 585 true 0 esolang false i/Intercal.i 1972 ascii utf-8 c 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. 2001 140 69 332 15075 Princeton University i 720 0 19 https://tio.run/#intercal https://esolangs.org/wiki/INTERCAL text INTERCAL http://www.rosettacode.org/wiki/Category:Intercal intercal United States Hello World in Intercal DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #234 DO ,1 SUB #2 <- #112 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22 DO ,1 SUB #9 <- #248 DO ,1 SUB #10 <- #168 DO ,1 SUB #11 <- #24 DO ,1 SUB #12 <- #16 DO ,1 SUB #13 <- #214 PLEASE READ OUT ,1 PLEASE GIVE UP DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22 DO ,1 SUB #9 <- #248 DO ,1 SUB #10 <- #168 DO ,1 SUB #11 <- #24 DO ,1 SUB #12 <- #16 DO ,1 SUB #13 <- #162 PLEASE READ OUT ,1 PLEASE GIVE UP https://riju.codes/intercal DO ,1 <- #14 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22 DO ,1 SUB #9 <- #248 DO ,1 SUB #10 <- #168 DO ,1 SUB #11 <- #24 DO ,1 SUB #12 <- #16 PLEASE DO ,1 SUB #13 <- #162 DO ,1 SUB #14 <- #52 PLEASE READ OUT ,1 PLEASE GIVE UP DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22 DO ,1 SUB #9 <- #248 DO ,1 SUB #10 <- #168 DO ,1 SUB #11 <- #24 DO ,1 SUB #12 <- #16 DO ,1 SUB #13 <- #162 PLEASE READ OUT ,1 PLEASE GIVE UP Intercal https://en.wikipedia.org/wiki/INTERCAL 0 0 https://hopl.info/showlanguage.prx?exp=585 INTERCAL pdf PDF 1993 12 binaryDataFormat 0 637 1 23373 false 1 djvu binaryDataFormat false Portable Document Format 1993 postscript html javascript ascii gzip csv xml linux ghostscript latex 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. 2018 2092 13085 3 24077 Adobe 10480 0 12 binary 1078 United States https://www.adobe.com/content/dam/acom/en/devnet/pdf/pdfs/PDF32000_2008.pdf %Hello World in Portable Document Format (PDF) %PDF-1.2 1 0 obj << /Type /Page /Parent 5 0 R /Resources 3 0 R /Contents 2 0 R >> endobj 2 0 obj << /Length 51 >> stream BT /F1 24 Tf 1 0 0 1 260 600 Tm (Hello World)Tj ET endstream endobj 3 0 obj << /ProcSet[/PDF/Text] /Font <> >> endobj 4 0 obj << /Type /Font /Subtype /Type1 /Name /F1 /BaseFont /Arial >> endobj 5 0 obj << /Type /Pages /Kids [ 1 0 R ] /Count 1 /MediaBox [ 0 0 612 792 ] >> endobj 6 0 obj << /Type /Catalog /Pages 5 0 R >> endobj trailer << /Root 6 0 R >> https://en.wikipedia.org/wiki/Portable_Document_Format 0 0 objective-j Objective-J 2008 Tom Robinson and Francisco Tolmasky and Ross Boucher 27 pl http://www.cappuccino-project.org/ 0 638 3 23373 true 0 pl 298 340 1058 0 obj-j or objectivej or objj text source.js.objj programming false o/Objective J.j 7 2008 2014 3 3 javascript.py 2011 2008 objective-c javascript c smalltalk 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. 2008 31 102 112 19176983 280 North j sj j javascript true 376 0 34 javascript 3 text United States and United Kingdom and Sweden "document.write(""Hello World""); " @import @implementation AppController : CPObject { } - (void)applicationDidFinishLaunching:(CPNotification)aNotification { // The end result of this layout will be the kind of master/detail/auxilliary view // found in iTunes, Mail, and many other apps. var theWindow = [[CPWindow alloc] initWithContentRect:CGRectMakeZero() styleMask:CPBorderlessBridgeWindowMask], contentView = [theWindow contentView]; var navigationArea = [[CPView alloc] initWithFrame:CGRectMake(0.0, 0.0, 150.0, CGRectGetHeight([contentView bounds]) - 150.0)]; [navigationArea setBackgroundColor:[CPColor redColor]]; // This view will grow in height, but stay fixed width attached to the left side of the screen. [navigationArea setAutoresizingMask:CPViewHeightSizable | CPViewMaxXMargin]; [contentView addSubview:navigationArea]; var metaDataArea = [[CPView alloc] initWithFrame:CGRectMake(0.0, CGRectGetMaxY([navigationArea frame]), 150.0, 150.0)]; [metaDataArea setBackgroundColor:[CPColor greenColor]]; // This view will stay the same size in both directions, and fixed to the lower left corner. [metaDataArea setAutoresizingMask:CPViewMinYMargin | CPViewMaxXMargin]; [contentView addSubview:metaDataArea]; var contentArea = [[CPView alloc] initWithFrame:CGRectMake(150.0, 0.0, CGRectGetWidth([contentView bounds]) - 150.0, CGRectGetHeight([contentView bounds]))]; [contentArea setBackgroundColor:[CPColor blueColor]]; // This view will grow in both height an width. [contentArea setAutoresizingMask:CPViewWidthSizable | CPViewHeightSizable]; [contentView addSubview:contentArea]; [theWindow orderFront:self]; } @end Objective-J @implementation Address : CPObject { CPString name; CPString city; } - (id)initWithName:(CPString)aName city:(CPString)aCity { self = [super init]; name = aName; city = aCity; return self; } - (void)setName:(CPString)aName { name = aName; } - (CPString)name { return name; } + (id)newAddressWithName:(CPString)aName city:(CPString)aCity { return [[self alloc] initWithName:aName city:aCity]; } @end Objective J // document.write """" true true true false true https://en.wikipedia.org/wiki/Objective-J 0 0 cappuccino-project.org Objective-J https://github.com/textmate/javascript-objective-j.tmbundle Objective-J openedge-advanced-business-language OpenEdge ABL 2006 19 pl 0 639 2 23369 true 0 pl 2346 2568 72 0 progress or openedge or abl text source.abl programming false 21 2012 2016 6 4 abl business.py 2006 sql isbn 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. 2004 98 36 308 1071357 Progress Software Corporation p cls w p cls false 710 0 19 text United States "MESSAGE ""Hello, world!"". " OpenEdge ABL FOR EACH customer WHERE customer.custno = 14 EXCLUSIVE-LOCK: ASSIGN customer.salesman = 'Fred'. END. true true true true true https://en.wikipedia.org/wiki/OpenEdge_Advanced_Business_Language 0 0 OpenEdge ABL https://github.com/jfairbank/Sublime-Text-2-OpenEdge-ABL OpenEdge ABL bog bog 2020 20 pl 0 640 1 4 23368 true 0 https://github.com/Vexu/bog pl 2020 2024 11 15 531 6 false 2020 2024 444 8 40 2 15688 Small, strongly typed, embeddable language. Small, strongly typed, embeddable language. https://github.com/Vexu/bog/issues Small, strongly typed, embeddable language. zig markdown c yaml true 585 0 24 false Finland "let {print} = import ""std.io"" let world = ""world"" print(f""hello {world}!"")" https://github.com/Vexu/bog true true true true true true true true true 0 0 caml Caml 1985 Gérard Huet and Guy Cousineau and Ascánder Suárez and Pierre Weis and Michel Mauny 24 pl https://caml.inria.fr 0 641 2 23368 1460 true 0 pl false c/CAML.ml Categorical abstract machine language 1985 ocaml ml f-sharp lisp c standard-ml 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. 2005 84 31 124 2362118 Inria ml 441 0 31 ocaml 5 text http://www.rosettacode.org/wiki/Category:Caml France "print_endline ""Hello World"";; " # haar [1; 2; 3; 4; -4; -3; -2; -1];; - : int list = [0; 20; 4; 4; -1; -1; -1; -1] CAML print_endline """" true true https://en.wikipedia.org/wiki/Caml 4 2 https://hopl.info/showlanguage.prx?exp=1460 Caml caml.inria.fr 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 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 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 dasel Dasel 2020 Tom Wright 13 queryLanguage library https://daseldocs.tomwright.me 0 642 1 8 23367 true 0 https://github.com/TomWright/dasel queryLanguage 2020 2024 31 126 6817 34 false DAta SELector 2020 2024 801 29 171 9 6281 A tool to query and modify data structures using selectors. A tool to query and modify data structures using selectors. A tool to query and modify data structures using selectors. go yaml json markdown xml bourne-shell python dockerfile true 7226 0 22 jq 1 false "echo '{""name"": ""Tom""}' | dasel -r json 'name' ""Tom""" https://github.com/TomWright/dasel 0 0 atprotocol AT Protocol 2022 13 protocol microblogging https://atproto.com/ https://atproto.com/specs/atp 0 643 0 11 23365 true 0 https://github.com/bluesky-social/atproto protocol 2021 2024 95 413 5797 247 false Authenticated Transfer Protocol atproto 2021 2025 4889 95 2906 43 371915 A generic federated protocol for building open social media applications. A generic federated protocol for building open social media applications. A generic federated protocol for building open social media applications. typescript json markdown javascript yaml handlebars dockerfile protobuf bourne-shell css make true 7153 0 24 false https://github.com/bluesky-social/atproto https://en.wikipedia.org/wiki/Bluesky_(social_network)#AT_Protocol 0 0 guile Guile 1993 Aubrey Jaffer and Tom Lord and Miles Bader 20 pl https://www.gnu.org/software/guile/ 0 644 1 23364 true 1 poke pl false GNU Ubiquitous Intelligent Language for Extensions 1993 linux scheme lilypond gdb c s-expressions xml emacs-editor emacs-lisp scm tcl "GNU Guile is the preferred extension system for the GNU Project, which features an implementation of the Scheme programming language. Its first version was released in 1993. In addition to large parts of Scheme standards, Guile Scheme includes modularized extensions for many different programming tasks.For extending programs, Guile offers ""libguile"" which allows the language to be embedded in other programs, and integrated closely through the C API; similarly, new types and subroutines defined through the C API can be made available as extensions to Guile itself.Guile stands for the GNU Ubiquitous Intelligent Language for Extensions. It is used in programs like GnuCash, LilyPond, GNU Guix, GuixSD, and GNU Debugger." 2005 71 94 262 1436948 Guile is designed to help programmers create flexible applications that can be extended by users or other programmers with plug-ins, modules, or scripts. Guile is an implementation of the Scheme programming language, supporting the Revised5 and most of the Revised6 language reports, as well as many SRFIs. It also comes with a library of modules that offer additional features, like an HTTP server and client, XML parsing, and object-oriented programming. Guile is designed to help programmers create flexible applications that can be extended by users or other programmers with plug-ins, modules, or scripts. Guile is an implementation of the Scheme programming language, supporting the Revised5 and most of the Revised6 language reports, as well as many SRFIs. It also comes with a library of modules that offer additional features, like an HTTP server and client, XML parsing, and object-oriented programming. GNU Project Guile is designed to help programmers create flexible applications that can be extended by users or other programmers with plug-ins, modules, or scripts. Guile is an implementation of the Scheme programming language, supporting the Revised5 and most of the Revised6 language reports, as well as many SRFIs. It also comes with a library of modules that offer additional features, like an HTTP server and client, XML parsing, and object-oriented programming. true 376 0 23 3 text United States ";;; Hello world program (define name ""World"") (display (string-append ""Hello "" name ""!"")) (newline)" ; true true false https://github.com/jerry40/guile-kernel https://en.wikipedia.org/wiki/GNU_Guile 0 0 nesc nesC 2002 19 pl 0 v1.4.0 645 0 16 23358 true 0 https://github.com/tinyos/nesc pl 416 468 1669 0 text source.nesc programming 2012 2024 2002 30 53 100 13 false 24 2011 2016 7 network embedded systems C c_like.py 2002 2018 828 26 2152 28 163974 c "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""." 2004 37 92 52 1000634 University of California Berkeley && Harvard University nc nc c java m4 perl make lisp bourne-shell html tex yacc logos xml markdown vim-script sql lex true 691 0 36 false 1 true text https://github.com/antlr/grammars-v4/tree/master/tinyos_nesc United States nesC https://github.com/tinyos/nesc https://en.wikipedia.org/wiki/NesC 0 0 nesC https://github.com/cdwilson/nesC.tmbundle nesC erg erg 2022 Shunsuke Shibayama 14 pl http://erg-lang.github.io/ 0 v0.6.37 646 0 10 23356 true 0 https://github.com/erg-lang/erg pl 2022 2024 2022 17 54 2625 70 false 2022 2025 4345 32 1549 21 408389 erg: A Python-compatible statically typed language written in Rust erg: A Python-compatible statically typed language written in Rust https://github.com/erg-lang erg: A Python-compatible statically typed language written in Rust markdown rust python toml yaml nix svg bourne-shell typescript bash true 2821 0 24 1 false 0 true China and Japan https://reddit.com/r/ProgrammingLanguages/comments/wo9u8j/erg_a_pythoncompatible_statically_typed_language/ https://github.com/erg-lang/erg 0 0 whitespace Whitespace 2003 15 esolang 0 647 4 23355 true 0 esolang false w/Whitespace.ws 2003 idris python brainfuck intercal lolcode malbolge Whitespace is an esoteric programming language developed by Edwin Brady and Chris Morris at the University of Durham (also developers of the Kaya and Idris programming languages). It was released on 1 April 2003 (April Fool's Day). Its name is a reference to whitespace characters. Unlike most programming languages, which ignore or assign little meaning to most whitespace characters, the Whitespace interpreter ignores any non-whitespace characters. Only spaces, tabs and linefeeds have meaning. An interesting consequence of this property is that a Whitespace program can easily be contained within the whitespace characters of a program written in another language, except possibly in languages which depend on spaces for syntax validity such as Python, making the text a polyglot. The language itself is an imperative stack-based language. The virtual machine on which the programs run has a stack and a heap. The programmer is free to push arbitrary-width integers onto the stack (currently there is no implementation of floating point numbers) and can also access the heap as a permanent store for variables and data structures. 2003 326 52 295 205017 ws 1650 0 15 https://tio.run/#whitespace https://hackage.haskell.org/package/whitespace-0.4/src/docs/tutorial.html text Whitespace http://www.rosettacode.org/wiki/Category:Whitespace "Hello #World #in #Whitespace * # # * # # # + *[Space] + #is #marked #with""#"" # #[tab] #with""*"" *line-feed #with #""+"" * # *so +it #would +be #easier #to #write #again... #All *the *non-whitespace-characters #are *ignored... * # # + * + # # # # # * * # * * # # + * + # # # # # * * # * * * * + * + # # # # # * # # # # # + * + # # # # # * # * # * * * + * + # # # # # * * # * * * * + * + # # # # # * * * # # * # + * + # # # # # * * # * * # # + * + # # # # # * * # # * # # + * + # # # # # * # # # # * + * + # # # # # * # * # + * + # # + + + " https://riju.codes/whitespace Hello, world S S S T S S T S S S L T L S S S S S T T S S T S T L T L S S S S S T T S T T S S L T L S S S S S T T S T T S S L T L S S S S S T T S T T T T L T L S S S S S T S T T S S L T L S S S S S T S S S S S L T L S S S S S T T T S T T T L T L S S S S S T T S T T T T L T L S S S S S T T T S S T S L T L S S S S S T T S T T S S L T L S S S S S T T S S T S S L T L S S S S S T S S S S T L T L S S L L L Whitespace https://en.wikipedia.org/wiki/Whitespace_(programming_language) 1 0 Whitespace title|year|author|goodreadsId|rating|ratings|reviews\nWhitespace (Programming Language)||Ronald Cohn|64602057|0.0|0|0 cfml CFML 1995 Jeremy Allaire 17 pl http://www.adobe.com/products/coldfusion 0 648 1 23355 5234 true 1 coldfusion-components pl false ColdFusion Markup Language 1995 coldfusion java cfscript javascript xml java-server-pages soap 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. 2004 105 75 257 962933 Adobe && Lucee Association && New Atlanta && openBD && The Railo Company cfm cfc 546 0 https://exercism.org/tracks/cfml 21 1 text United States "" true https://en.wikipedia.org/wiki/ColdFusion_Markup_Language 3 0 https://hopl.info/showlanguage.prx?exp=5234 CFML 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 inko inko 2015 Yorick Peterse 17 pl http://inko-lang.org/ 0 v0.14.0 649 0 13 23355 true 0 https://github.com/YorickPeterse/inko pl 2015 2024 2015 14 38 837 64 false 2015 2025 2787 21 573 14 100278 2016 Inko is a gradually typed, interpreted, object-oriented programming language drawing inspiration from languages such as Smalltalk, Self, Ruby, Erlang and Rust. Inko is a gradually typed, interpreted, object-oriented programming language drawing inspiration from languages such as Smalltalk, Self, Ruby, Erlang and Rust. https://gitlab.com/inko-lang/ Inko is a gradually typed, interpreted, object-oriented programming language drawing inspiration from languages such as Smalltalk, Self, Ruby, Erlang and Rust. rust yaml markdown toml dockerfile bourne-shell json css python make ruby javascript ini true 974 0 30 1 false 0 true text The Netherlands https://github.com/YorickPeterse/inko 0 0 inko-lang.org 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 slash Slash 2012 Hailey Somerville 19 pl http://slash-lang.org 0 650 1 7 23351 true 0 https://github.com/slash-lang/slash pl 388 427 572 0 text text.html.slash programming 2012 2024 2012 40 25 389 12 false 6 2013 2014 1 1 slash.py 2012 2014 1199 7 232 3 25330 https://github.com/slash-lang/slash sl sla c perl make ruby markdown bash yaml true 673 0 29 ruby perl php 1 false text Australia "<% class Env { def init { @memory = []; @ptr = 0; } def ptr { @ptr } def ptr=(ptr) { @ptr = ptr } def current_value { @memory[@ptr] || 0 } def current_value=(value) { @memory[@ptr] = value } } class AST { class Next { def eval(env) { env.ptr++; } } class Prev { def eval(env) { env.ptr--; } } class Inc { def eval(env) { env.current_value++; } } class Dec { def eval(env) { env.current_value--; } } class Output { def eval(env) { print(env.current_value.char); } } class Input { def eval(env) { ... } } class Sequence { def init(nodes) { @nodes = nodes; } def eval(env) { for node in @nodes { node.eval(env); } } } class Loop { def init(seq) { @seq = seq; } def eval(env) { while env.current_value != 0 { @seq.eval(env); } } } } class Parser { def init(str) { @chars = str.split(""""); } def parse { @stack = [[]]; for char in @chars { _parse_char(char); } if @stack.length != 1 { throw SyntaxError.new(""unexpected end of input""); } AST::Sequence.new(@stack.last); } def _parse_char(char) { switch char { "">"" { _add(AST::Next.new); } ""<"" { _add(AST::Prev.new); } ""+"" { _add(AST::Inc.new); } ""-"" { _add(AST::Dec.new); } ""."" { _add(AST::Output.new); } "","" { _add(AST::Input.new); } ""["" { _open_loop(); } ""]"" { _close_loop(); } } } def _add(node) { @stack.last.push(node); } def _open_loop { @stack.push([]); } def _close_loop { if @stack.length == 1 { throw SyntaxError.new(""unexpected ']'""); } nodes = @stack.pop; _add(AST::Loop.new(AST::Sequence.new(nodes))); } } src = File.read(ARGV.first); ast = Parser.new(src).parse; ast.eval(Env.new); " Slash https://github.com/slash-lang/slash 0 0 slash-lang.org Slash https://github.com/slash-lang/Slash.tmbundle Slash lwjgl LWJGL 2007 Caspian Prince 13 library https://www.lwjgl.org/ 0 651 0 15 23350 true 0 https://github.com/LWJGL/lwjgl3 library 2012 2024 161 633 4701 84 false Lightweight Java Game Library 2012 2025 4241 57 8667 130 602512 The Lightweight Java Game Library (LWJGL) is an open-source software library that provides bindings to a variety of C libraries for video game developers to Java. The Lightweight Java Game Library (LWJGL) is an open-source software library that provides bindings to a variety of C libraries for video game developers to Java. The Lightweight Java Game Library (LWJGL) is an open-source software library that provides bindings to a variety of C libraries for video game developers to Java. https://www.youtube.com/watch?v=eEOCmuei3W8 java kotlin c xml cpp markdown yaml glsl json gradle bourne-shell assembly-language objective-c opencl objective-cpp true 6679 0 28 1 false https://github.com/LWJGL/lwjgl3 https://en.wikipedia.org/wiki/LWJGL 0 0 hypertalk HyperTalk 1987 Dan Winkler 21 pl 0 652 2 23346 1328 true 3 applescript hyperscript-lang supertalk pl false h/HyperTalk.ht 1987 pascal actionscript applescript javascript lingo livecode sensetalk supertalk hypercard "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." 2002 51 59 221 78136 Apple ht 275 0 23 1 text https://github.com/antlr/grammars-v4/tree/master/hypertalk http://www.rosettacode.org/wiki/Category:HyperTalk United States "put ""Hello World"" " on mouseUp select the clickLine put word 2 of the clickLine into linenum do line linenum of cd fld 1 end mouseUp HyperTalk put """" true true https://en.wikipedia.org/wiki/HyperTalk 10 1 https://hopl.info/showlanguage.prx?exp=1328 HyperTalk 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 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 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 farcaster Farcaster 2021 Dan Romero and Varun Srinivasan 14 protocol microblogging http://farcaster.xyz 0 0.0.1 653 0 3 23344 true 0 https://github.com/farcasterxyz/protocol protocol 2022 2024 51 244 1913 7 false 2022 2024 170 36 11 1 1464 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. 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. https://github.com/farcasterxyz 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. markdown yaml json true 2683 0 20 activity-pub ssb 2 false 0 true United States https://github.com/farcasterxyz/protocol 0 0 fetlang fetlang 2017 15 esolang 0 654 1 8 23344 true 0 https://github.com/Property404/fetlang esolang 2017 2024 2017 51 36 1486 10 false f/Fetlang.fet 2017 2024 310 13 105 3 56390 A nsfw esolang. A nsfw esolang. https://dagans.dev A nsfw esolang. fet cpp markdown c json python yaml meson bourne-shell true 1608 0 24 false text United States "Make slave scream ""Hello World"" " Fetlang https://github.com/Property404/fetlang """" true 0 0 gdb GDB 1986 16 application https://www.gnu.org/software/gdb 0 655 3 23344 false 0 application 2308 2603 0 text source.gdb programming false 198 2012 2018 2 35 1986 c ada objective-c free-pascal fortran java arm atmel-avr x86-isa mips powerpc sparc arc-isa python guile freebsd vim linux The GNU Debugger (GDB) is a portable debugger that runs on many Unix-like systems and works for many programming languages, including Ada, C, C++, Objective-C, Free Pascal, Fortran, Java and partially others. 2002 192 285 429 13052 GNU Project gdb gdbinit true 1181 0 16 text GDB gdb # # MicropendousX LPC17xx Development Board # # http://www.MicropendousX.org # # Connect to a debugger controlling a LPC17xx # and download firmware. # # Start your OpenOCD gdb server before running # this script with: arm-none-eabi-gdb -x gdb_lpc17xx_program.gdb # # Note the 'monitor' command just passes its # arguments to OpenOCD # # This file is released under the MIT License # # Connect to OpenOCD gdb server target remote localhost:3333 # reset the LPC17xx IC with the OpenOCD reset command monitor reset # the following are OpenOCD commands as in OpenOCD_program.script # which will download a hex file into your LPC17xx monitor halt monitor sleep 200 monitor wait_halt monitor flash probe 0 monitor flash info 0 monitor flash write_image erase unlock USBtoSerial.hex monitor sleep 200 monitor reset run monitor exit quit https://riju.codes/gdb "p ""Hello, world!"" " "GNU gdb (GDB) Fedora (7.3.50.20110722-13.fc16) Copyright (C) 2011 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type ""show copying"" and ""show warranty"" for details. This GDB was configured as ""x86_64-redhat-linux-gnu"". For bug reporting instructions, please see: ... Reading symbols from /path/example...done. (gdb) run Starting program: /path/example size of a = 21 [Inferior 1 (process 14290) exited normally]" https://en.wikipedia.org/wiki/GNU_Debugger 4 0 GDB https://github.com/quarnster/SublimeGDB GDB title|year|author|goodreadsId|rating|ratings|reviews\nC Prog - Using gdb (C Programming)||Subbu Dykes|48953553|0.0|0|0\nLinux Embedded Programming: Using Gcc & Gdb|2001|Robert Wehrli|21076724|0.0|0|0\nAccelerated Linux Core Dump Analysis: Training Course Transcript with GDB Practice Exercises (Pattern-Oriented Software Diagnostics, Forensics, Prognostics, Root Cause Analysis, Debugging Courses)||Dmitry Vostokov|53944849|0.0|0|0\nAccelerated Mac OS X Core Dump Analysis, Second Edition: Training Course Transcript with GDB and LLDB Practice Exercises (Pattern-Oriented Software Diagnostics, ... Root Cause Analysis, Debugging Courses)||Dmitry Vostokov|60311040|0.0|0|0 lobster lobster 2011 Wouter Van Oortmerssen 14 pl http://strlen.com/lobster/ 0 656 0 25 23341 true 0 https://github.com/aardappel/lobster pl 2013 2024 2013 55 118 2212 13 false 2013 2025 2221 59 2744 112 1406170 https://github.com/aardappel/lobster/issues c cpp make objective-c bourne-shell markdown html xml typescript json cmake java perl python yaml hlsl javascript assembly-language m4 gradle css diff bash svg metal true 2627 0 39 1 false text http://www.rosettacode.org/wiki/Category:Lobster United States https://github.com/aardappel/lobster 0 0 snobol SNOBOL 1962 David J. Farber and Ralph E. Griswold 28 pl 0 657 4 23340 171 true 0 pl false s/SNOBOL snobol.py 1962 spitbol icon lua comit trac javascript awk perl regex algol cobol prolog apl basic fortran c ada unicon "SNOBOL (StriNg Oriented and symBOlic Language) is a series of computer programming languages developed between 1962 and 1967 at Bell Labs 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." 2002 64 116 322 29515 Bell Labs snobol 340 0 32 2 text https://github.com/antlr/grammars-v4/tree/master/snobol http://www.rosettacode.org/wiki/Category:Snobol United States https://archives.lib.umn.edu/repositories/3/resources/302 "* Hello World in Snobol OUTPUT = ""Hello World!"" " " OUTPUT = ""Hello World"" END " Snobol https://riju.codes/snobol " OUTPUT = ""Hello, world!"" END " "OUTPUT = ""This program will ask you for personal names"" OUTPUT = ""until you press return without giving it one"" NameCount = 0 :(GETINPUT) AGAIN NameCount = NameCount + 1 OUTPUT = ""Name "" NameCount "": "" PersonalName GETINPUT OUTPUT = ""Please give me name "" NameCount + 1 PersonalName = INPUT PersonalName LEN(1) :S(AGAIN) OUTPUT = ""Finished. "" NameCount "" names requested."" END" SNOBOL * OUTPUT """" true true true false true https://en.wikipedia.org/wiki/SNOBOL 11 4 https://hopl.info/showlanguage.prx?exp=171 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 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 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 tldr tldr 2013 Romain Prieto 12 application https://tldr.sh/ 0 658 0 8 23338 false 0 https://github.com/tldr-pages/tldr application 2013 2024 2013 369 4063 49571 190 false tldr pages 2013 2025 16865 3033 21327 36 432029 2016 markdown yaml python bourne-shell json css svg javascript true 64795 0 20 1 false https://twitter.com/tldr_pages https://github.com/tldr-pages/tldr 0 0 tldr.sh prettier Prettier 2016 James Long 12 library https://prettier.io 0 https://github.com/prettier/prettier/blob/main/CHANGELOG.md 659 0 17 23335 true 0 https://github.com/prettier/prettier library 2016 2024 421 4318 49208 1389 false 2016 2025 9984 787 8789 148 610026 Prettier is an opinionated code formatter. Prettier is an opinionated code formatter. Prettier is an opinionated code formatter. javascript markdown typescript yaml html css json handlebars svg scss graphql less json5 toml xml jsx bourne-shell true 62951 0 29 1 false https://prettier.io/docs https://github.com/prettier/prettier 0 0 pharo Pharo 2008 25 pl https://pharo.org/ 0 660 2 23335 true 0 pl false p/Pharo.st 2008 2008 smalltalk linux squeak newspeak visualworks 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. 2009 72 62 189 23490878 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). 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). https://consortium.pharo.org 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). st http://files.pharo.org/media/pharoCheatSheet.pdf true 381 0 https://exercism.org/tracks/pharo 27 text France https://fosdem.org/2020/schedule/event/pharominimalrefllangkernels/ Object subclass: #Counter instanceVariableNames: ’count initialValue’ classVariableNames: ’’ package: ’MyCounter’ 'Hello World' crLog https://twitter.com/pharoproject Pharo crLog ' true true https://github.com/jmari/JupyterTalk https://en.wikipedia.org/wiki/Pharo 2 7 pharo.org 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 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 css-doodle CSS Doodle 2017 Yuan Chuan 13 pl https://css-doodle.com/ 0 0.39.1 661 1 5 23334 true 0 https://github.com/css-doodle/css-doodle pl 2017 2024 2017 51 209 5568 8 false 2017 2025 1159 9 75 4 12492 https://github.com/css-doodle javascript markdown yaml json make true 6206 0 18 1 false 0 true Various @grid: 14 / 80%; @random { border-left: 1px solid #5d81bc; } @random { border-top: 1px solid #5d81bc; } @random(.25) { background: linear-gradient( @p(#fff, tan, #5d81bc), @lp ) 50% / @r(60%) @lr no-repeat; } @random { filter: drop-shadow(0 0 10px #fff); } https://github.com/css-doodle/css-doodle 0 0 bosque bosque 2019 13 pl 0 662 1 8 23332 true 0 https://github.com/Microsoft/BosqueLanguage pl 2019 2024 2019 169 298 5254 10 false b/Bosque.bsq 2019 2022 585 47 256 50 144288 Microsoft bsq typescript markdown json cpp javascript svg elm yaml true 6196 0 22 false United States "namespace NSMain; entrypoint function main(): String { return ""Hello World""; }" Bosque https://github.com/Microsoft/BosqueLanguage """" true 1 0 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 circle-lang circle-lang 2019 Sean Baxter 14 pl http://www.circle-lang.org/ 0 663 0 7 23332 true 0 https://github.com/seanbaxter/circle pl 2019 2024 2019 72 70 2292 99 false 2019 2023 376 4 510 4 214782 2019 The C++ Automation Language The C++ Automation Language https://github.com/seanbaxter The C++ Automation Language cpp markdown bourne-shell json cuda csv lua true 2508 0 21 1 false United States https://news.ycombinator.com/item?id=23086227 https://github.com/seanbaxter/circle 0 0 circle-lang.org s-expressions S-expressions 1960 13 dataNotation 0 664 2 23331 true 8 bayer-expressions l-expressions liso shrubbery susn sweet-expressions sxml sxml dataNotation false 1994 lisp scheme c common-lisp xml python islisp rfc "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." 2002 311 101 203 54458 MIT 1575 0 15 i-expressions bayer-expressions text https://github.com/antlr/grammars-v4/tree/master/sexpression United States https://dev-docs.kicad.org/en/components/sexpr/ (x . y) "def parse_sexp(string): """""" >>> parse_sexp(""(+ 5 (+ 3 5))"") [['+', '5', ['+', '3', '5']]] """""" sexp = [[]] word = '' in_str = False for char in string: if char is '(' and not in_str: sexp.append([]) elif char is ')' and not in_str: if word: sexp[-1].append(word) word = '' temp = sexp.pop() sexp[-1].append(temp) elif char in (' ', '\n', '\t') and not in_str: if word: sexp[-1].append(word) word = '' elif char is '\""': in_str = not in_str else: word += char return sexp[0]" https://en.wikipedia.org/wiki/S-expression 0 0 earl-grey Earl Grey 2014 Olivier Breuleux 21 pl https://web.archive.org/web/20200813015200/http://www.earl-grey.io/ 0 0.1.2 665 1 3 23327 true 0 https://github.com/breuleux/earl-grey pl 2014 2024 17 6 467 24 false javascript.py 2014 2017 556 3 83 9 8990 https://github.com/breuleux/earl-grey/issues eg javascript markdown json javascript true 490 0 25 1 false 0 true Canada "count-words(text) = counts = new Map() words = text.split(R""\W+"") words each word -> current-count = counts.get(word) or 0 counts.set(word, current-count + 1) consume(counts.entries()).sort(compare) where compare({w1, c1}, {w2, c2}) = c2 - c1" Earl Grey https://github.com/breuleux/earl-grey true true true true true 0 0 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 spry spry 2015 Göran Krampe 22 pl http://sprylang.se/ 0 666 2 9 23322 true 0 https://github.com/gokr/spry pl 2015 2024 2015 28 23 389 1 false n/Ni.nic ni 2015 2023 392 4 106 2 5283 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. 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. https://sprylang.se/about.html 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. nic bourne-shell nim javascript markdown python html r yaml json true 464 0 34 1 false Sweden "# Let's add a method to:do: that works as in Smalltalk. # Methods take the first argument, the ""receiver"", from the left # and binds it to ""self"". to:do: = method [:to :block n = self [n <= to] whileTrue: [ do block n ..n = (n + 1)]] # Then we can loop in Smalltalk style echoing 1 to 5! 1 to: 5 do: [echo :x] # We can similarly implement select: from Smalltalk select: = method [:pred result = ([] clone) self reset [self end?] whileFalse: [ n = (self next) do pred n then: [result add: n]] ^result] # Then use it to produce [3 4] echo ([1 2 3 4] select: [:x > 2])" #48!#65!#6c!#6c!#6f!#20!#57!#6f!#72!#6c!#64! Ni https://github.com/gokr/spry # True False true true true false 0 0 sprylang.se handlebars Handlebars 2010 17 template http://handlebarsjs.com/ 16 667 2 23320 true 16 ace atprotocol ballerina caramel codeql emberjs-framework netbeans-editor neut penrose prettier prql pygments sanddance tibet vine xlwings-editor template 5871 7598 28186 0 hbs or htmlbars handlebars text.html.handlebars markup false 153 2012 2017 2 14 templates.py 2011 https://github.com/handlebars-lang handlebars hbs 251 0 19 handlebars hbs text handlebars handlebars Austria and China "

{{title}}

{{body}}

" "

{{title}}

{{body}}

" Handlebars 0 0 handlebarsjs.com Handlebars https://github.com/daaain/Handlebars Handlebars neut Neut 2018 17 pl https://vekatze.github.io/neut/ 0 0.13.0 668 1 13 23318 true 0 https://github.com/u2zv1wx/neut pl 2020 2024 2018 21 10 831 0 false 2018 2025 6667 6 579 35 54909 https://github.com/vekatze/neut/issues haskell markdown json yaml bourne-shell javascript css typescript handlebars dockerfile svg toml c true 869 0 31 false 0 true Unknown https://www.reddit.com/r/ProgrammingLanguages/comments/gprche/neut_a_dependentlytyped_programming_language_with/ "; download the core library (ensure core/0.1.0.0 ""https://github.com/u2zv1wx/neut-core/raw/master/release/0.1.0.0.tar.gz"") (include ""core/0.1.0.0/core.neut"") (with identity.bind (let str ""a"") (let _ (string.print str)) (let _ (string.print str)) (string.print str))" https://github.com/u2zv1wx/neut ; true true false 0 0 croc Croc 2006 Jarrett Billingsley 26 pl https://web.archive.org/web/20120625151120/http://jfbillingsley.com/croc/ 0 669 2 8 23316 true 2 minid minid https://github.com/JarrettBillingsley/Croc pl 2011 2024 9 12 75 23 false minid d.py 2006 2017 1481 2 226 33 116578 2006 d lua squirrel python io javascript c 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. 2007 13 8 39 10965409 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. 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. http://www.dsource.org/projects/minid 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. croc cpp xml cmake markdown html css python vim-script true 200 0 36 minid 1 false United States "module samples.interfaces class Method { _name _numParams this(name: string, numParams: int) { :_name = name :_numParams = numParams } function name() = :_name function implements(f: function) = f.numParams() == :_numParams function toString() = ""{} ({} params)"".format(:_name, :_numParams) } class Interface { _name _methods _implementors this(name: string, methods: array) { if(!methods.all(\m -> m as Method)) throw TypeError(""All methods must be Methods"") :_name = name :_methods = methods.dup() :_implementors = {} } function implement(T: class) { foreach(m; :_methods) { local name = m.name() if(!hasMethod(T, name) || !m.implements(T.(name))) throw TypeError(""Class {} does not implement method '{}' from {}"".format(nameOf(T), m, :_name)) } :_implementors[T] = true } function opCall(val: instance) { if(superOf(val) not in :_implementors) :implement(superOf(val)) return true } } function implements(T: class, vararg) { for(i; 0 .. #vararg) { local p = vararg[i] if(!(p as Interface)) throw TypeError(""All varargs must be Interfaces"") p.implement(T) } return T } local IStream = Interface(""IStream"", [ Method(""read"", 3) Method(""write"", 3) Method(""seek"", 2) ]) class DerpStream { function read(m, offset, size) {} function write(m, offset, size) {} function seek(offset, whence) {} } function streamSomething(s: @IStream) { s.read() writeln(""yay!"") } function main() { local d = DerpStream() streamSomething(d) }" Croc "function first(x: array|string) = x[0] writeln(first([1, 2, 3])) // prints 1 writeln(first(""hello"")) // prints h writeln(first(45)) // error, invalid parameter type 'int'" https://github.com/JarrettBillingsley/Croc // true true true true true true true false https://web.archive.org/web/20190311032913/https://en.wikipedia.org/wiki/MiniD 0 0 ohm ohm 2014 13 grammarLanguage 0 v17.1.0 670 0 11 23314 true 0 https://github.com/harc/ohm grammarLanguage 2015 2024 2014 89 217 4937 44 false 2014 2025 1889 46 1313 26 174384 https://github.com/harc javascript json markdown typescript bash html yaml css python bourne-shell xml true 5635 0 24 false 17 true https://tio.run/#ohm text Germany and United States https://github.com/harc/ohm 0 0 olc Open Location Code 2014 13 geoCode https://maps.google.com/pluscodes/ 0 671 0 25 23313 false 0 https://github.com/google/open-location-code geoCode 2014 2024 185 474 4098 55 false Open Location Code Plus Codes 2014 2025 791 84 329 5 18526 Simple, free to use, open-source digital addressing, for the entire world. Simple, free to use, open-source digital addressing, for the entire world. Google Simple, free to use, open-source digital addressing, for the entire world. java markdown xml go javascript dart bazel json rust cpp ruby bourne-shell html c python yaml csv gradle asciidoc sql visual-basic bash css make toml true 5626 0 38 false https://github.com/google/open-location-code https://en.wikipedia.org/wiki/Open_Location_Code 0 0 spider spider 2014 Alon Gubkin 15 pl http://spiderlang.org/ 0 0.1.5 672 0 4 23311 true 0 https://github.com/alongubkin/spider pl 2014 2024 51 46 1340 30 false 2014 2017 368 10 159 2 29116 https://github.com/alongubkin/spider/issues spider javascript markdown json yaml javascript true 1490 0 21 1 false 0 true Israel https://github.com/alongubkin/spider true 0 0 blitzbasic BlitzBasic 2000 21 pl 0 673 2 23309 true 0 pl 417 492 595 0 b3d or blitz3d or blitzplus or bplus text source.blitzmax programming false 35 2009 2016 3 2 basic.py 2000 basic linux monkey opengl ascii lua unicode csharp purebasic ios 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. 2001 51 126 448 4840 Blitz Research bb decls bb decls 475 0 23 https://daemonbite.com/files/linked/BB21Manual.pdf text New Zealand Local i, start, result Local s.Sum3Obj = New Sum3Obj For i = 1 To 100000 s = New Sum3Obj result = Handle Before s Delete s Next start = MilliSecs() For i = 1 To 1000000 result = Sum3_(MakeSum3Obj(i, i, i)) Next start = MilliSecs() - start Print start start = MilliSecs() For i = 1 To 1000000 result = Sum3(i, i, i) Next start = MilliSecs() - start Print start WaitKey End Function Sum3(a, b, c) Return a + b + c End Function Type Sum3Obj Field isActive Field a, b, c End Type Function MakeSum3Obj(a, b, c) Local s.Sum3Obj = Last Sum3Obj If s\isActive Then s = New Sum3Obj s\isActive = True s\a = a s\b = b s\c = c Restore label Read foo Return Handle(s) End Function .label Data (10 + 2), 12, 14 : Function Sum3_(a_) Local a.Sum3Obj = Object.Sum3Obj a_ Local return_ = a\a + a\b + a\c Insert a Before First Sum3Obj :: a\isActive = False Return return_ End Function ;~IDEal Editor Parameters: ;~C#Blitz3D BlitzBasic "AppTitle = ""Binary Clock"" Graphics 145,85 secondtimer = CreateTimer(2) Repeat Hour = CurrentTime()[..2].ToInt() Minute = CurrentTime()[4..6].ToInt() Second = CurrentTime()[6..].ToInt() If Hour >= 12 Then PM = 1 If Hour > 12 Then Hour = Hour - 12 If Hour = 0 Then Hour = 12 'should do this otherwise the PM dot will be 'Left up once the clock rolls past midnight! Cls SetColor(0,255,0) 'make the text green For the PM part If PM = 1 Then DrawText ""PM"",5,5 'set the text colour back To white For the rest SetColor(255,255,255) For bit=0 Until 6 xpos=20*(6-bit) binaryMask=2^bit 'do hours If (bit<4) If (hour & binaryMask) DrawText ""1"",xpos,5 Else DrawText ""0"",xpos,5 EndIf EndIf 'do the minutes If (minute & binaryMask) DrawText ""1"", xpos,25 Else DrawText ""0"", xpos,25 EndIf 'do the seconds If (second & binaryMask) DrawText ""1"",xpos,45 Else DrawText ""0"",xpos,45 EndIf Next 'make the text red For the decimal time SetColor(255,0,0) DrawText ""Decimal: "" + CurrentTime(),5,65 'set the text back To white For the rest SetColor(255,255,255) Flip 'will wait half a second WaitTimer(secondTimer) If KeyHit(KEY_ESCAPE) Then Exit Forever" True False true true true true true true true https://en.wikipedia.org/wiki/Blitz_BASIC 0 0 BlitzBasic https://github.com/textmate/blitzmax.tmbundle BlitzBasic cool Classroom Object Oriented Language 1996 Alexander Aiken 26 pl 0 674 2 23308 true 0 pl 56 57 102 0 text source.cool programming false 4 2014 2014 2 1 Classroom Object Oriented Language 1996 clips sather java ml pascal ocaml mips 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. 2007 25 18 105 14782123 Stanford University cl 345 0 32 1 text 1457 https://github.com/antlr/grammars-v4/tree/master/esolang/cool United States (* This simple example of a list class is adapted from an example in the Cool distribution. *) class List { isNil() : Bool { true }; head() : Int { { abort(); 0; } }; tail() : List { { abort(); self; } }; cons(i : Int) : List { (new Cons).init(i, self) }; }; class Cons inherits List { car : Int; -- The element in this list cell cdr : List; -- The rest of the list isNil() : Bool { false }; head() : Int { car }; tail() : List { cdr }; init(i : Int, rest : List) : List { { car <- i; cdr <- rest; self; } }; }; "class Main inherits IO { main(): Object {{ out_string(""Enter an integer greater-than or equal-to 0: ""); let input: Int <- in_int() in if input < 0 then out_string(""ERROR: Number must be greater-than or equal-to 0\n"") else { out_string(""The factorial of "").out_int(input); out_string("" is "").out_int(factorial(input)); out_string(""\n""); } fi; }}; factorial(num: Int): Int { if num = 0 then 1 else num * factorial(num - 1) fi }; };" Cool -- (* *) out_string true false true true true true true false https://en.wikipedia.org/wiki/Cool_(programming_language) 0 0 Cool https://github.com/anunayk/cool-tmbundle Cool netbeans-editor netbeans-editor 2013 pgebauer 13 editor https://netbeans.apache.org 0 675 0 50 23306 false 0 https://github.com/apache/netbeans editor 2017 2024 2017 165 838 2609 806 false 2017 2025 12422 362 92388 416 14002130 Apache Software Foundation java xml php javascript html xsd standard-ml dtd twig svg groovy java-server-pages bourne-shell pug xhtml xslt css json c yaml gradle diff smarty typescript fxml sql markdown ini make cpp scss toml less rust bash python hcl swift xmi perl r aspectj handlebars haskell prolog jsx restructuredtext dockerfile go ruby true 5487 0 63 1 false https://www.youtube.com/user/NetBeansVideos United States https://github.com/apache/netbeans 0 0 harbour Harbour 1999 Antonio Linares 24 pl https://harbour.github.io/ 1 676 2 23304 true 1 tibet pl 80 86 45 0 text source.harbour programming false h/Harbour.prg 157 2014 2017 7 1999 clipper dbase linux unix ios android tcp mysql postgresql sqlite xbase c java visual-foxpro visual-objects xbasepp Harbour is a modern computer programming language, primarily used to create database/business programs. It is a modernized, open sourced and cross-platform version of the older Clipper system, which in turn developed from the dBase database market of the 1980s and 90s. Harbour code using the same databases can be compiled under a wide variety of platforms, including Microsoft Windows, Linux, Unix variants, several BSD descendants, Mac OS X, MINIX 3, Windows CE, Pocket PC, Symbian, iOS, Android, QNX, VxWorks, OS/2/eComStation, BeOS/Haiku, AIX and MS-DOS. 2010 2 49 1 1882856 https://github.com/harbour hb prg prg ch hb hbp true 231 0 27 1 hb text http://www.rosettacode.org/wiki/Category:Harbour Various "PROCEDURE Main() ? ""Hello World"" RETURN " "#include ""hbclass.ch"" PROCEDURE Main() LOCAL oPerson CLS oPerson := Person():New( ""Dave"" ) oPerson:Eyes := ""Invalid"" oPerson:Eyes := ""Blue"" Alert( oPerson:Describe() ) RETURN CREATE CLASS Person VAR Name INIT """" METHOD New( cName ) METHOD Describe() ACCESS Eyes INLINE ::pvtEyes ASSIGN Eyes( x ) INLINE iif( HB_ISSTRING( x ) .AND. x $ ""Blue,Brown,Green"", ::pvtEyes := x, Alert( ""Invalid value"" ) ) PROTECTED: VAR pvtEyes ENDCLASS // Sample of normal Method definition METHOD New( cName ) CLASS Person ::Name := cName RETURN Self METHOD Describe() CLASS Person LOCAL cDescription IF Empty( ::Name ) cDescription := ""I have no name yet."" ELSE cDescription := ""My name is: "" + ::Name + "";"" ENDIF IF ! Empty( ::Eyes ) cDescription += ""my eyes' color is: "" + ::Eyes ENDIF RETURN cDescription" Harbour // """" true true false true https://en.wikipedia.org/wiki/Harbour_(programming_language) 0 0 harbour.github.io Harbour https://github.com/hernad/atom-language-harbour Harbour erb ERB 2004 15 template 14 677 3 23301 true 14 ace capybara codeql contracts.coffee haml heap.coffee homebrew-pm jasmine jekyll mastodon plaid-programming-language ruby slim toffeescript template 276 0 HTML erb or rhtml or html+ruby text htmlembedded application/x-erb text.html.erb markup false 458 2013 2018 2 76 templates.py 2004 html asp java-server-pages php rails xml perl java linux haml rdoc 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. 2006 36 94 148 3883199 eRuby (Embedded Ruby) is a templating system that embeds Ruby into a text document. eRuby (Embedded Ruby) is a templating system that embeds Ruby into a text document. https://github.com/ruby eRuby (Embedded Ruby) is a templating system that embeds Ruby into a text document. erb erbdeface rhtml 400 0 17 ERB erb text Various
<% 4.times do %>
list item
<% end %>
"<% provide(:title, @header) %> <% present @users do |user_presenter| %>

<%= @header %>

<%= will_paginate %>

Name

Email

Chords

Keys

Tunings

Credits

Prem?

Since?

<% if @users == [] %>

No Users

<% else %> <%= render @users %> <% end %>

<%= will_paginate %>

<% end %>" ERB class ERBExample attr_accessor:variable1 # using bind to access class variables def render() renderer.result(binding) end def initialize(variable1) @variable1 = variable1 end # Expose private binding() method. def get_binding binding() end end example = ERBExample.new(variable1) renderer = ERB.new(template) puts output = renderer.result(example.get_binding) https://en.wikipedia.org/wiki/ERuby 0 0 https://github.com/atom/language-ruby HTML+ERB nushell Nushell 2019 Yehuda Katz 12 pl https://www.nushell.sh/ 0 0.93.0 678 0 12 23300 true 0 https://github.com/nushell/nushell pl 2019 2024 2019 186 1593 31107 1461 false 2019 2025 10026 787 1972 56 https://github.com/nushell rust json toml markdown yaml bourne-shell csv python powershell dockerfile xml ini true 36675 0 24 1 false 0 true Ecuador https://github.com/nushell/nushell 0 0 ssb Secure Scuttlebutt 2014 13 protocol https://www.scuttlebutt.nz/ 0 16.0.1 679 0 4 23298 true 1 farcaster https://github.com/ssbc/ssb-server protocol 2014 2024 73 163 1687 40 false SSB 2014 2022 2179 55 19 4 8862 https://github.com/ssbc javascript json yaml markdown true 2253 0 17 false 16 true New Zealand https://github.com/ssbc/ssb-server https://en.wikipedia.org/wiki/Secure_Scuttlebutt 0 0 catala Catala 2019 Denis Merigoux 14 pl https://catala-lang.org/ 0 0.10.0 680 1 20 23296 true 0 https://github.com/CatalaLang/catala pl 2020 2024 2019 21 78 1951 72 false 2019 2025 4658 71 546 63 84200 2020 https://github.com/CatalaLang ocaml markdown nix json bourne-shell svg tex python toml xml cson c make vim-script javascript rescript r yaml lisp dockerfile true 2258 0 34 1 false 0 true Various scope QualifiedEmployeeDiscount : definition qualified_employee_discount under condition is_property consequence equals if employee_discount >$ customer_price ×$ gross_profit_percentage then customer_price ×$ gross_profit_percentage else employee_discount https://github.com/CatalaLang/catala 0 0 catala-lang.org dexvis dexvis 2012 Patrick Martin 14 application http://dexvis.net/ 0 681 0 20 23294 false 0 https://github.com/PatMartin/Dex application 2016 2024 2016 125 310 1318 5 false 2016 2019 596 2 2164 172 1839414 2016 Dex : The Data Explorer -- A data visualization tool written in Java/Groovy/JavaFX capable of powerful ETL and publishing web visualizations. Dex : The Data Explorer -- A data visualization tool written in Java/Groovy/JavaFX capable of powerful ETL and publishing web visualizations. https://github.com/PatMartin Dex : The Data Explorer -- A data visualization tool written in Java/Groovy/JavaFX capable of powerful ETL and publishing web visualizations. javascript html groovy css java csv markdown json php coffeescript xml sql bourne-shell yaml svg make c dockerfile r ruby true 2252 0 34 1 false United States https://dexvis.wordpress.com/2012/11/19/261/ https://github.com/PatMartin/Dex 0 0 dexvis.net alloy Alloy 1997 24 pl http://alloytools.org/ 0 682 2 23294 true 0 pl 84 90 759 0 text source.alloy programming false 8 2013 2014 3 3 dsls.py 2017 1997 z-notation 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. 2007 31 18 50 11268035 MIT als als 376 0 27 text 9510 https://github.com/antlr/grammars-v4/tree/master/alloy // A file system object in the file system sig FSObject { parent: lone Dir } // A directory in the file system sig Dir extends FSObject { contents: set FSObject } // A file in the file system sig File extends FSObject { } // A directory is the parent of its contents fact { all d: Dir, o: d.contents | o.parent = d } // All file system objects are either files or directories fact { File + Dir = FSObject } // There exists a root one sig Root extends Dir { } { no parent } // File system is connected fact { FSObject in Root.*contents } // The contents path is acyclic assert acyclic { no d: Dir | d in d.^contents } // Now check it for a scope of 5 check acyclic for 5 // File system has one root assert oneRoot { one d: Dir | no d.parent } // Now check it for a scope of 5 check oneRoot for 5 // Every fs object is in at most one directory assert oneLocation { all o: FSObject | lone d: Dir | o in d.contents } // Now check it for a scope of 5 check oneLocation for 5 module examples/systems/file_system /* * Model of a generic file system. */ abstract sig Object {} sig Name {} sig File extends Object {} { some d: Dir | this in d.entries.contents } sig Dir extends Object { entries: set DirEntry, parent: lone Dir } { parent = this.~@contents.~@entries all e1, e2 : entries | e1.name = e2.name => e1 = e2 this !in this.^@parent this != Root => Root in this.^@parent } one sig Root extends Dir {} { no parent } lone sig Cur extends Dir {} sig DirEntry { name: Name, contents: Object } { one this.~entries } /** * all directories besides root have one parent */ pred OneParent_buggyVersion { all d: Dir - Root | one d.parent } /** * all directories besides root have one parent */ pred OneParent_correctVersion { all d: Dir - Root | (one d.parent && one contents.d) } /** * Only files may be linked (that is, have more than one entry) * That is, all directories are the contents of at most one directory entry */ pred NoDirAliases { all o: Dir | lone o.~contents } check { OneParent_buggyVersion => NoDirAliases } for 5 expect 1 check { OneParent_correctVersion => NoDirAliases } for 5 expect 0 Alloy // /* */ true true true true false https://en.wikipedia.org/wiki/Alloy_(specification_language) 0 13 alloytools.org Alloy https://github.com/macekond/Alloy.tmbundle Alloy 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 emberscript EmberScript 2012 Michael Ficarra and Gordon L. Hempton 18 pl http://emberscript.com/ 0 0.0.14 683 1 7 23293 true 0 https://github.com/ghempton/ember-script pl 417 459 206 0 coffee coffeescript text/x-coffeescript source.coffee programming 2012 2024 2012 11 27 357 28 false 332 2013 2018 1 30 2012 2015 749 35 82 4 85287 2012 https://github.com/ghempton/ember-script/issues em emberscript javascript coffeescript ruby make json markdown yaml true 675 0 26 2 false 0 true text Various class App.FromNowView extends Ember.View tagName: 'time' template: Ember.Handlebars.compile '{{view.output}}' output: ~> return moment(@value).fromNow() didInsertElement: -> @tick() tick: -> f = -> @notifyPropertyChange 'output' @tick() nextTick = Ember.run.later(this, f, 1000) @set 'nextTick', nextTick willDestroyElement: -> nextTick = @nextTick Ember.run.cancel nextTick Ember.Handlebars.helper 'fromNow', App.FromNowView https://github.com/ghempton/ember-script 0 0 emberscript.com EmberScript https://github.com/atom/language-coffee-script EmberScript roslyn-compiler Roslyn compiler 2009 12 compiler https://docs.microsoft.com/dotnet/csharp/roslyn-sdk/ 0 v4.2.0 684 0 17 23284 true 0 https://github.com/dotnet/roslyn compiler 2015 2024 2014 1030 3992 18765 9252 false 2014 2025 119552 1043 19272 2229 8831629 2010 .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. -1 13 33644243 https://github.com/dotnet csharp visual-basic.net xml markdown yaml powershell xaml cadence-skill bourne-shell json diff xsd cpp f-sharp cmake csv dockerfile true 31801 0 29 false 4 true United States https://github.com/dotnet/roslyn https://en.wikipedia.org/wiki/Roslyn_(compiler) 0 0 risc-v RISC-V 2010 14 isa 0 685 2 23279 true 0 isa false r/RISC V.s riscv 2010 linux verilog llvmir freebsd javascript assembly-language mips powerpc sparc x86-isa arm mmx "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." 2014 424 243 714 43653496 University of California Berkeley 2140 0 15 na https://github.com/antlr/grammars-v4/tree/master/asm/asmRISCV United States ".data hello_world: .asciiz ""Hello World"" .text main: la a1, hello_world li a0, 4 ecall li a0, 10 ecall" https://riju.codes/riscv " .text .global main main: addi a7, x0, 64 addi a0, x0, 1 la a1, message addi a2, x0, 14 ecall addi a7, x0, 93 addi a0, x0, 0 ecall .data message: .string ""Hello, world!\n"" " RISC V """" true https://en.wikipedia.org/wiki/RISC-V 0 0 ligo Ligo 2019 32 contractLanguage https://ligolang.org/ 0 1.6.0 686 0 22 23278 true 0 https://gitlab.com/ligolang/ligo contractLanguage 0 LigoLANG rust rust text/x-rustsrc source.religo programming false reasonligo 2016 2025 21495 260 9643 278 971667 https://ide.ligolang.org/ 2019 https://www.marigold.dev/projects religo ocaml markdown javascript json typescript haskell bourne-shell svg yaml css ruby scss make dockerfile coq vim-script lisp mustache nix python html xml https://ligolang.org/docs/api/cheat-sheet true 261 0 103 solidity pascal reason ocaml false 1 true pascaligo France 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 https://gitlab.com/ligolang/ligo // (* *) true false true true true true true true true 0 0 ligolang.org CameLIGO vlc VLC 1996 Jean-Baptiste Kempf 12 application video http://www.videolan.org/vlc 0 687 0 33 23277 false 0 https://github.com/videolan/vlc application 2012 2024 579 5000 13674 2 false VideoLAN Client 1999 2025 113745 1088 5257 599 c cpp diff qml objective-c svg xml make lua meson bourne-shell qt m4 assembly-language python html rust markdown json glsl toml javascript visual-basic yaml css yacc lex dtd xsd perl vim-script protobuf cmake true 29784 0 45 1 false France https://github.com/videolan/vlc https://en.wikipedia.org/wiki/VLC_media_player 0 0 spatial Spatial 2018 David Koeplinger 23 pl https://spatial-lang.org/ 0 688 1 18 23276 true 0 https://github.com/stanford-ppl/spatial pl 2018 2024 2017 23 32 271 70 false Specify Parameterized Accelerators Through Inordinately Abstract Language 2017 2020 4612 22 2376 103 1631204 2018 Spatial: A High Level Programming Language for FPGAs Spatial: A High Level Programming Language for FPGAs Stanford University Spatial: A High Level Programming Language for FPGAs scala xml tcl vhdl html make bourne-shell cpp scheme python ini c csv bash markdown tex diff yaml true 391 0 42 1 false text 6389 United States "import spatial.dsl._ @spatial object HelloSpatial extends SpatialApp { def main(args: Array[String]): Void = { // Create ArgIn val x = ArgIn[Int] // Set `x` to the value of the first command line argument setArg(x, args(0).to[Int]) Accel { // Create 16x32 SRAM and a Register val s = SRAM[Int](16,32) val r = Reg[Int] // Loop over each element in SRAM Foreach(16 by 1, 32 by 1){(i,j) => s(i,j) = i + j } // Store element into the register, based on the input arg r := s(x,x) // Print value of register (only shows in Scala simulation) println(r""Value of SRAM at (${x.value},${x.value}) is ${r.value}"") } } }" https://github.com/stanford-ppl/spatial // true true false 13 0 spatial-lang.org 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 morse-code Morse code 1837 Samuel Morse 12 notation 0 689 3 23275 true 0 notation false m/Morse code 1966 nato-phonetic-alphabet tap-code "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." 2001 5843 3444 18935 29235 0 12 1 https://morsecode.readthedocs.io/en/latest/ https://github.com/antlr/grammars-v4/tree/master/morsecode United States −− −−− ·−· ··· · −·−· −−− −·· · .... . .-.. .-.. --- .-- --- .-. .-.. -.. M O R S E C O D E −− −−− ·−· ··· · (space) −·−· −−− −·· · Morse code https://en.wikipedia.org/wiki/Morse_code 0 0 micro-editor micro-editor 2016 12 editor https://micro-editor.github.io 0 v2.0.13 690 0 9 23272 false 0 https://github.com/zyedidia/micro editor 2016 2024 2016 262 1159 24513 897 false 2016 2025 3334 377 327 14 12822 https://github.com/zyedidia/micro/issues yaml go markdown bourne-shell lua svg json make xml true 28369 0 21 false 2 true United States https://github.com/zyedidia/micro 0 0 micro-editor.github.io hackett Hackett 2017 Alexis King 15 pl lisp https://lexi-lambda.github.io/hackett/ 0 691 1 5 23269 true 0 https://github.com/lexi-lambda/hackett pl 2016 2024 2017 67 49 1159 35 false 2017 2020 293 11 86 2 9516 Hackett is an attempt to implement a Haskell-like language with support for Racket’s macro system, built using the techniques described in the paper Type Systems as Macros. Hackett is an attempt to implement a Haskell-like language with support for Racket’s macro system, built using the techniques described in the paper Type Systems as Macros. https://github.com/lexi-lambda/hackett/issues Hackett is an attempt to implement a Haskell-like language with support for Racket’s macro system, built using the techniques described in the paper Type Systems as Macros. racket markdown yaml css bourne-shell true 1319 0 20 1 false text United States "#lang hackett (data (Maybe a) Nothing (Just a)) (def x : Integer (let ([y 3] [z 7]) {y + z})) (class (Show a) [show : {a -> String}]) (instance (forall [a] (Show a) => (Show (Maybe a))) [show (λ* [[(Just x)] {""(Just "" ++ (show x) ++ "")""}] [[Nothing ] ""Nothing""])])" https://github.com/lexi-lambda/hackett 0 0 volt Volt 2011 23 pl http://www.volt-lang.org/ 0 v0.1.3 692 1 9 23269 true 0 https://github.com/VoltLang/Volta pl 298 351 158 0 d d text/x-d source.d programming 2012 2024 2011 13 8 153 3 false 113 2006 2018 1 7 2011 2024 4072 10 1429 12 117643 2013 Volt is a C-inspired programming language that toes the line between expressiveness and control. Volt is a C-inspired programming language that toes the line between expressiveness and control. Volt is a C-inspired programming language that toes the line between expressiveness and control. volt d markdown c assembly-language toml make json xml restructuredtext true 389 0 34 false 0 true text 7173 "// Copyright © 2012-2013, Jakob Bornecrantz. All rights reserved. // See copyright notice in src/volt/license.d (BOOST ver. 1.0). module main; import core.stdc.stdio; import core.stdc.stdlib; import watt.process; import watt.path; import results; import list; import cmd; int main() { auto cmdGroup = new CmdGroup(); bool printOk = true; bool printImprovments = true; bool printFailing = true; bool printRegressions = true; string compiler = getEnv(""VOLT""); if (compiler is null) { printf(""compiler envar not set\n"".ptr); return -1; } /// @todo Scan for files auto tests = testList; int total; int passed; int failed; int improved; int regressed; auto rets = new Result[] (tests.length); for (size_t i; i < tests.length; i++) { rets[i] = new Result(); rets[i].runTest(cmdGroup, tests[i], compiler); } cmdGroup.waitAll(); for (size_t i; i < tests.length; i++) { auto ret = rets[i]; total++; if (ret.ok) { passed++; improved += cast(int)!ret.hasPassed; if (!ret.hasPassed && printImprovments) { printf(""%s: %s, improved!\n"".ptr, ret.test.ptr, ret.msg.ptr); } else if (printOk) { printf(""%s: %s\n"".ptr, ret.test.ptr, ret.msg.ptr); } } else { failed++; regressed += cast(int)ret.hasPassed; if (ret.hasPassed && printRegressions) { printf(""%s: %s, regressed!\n"".ptr, ret.test.ptr, ret.msg.ptr); } else if (printFailing) { printf(""%s: %s\n"".ptr, ret.test.ptr, ret.msg.ptr); } } fflush(stdout); } auto xml = fopen(""results.xml"".ptr, ""w+"".ptr); if (xml !is null) { fprintf(xml, ""\n"".ptr, regressed, failed - regressed, total); for (size_t i; i < rets.length; i++) { rets[i].xmlLog(xml); } fprintf(xml, ""\n"".ptr); fflush(xml); fclose(xml); xml = null; } auto rate = cast(float)passed / cast(float)total * 100.f; printf(""Summary: %i tests, %i pass%s, %i failure%s, %.2f%% pass rate, %i regressions, %i improvements.\n"".ptr, total, passed, (passed == 1 ? """".ptr : ""es"".ptr), failed, (failed == 1 ? """".ptr : ""s"".ptr), cast(double)rate, regressed, improved); return regressed ? -1 : 0; } " https://github.com/VoltLang/Volta // printf true true true false 0 0 volt-lang.org Volt https://github.com/textmate/d.tmbundle Volt concise-encoding Concise Encoding 2018 Karl Stenerud 29 dataNotation https://concise-encoding.org 0 693 10 3 23269 true 0 https://github.com/kstenerud/concise-encoding dataNotation 2018 2024 2018 7 4 257 24 false 2018 2023 1044 4 19 4 7200 2019 Concise Encoding gives you ease and efficiency with its 1:1 compatible text and binary formats. Concise Encoding gives you ease and efficiency with its 1:1 compatible text and binary formats. https://github.com/kstenerud/concise-encoding Concise Encoding gives you ease and efficiency with its 1:1 compatible text and binary formats. markdown svg json true 275 0 35 1 false Czech Republic and Germany "c1 { // Custom types are user-defined, with user-supplied codecs. ""custom text"" = |c ""cplx(2.94+3i)""| ""custom binary"" = |c 01 f6 28 3c 40 00 00 40 40| }" https://github.com/kstenerud/concise-encoding // true false true true true false 0 0 concise-encoding.org asn-1 ASN.1 1984 14 idl 0 694 3 23268 1070 true 0 idl 0 0 text asn.1 text/x-ttcn-asn source.asn data false 20 2016 2016 1 4 1984 protobuf thrift ascii json xml "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." 2002 358 145 363 75625 International Telecommunication Union && International Electrotechnical Commission asn asn1 2060 0 15 text https://github.com/antlr/grammars-v4/tree/master/asn/asn asn-1 United Kingdom FooProtocol DEFINITIONS ::= BEGIN FooQuestion ::= SEQUENCE { trackingNumber INTEGER, question IA5String } FooAnswer ::= SEQUENCE { questionNumber INTEGER, answer BOOLEAN } END "MyShopPurchaseOrders DEFINITIONS AUTOMATIC TAGS ::= BEGIN PurchaseOrder ::= SEQUENCE { dateOfOrder DATE, customer CustomerInfo, items ListOfItems } CustomerInfo ::= SEQUENCE { companyName VisibleString (SIZE (3..50)), billingAddress Address, contactPhone NumericString (SIZE (7..12)) } Address::= SEQUENCE { street VisibleString (SIZE (5 .. 50)) OPTIONAL, city VisibleString (SIZE (2..30)), state VisibleString (SIZE(2) ^ FROM (""A""..""Z"")), zipCode NumericString (SIZE(5 | 9)) } ListOfItems ::= SEQUENCE (SIZE (1..100)) OF Item Item ::= SEQUENCE { itemCode INTEGER (1..99999), color VisibleString (""Black"" | ""Blue"" | ""Brown""), power INTEGER (110 | 220), deliveryTime INTEGER (8..12 | 14..19), quantity INTEGER (1..1000), unitPrice REAL (1.00 .. 9999.00), isTaxable BOOLEAN } END " 5 Anybody there? https://en.wikipedia.org/wiki/Abstract_Syntax_Notation_One 0 0 https://hopl.info/showlanguage.prx?exp=1070 https://github.com/ajLangley12/language-asn1 ASN.1 rstudio RStudio 2011 Joseph J. Allaire 14 editor https://www.rstudio.com 0 695 0 23267 false 0 editor false 1998 2011 java javascript ia-32 r cfml linux qt knitr 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 Joseph J. 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. 2012 407 212 128 36691501 RStudio, Inc https://rstudio.github.io/cheatsheets/html/rstudio-ide.html true 2056 0 14 1 na United States https://twitter.com/rstudio https://en.wikipedia.org/wiki/RStudio 0 0 rstudio.com jslt JSLT 2017 Lars Marius Garshol 16 pl 0 0.1.14 696 0 8 23267 true 0 https://github.com/schibsted/jslt pl 2018 2024 2017 34 119 620 108 false jslt.py 2017 2024 519 17 179 2 8944 https://github.com/schibsted jslt java markdown json html yaml gradle bourne-shell lisp true 995 0 24 1 false 0 true Norway JSLT https://github.com/schibsted/jslt true true true true 0 0 ragel Ragel 2007 23 pl http://complang.org/ragel/ 0 697 1 10 23267 true 0 https://github.com/bnoordhuis/ragel pl 295 317 66 0 ragel-rb or ragel-ruby text none programming 2013 2024 2007 7 19 156 1 false parsers.py 2007 2013 821 8 475 3 112767 2017 c d go ruby java regex ascii xuml umple 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. 2006 29 21 88 8052388 https://github.com/bnoordhuis/ragel/issues rl cpp make bourne-shell vim-script awk m4 ocaml tex ruby lex true 388 0 34 false text The Netherlands "=begin %%{ machine simple_scanner; action Emit { emit data[(ts+8)..(te-7)].pack('c*') } foo = 'STARTFOO' any+ :>> 'ENDFOO'; main := |* foo => Emit; any; *|; }%% =end # Scans a file for ""STARTFOO[...]ENDFOO"" blocks and outputs their contents. # # ENV['CHUNK_SIZE'] determines how much of the file to read in at a time, allowing you to control memory usage. # # Uses ragel's scanner functionality even though it's not strictly necessary. class SimpleScanner attr_reader :path def initialize(path) @path = path %% write data; # % (this fixes syntax highlighting) end def emit(foo) $stdout.puts foo end def perform # So that ragel doesn't try to get it from data.length pe = :ignored eof = :ignored %% write init; # % (this fixes syntax highlighting) leftover = [] File.open(path) do |f| while chunk = f.read(ENV['CHUNK_SIZE'].to_i) data = leftover + chunk.unpack('c*') p ||= 0 pe = data.length %% write exec; # % (this fixes syntax highlighting) if ts leftover = data[ts..pe] p = p - ts ts = 0 else leftover = [] p = 0 end end end end end s = SimpleScanner.new ARGV[0] s.perform" Ragel https://github.com/bnoordhuis/ragel # true true true true false https://en.wikipedia.org/wiki/Ragel 0 0 Ragel Ragel borgo Borgo 2023 Marco Sampellegrini 13 pl https://borgo-lang.github.io/ 0 698 1 11 23265 true 0 https://github.com/borgo-lang/borgo pl 2023 2025 31 58 4261 29 false 2023 2024 170 2 386 2 86535 https://borgo-lang.github.io/ A language for writing applications that is more expressive than Go but less complex than Rust. A language for writing applications that is more expressive than Go but less complex than Rust. A language for writing applications that is more expressive than Go but less complex than Rust. expect rust markdown typescript toml json go javascript yaml nix css go true 4439 0 25 1 false "use fmt enum NetworkState { Loading, Failed(int), Success(T), } struct Response { title: string, duration: int, } fn main() { let res = Response { title: ""Hello world"", duration: 0, } let state = NetworkState.Success(res) let msg = match state { NetworkState.Loading => ""still loading"", NetworkState.Failed(code) => fmt.Sprintf(""Got error code: %d"", code), NetworkState.Success(res) => res.title, } fmt.Println(msg) }" https://github.com/borgo-lang/borgo 0 0 cypher Cypher Query Language 2011 20 queryLanguage https://neo4j.com/developer/cypher-query-language/ 0 699 1 23264 true 0 queryLanguage false graph.py 2011 sql sparql 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. 2014 79 43 49 41583056 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. 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. Neo4j 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. cyp cypher 466 0 67 text https://github.com/antlr/grammars-v4/tree/master/cypher cypher cypher Various Cypher MATCH (start:Content)-[:RELATED_CONTENT]->(content:Content) WHERE content.source = 'user' OPTIONAL MATCH (content)-[r]-() DELETE r, content 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 // /* */ true true true https://en.wikipedia.org/wiki/Cypher_Query_Language 0 0 django Django 2005 13 library 0 700 1 23262 true 0 library false d/Django.py 40 2005 2014 6 2003 python regex html xml json nginx-config postgresql mysql sqlite mongodb jython ruby perl php erlang isbn "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." 2005 821 449 1048 2247376 Django Software Foundation py https://cheatsheets.zip/django true 4375 0 13 text django United States "from django.http import HttpResponse def index(request): return HttpResponse(""Hello World"")" Django https://en.wikipedia.org/wiki/Django_(web_framework) 0 0 https://github.com/textmate/python-django.tmbundle jsx JSX 2013 17 template http://reactjs.org 23 701 2 23259 true 24 ace bun codeql deno flow mastodon mathpix-markdown mdx nadesiko netbeans-editor nodejs packagist-pm prettier prql pygments quint react-native reactjs smallbasic sqrl tibet wasp-lang wing xodio template 0 false 298 2015 2018 1 20 2013 Facebook jsx 201 0 18 jsx text https://github.com/antlr/grammars-v4/tree/master/javascript/jsx United States https://en.wikipedia.org/wiki/React_(JavaScript_library)#JSX class App extends React.Component { render() { return (
Header Content Footer
); } } "'use strict'; const React = require('react') module.exports = React.createClass({ render: function() { let {feeds, log} = this.props; log.info(feeds); return

News Feed's

{feeds.map(function(feed) { return
{feed.data && feed.data.length > 0 ? {feed.name} ({feed.data.length}) : 'feed.name' }
})}

; } });" https://twitter.com/reactjs 0 0 reactjs.org https://github.com/github-linguist/babel-sublime JSX crush crush 2020 Axel Liljencrantz 14 pl 0 702 0 6 23255 true 0 https://github.com/liljencrantz/crush pl 2019 2024 2019 22 35 1832 20 false 2019 2024 733 13 228 3 33504 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. 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. https://github.com/liljencrantz/ 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. rust markdown toml json csv protobuf true 1951 0 21 powershell 1 false Sweden https://news.ycombinator.com/item?id=24079001 https://github.com/liljencrantz/crush 3 0 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 troff Troff 1973 15 textMarkup https://www.troff.org/ 0 703 1 23254 2589 true 5 eqn groff nroff roff scroll-lang textMarkup false 1960 unix bcpl assembly-language c latex scheme unicode tex scribe troff is the major component of a document processing system developed by AT&T Corporation for the Unix operating system. troff features commands to designate fonts, spacing, paragraphs, margins, footnotes and more. Unlike many other text formatters, troff can position characters arbitrarily on a page, even overlapping them, and has a fully programmable input language. Separate preprocessors are used for more convenient production of tables, diagrams, and mathematics. Inputs to troff are plain text files that can be created by any text editor. Extensive macro packages have been created for various document styles. A typical distribution of troff includes the me macros for formatting research papers, man and mdoc macros for creating Unix man pages, mv macros for creating mountable transparencies, and the ms and mm macros for letters, books, technical memoranda, and reports. 2001 94 134 186 30811 The Text Processor for Typesetters The Text Processor for Typesetters The Text Processor for Typesetters 541 0 15 text troff United States "\"" ""Hello, world!"" in troff Hello, world! " https://en.wikipedia.org/wiki/Troff 1 0 https://hopl.info/showlanguage.prx?exp=2589 troff.org title|year|author|goodreadsId|rating|ratings|reviews\nFree Typesetting Software: LaTeX, Troff, Scribus, FIGlet, Lout, Noweb, FreeType, Graphite, Groff,|2010|Books LLC|16221131|0.0|0|0 xla XLA 2017 12 compiler https://openxla.org 0 704 0 16 23253 true 1 mlir https://github.com/openxla/xla compiler 2022 2025 44 488 2877 2876 false 2017 2025 35262 863 6586 243 1674427 XLA (Accelerated Linear Algebra) is an open source compiler for machine learning. The XLA compiler takes models from popular frameworks such as PyTorch, TensorFlow, and JAX, and optimizes the models for high-performance execution across different hardware platforms including GPUs, CPUs, and ML accelerators. XLA (Accelerated Linear Algebra) is an open source compiler for machine learning. The XLA compiler takes models from popular frameworks such as PyTorch, TensorFlow, and JAX, and optimizes the models for high-performance execution across different hardware platforms including GPUs, CPUs, and ML accelerators. Google XLA (Accelerated Linear Algebra) is an open source compiler for machine learning. The XLA compiler takes models from popular frameworks such as PyTorch, TensorFlow, and JAX, and optimizes the models for high-performance execution across different hardware platforms including GPUs, CPUs, and ML accelerators. cpp bazel starlark python protobuf markdown diff cmake bourne-shell yaml svg pascal jupyter-notebook json c llvmir true 5226 0 28 false United States https://github.com/openxla/xla https://en.wikipedia.org/wiki/Accelerated_Linear_Algebra 0 0 sgml SGML 1986 13 dataNotation standard textMarkup 0 705 1 23253 1435 true 1 topic-maps dataNotation false Standard Generalized Markup Language 1986 ibm-gml html xml scheme linux hytime regex unicode xquery java-server-pages scala dtd s-expressions latex 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. 2001 384 761 575 28994 IBM 1940 0 13 text United States first line second line https://en.wikipedia.org/wiki/Standard_Generalized_Markup_Language 5 1 https://hopl.info/showlanguage.prx?exp=1435 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 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 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 dex dex 2018 14 pl 0 706 1 16 23252 true 0 https://github.com/google-research/dex-lang pl 2019 2024 2018 58 107 1565 145 false 2018 2024 4200 58 260 38 64349 Google haskell python julia yaml markdown bash cpp nix c lisp typescript make css html toml xml true 1945 0 31 false United States :p x = 1. -- let binding y = (z = 2.; z + 1.) -- let binding of a nested let expression .. -- escaped cosmetic line break x + y -- body of let expression https://github.com/google-research/dex-lang -- true true false 0 0 austral Austral 2018 Fernando Borretti 15 pl https://austral-lang.org/ 0 v0.2.0 707 1 12 23251 true 0 https://github.com/austral/austral/ pl 2018 2024 29 39 1101 18 false 2018 2024 8948 28 978 6 43056 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. 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. https://github.com/austral/ 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. markdown ocaml make json typescript python vim-script nix yaml bourne-shell c lisp true 1248 0 27 1 false 0 true Unknown https://borretti.me/article/introducing-austral "let db: Db := connect(""localhost""); close(db); -- The below is tuple destructuring notation. let { first as db1: Db, second: Rows } := query(db, ""SELECT ...""); close(db); -- error: `db` consumed again. -- another error: `db1` never consumed." https://github.com/austral/austral/ 0 0 max Max 1990 15 jsonFormat https://cycling74.com/products/max/ 0 708 1 23250 true 0 jsonFormat 877 1031 5939 0 max/msp or maxmsp json javascript application/json source.json programming false 21 2007 2016 3 11 1990 c linux puredata opengl csound supercollider java javascript 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. 2004 205 171 756 479795 Cycling '74 maxpat maxhelp maxproj mxt pat false 1246 0 15 text 1428 United States 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; https://en.wikipedia.org/wiki/Max_(software) 2 0 Max https://github.com/textmate/json.tmbundle 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 Max vale Vale 2020 14 pl https://vale.dev/ 0 v0.2.0 709 1 11 23249 true 0 https://github.com/ValeLang/Vale pl 2020 2024 2020 32 53 1752 245 false 2020 2024 2122 25 1042 213 106072 2019 scala markdown cpp c xml html bourne-shell python yaml cmake dockerfile true 1938 0 26 false 0 true "exported func main() { println(""Hello world!""); }" https://twitter.com/vale_pl https://github.com/ValeLang/Vale println true 0 0 vale.dev fortress Fortress 2004 20 pl http://projectfortress.java.net/ 0 710 2 23249 8170 true 1 chapel pl false 2006 fortran scala haskell scheme common-lisp java unicode standard-ml ascii emacs-editor latex x10 chapel sisal 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. 2005 54 171 164 1822171 Sun Labs true 291 0 22 text http://www.rosettacode.org/wiki/Category:Fortress United States "(* Hello World in Fortress *) export Executable run(args) = print ""Hello, world!"" " component hello export Executable run() = println(“Hello, World!”) end (* *) true true false https://en.wikipedia.org/wiki/Fortress_(programming_language) 0 6 https://hopl.info/showlanguage.prx?exp=8170 Fortress projectfortress.java.net 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 gun Gun 2014 Mark Nadal 12 protocol https://gun.eco 0 711 0 14 23248 true 0 https://github.com/amark/gun protocol 2014 2024 318 1164 18092 310 false 2014 2024 2808 180 571 34 131828 An open source cybersecurity protocol for syncing decentralized graph data. An open source cybersecurity protocol for syncing decentralized graph data. An open source cybersecurity protocol for syncing decentralized graph data. javascript typescript html json markdown xml css gradle objective-c yaml bourne-shell java bash dockerfile true 21766 0 26 1 false https://gun.eco/docs United States https://github.com/amark/gun 0 0 apex Apex 2007 39 pl https://developer.salesforce.com/docs/atlas.en-us.apexcode.meta/apexcode/apex_intro_what_is_apex.htm 0 712 2 23247 true 0 pl 537 778 22719 0 java clike text/x-java source.java programming false a/Apex.cls 283 2004 2018 6 21 43 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. 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. http://www.zdnet.com/article/inside-the-salesforce-apex-language/ Salesforce 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. cls cls typescript 201 0 468 text https://github.com/antlr/grammars-v4/tree/master/apex apex http://www.rosettacode.org/wiki/Category:Apex https://en.wikipedia.org/wiki/Salesforce.com#Apex global with sharing class HelloWorld { global static void main() { System.debug('Hello World'); } } "public class GeoUtils { // generate a KML string given a page reference, call getContent() // then cleanup the output. public static string generateFromContent(PageReference pr) { string ret = ''; try { ret = (string) pr.getContent().toString(); ret = ret.replaceAll('""','\'' ); // get content produces quote chars \"" ret = ret.replaceAll( '&','&');// we need to escape these in the node value } catch (exception e ) { system.debug( 'ERROR '+e); } ret = ret.replaceAll('\n',' '); // must use ALL since many new line may get ret = ret.replaceAll('\r',' '); // get these also! // system.debug( ret); // dump the KML return ret ; } public static Map geo_response = new Map{'200'=>'G_GEO_SUCCESS', '400'=>'G_GEO_BAD_REQUEST', '500'=>'G_GEO_SERVER_ERROR', '601'=>'G_GEO_MISSING_ADDRESS', '602'=>'G_GEO_UNKNOWN_ADDRESS', '603'=>'G_GEO_UNAVAILABLE_ADDRESS', '604'=>'G_GEO_UNKNOWN_DIRECTIONS', '610'=>'G_GEO_BAD_KEY', '620'=>'G_GEO_TOO_MANY_QUERIES' }; public static string accountAddressString ( account acct ) { // form an address string given an account object string adr = acct.billingstreet + ',' + acct.billingcity + ',' + acct.billingstate; if ( acct.billingpostalcode != null ) adr += ',' + acct.billingpostalcode; if ( acct.billingcountry != null ) adr += ',' + acct.billingcountry; adr = adr.replaceAll('\""', '' ); adr = adr.replaceAll('\'', '' ); adr = adr.replaceAll( '\n', ' ' ); adr = adr.replaceAll( '\r', ' ' ); system.debug( adr ); return adr; } public static testmethod void t1() { PageReference pageRef = Page.kmlPreviewTemplate; Test.setCurrentPage(pageRef); system.assert ( GeoUtils.generateFromContent( pageRef ) != null ); Account a = new Account( name='foo', billingstreet='main', billingcity='springfield',billingstate='il', billingpostalcode='9',billingcountry='us'); insert a; system.assertEquals( 'main,springfield,il,9,us',accountAddressString( a) ); } }" Apex https://marketplace.visualstudio.com/items?itemName=salesforce.salesforcedx-vscode-apex 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 // /* */ ' true false true true true true true true true true true true false true true true 19 0 Apex Apex https://github.com/textmate/java.tmbundle 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 Apex ocl OCL 1997 16 pl 0 713 1 23246 true 0 pl false 2008 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. 186 498 409006 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. 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. IBM 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. 950 0 17 https://github.com/antlr/grammars-v4/tree/master/ocl United States https://www.omg.org/spec/OCL/2.2/PDF context Person inv: self.age >=0 context Person inv: self.age<18 implies self.cars->isEmpty() -- true true false https://en.wikipedia.org/wiki/Object_Constraint_Language 0 0 wasmer wasmer 2018 Syrus Akbary 12 vm https://wasmer.io 0 v4.3.1 714 0 22 23244 false 0 https://github.com/wasmerio/wasmer vm 2018 2024 2018 205 775 18285 321 false 2018 2025 21939 252 2468 1102 2667716 rust wasm markdown toml svg c cpp graphql yaml bourne-shell xml python sql json dockerfile swift make html nix javascript diff php true 20864 0 34 1 false 4 true https://twitter.com/wasmerio https://github.com/wasmerio/wasmer 0 0 wasmer.io cito Ć 2011 Piotr Fusik 14 pl https://github.com/pfusik/cito 0 3.1.0-development 715 1 13 23243 true 0 https://github.com/pfusik/cito pl 2019 2024 32 55 1727 34 false 2011 2025 2666 13 708 6 126075 Ć programming language. Translated automatically to C, C++, C#, Java, JavaScript, Python, Swift, TypeScript and OpenCL C. Ć programming language. Translated automatically to C, C++, C#, Java, JavaScript, Python, Swift, TypeScript and OpenCL C. http://fusik.info/piotr/ Ć programming language. Translated automatically to C, C++, C#, Java, JavaScript, Python, Swift, TypeScript and OpenCL C. json markdown make csharp cpp javascript yaml xml vim-script java typescript perl svg true 1907 0 27 1 false 3 true Unknown "public class HelloCi { public static string GetMessage() { return ""Hello, world!""; } }" https://github.com/pfusik/cito 0 0 kicad KiCad Legacy Layout 1992 16 application cad 0 716 2 23241 false 0 application 914 1099 0 text source.pcb.board data false 25 2017 2018 1 1 1992 linux freebsd gerber-image eagle opengl java vrml "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." 2007 143 154 263 8853175 KiCad writes all files in human readable ASCII. This makes manipulation by hand and scripting very easy. KiCad writes all files in human readable ASCII. This makes manipulation by hand and scripting very easy. Instituts Universitaires de Technologie de Grenoble KiCad writes all files in human readable ASCII. This makes manipulation by hand and scripting very easy. sch lib brd kicad_pcb kicad_wks kicad_mod brd true 935 0 22 text France http://kicad-pcb.org/help/file-formats/d "(kicad_pcb (version 3) (host pcbnew ""(2013-02-20 BZR 3963)-testing"") (general (links 2) (no_connects 0) (area 57.924999 28.924999 74.075001 42.075001) (thickness 1.6) (drawings 5) (tracks 5) (zones 0) (modules 2) (nets 3) ))" "PCBNEW-BOARD Version 1 date Fri Oct 19 11:53:05 2012 # Created by Pcbnew(2012-05-21 BZR 3261)-stable $GENERAL encoding utf-8 LayerCount 2 Ly 1FFF8001 EnabledLayers 1FFF8001 Links 135 NoConn 11 Di 41844 16849 73060 58324 Ndraw 54 Ntrack 512 Nzone 0 BoardThickness 630 Nmodule 51 Nnets 44 $EndGENERAL $SHEETDESCR Sheet A4 11700 8267 Title """" Date ""19 oct 2012"" Rev """" Comp """" Comment1 """" Comment2 """" Comment3 """" Comment4 """" $EndSHEETDESCR $SETUP InternalUnit 0.000100 INCH Layers 2 Layer[0] Back signal Layer[15] Front signal TrackWidth 80 TrackWidthList 200 TrackWidthList 500 TrackWidthList 1000 TrackClearence 80 ZoneClearence 200 TrackMinWidth 80 DrawSegmWidth 80 EdgeSegmWidth 150 ViaSize 270 ViaDrill 130 ViaMinSize 270 ViaMinDrill 130 ViaSizeList 310 160 ViaSizeList 370 200 ViaSizeList 420 250 MicroViaSize 200 MicroViaDrill 50 MicroViasAllowed 0 MicroViaMinSize 200 MicroViaMinDrill 50 TextPcbWidth 75 TextPcbSize 300 400 EdgeModWidth 80 TextModSize 600 600 TextModWidth 120 PadSize 551 551 PadDrill 150 Pad2MaskClearance 80 Pad2PasteClearanceRatio -0.12 AuxiliaryAxisOrg 0 0 PcbPlotParams (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 """")) $EndSETUP $EQUIPOT Na 0 """" St ~ $EndEQUIPOT $EQUIPOT Na 1 ""/DC"" St ~ $EndEQUIPOT $EQUIPOT Na 2 ""/DD"" St ~ $EndEQUIPOT $EQUIPOT Na 3 ""/P0_0"" St ~ $EndEQUIPOT $EQUIPOT Na 4 ""/P0_1"" St ~ $EndEQUIPOT $EQUIPOT Na 5 ""/P0_2"" St ~ $EndEQUIPOT $EQUIPOT Na 6 ""/P0_3"" St ~ $EndEQUIPOT $EQUIPOT Na 7 ""/P0_4"" St ~ $EndEQUIPOT $EQUIPOT Na 8 ""/P0_5"" St ~ $EndEQUIPOT $EQUIPOT Na 9 """ https://en.wikipedia.org/wiki/KiCad 0 0 KiCad https://github.com/Alhadis/language-pcb KiCad Legacy Layout pan Pan 2011 Charles Loomis 24 pl http://www.quattor.org/ 0 717 2 13 23241 true 0 https://github.com/quattor/pan pl 119 150 41 0 text source.pan programming 2012 2023 2011 27 19 12 65 false 117 2013 2018 18 17 dsls.py 2011 2025 999 27 1283 5 1501147 2003 java 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. 2011 4 5 27 33160613 https://github.com/quattor pan pan pan tpl java xml html restructuredtext ini clojure perl vim-script yaml svg python markdown bash true 338 0 38 1 false text 3457 Various "unique template site/one/onevm; include 'components/chkconfig/config'; # set opennebula map include 'quattor/aii/opennebula/schema'; bind ""/system/opennebula"" = opennebula_vmtemplate; include 'site/config-vm'; include 'quattor/aii/opennebula/default'; ""/software/packages/{acpid}"" = dict(); ""/software/components/chkconfig/service/acpid"" = dict('on', '', 'startstop', true); " Pan [ object | declaration | unique | structure ] template template-name; [ statement … ] https://github.com/quattor/pan # true true false https://en.wikipedia.org/wiki/Pan_(programming_language) 0 0 quattor.org Pan https://github.com/quattor/language-pan Pan puredata Pure Data 1996 17 pl http://puredata.info/ 0 718 1 23240 6444 true 0 pl 696 914 3084650 0 text none data false p/Pure Data.pd 2017 linux ios android freebsd max opengl c python scheme lua tcl 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. 2004 137 135 319 480378 University of California San Diego pd true 706 0 17 text United States #N canvas 1029 457 450 300 10; #X obj 127 132 print; #X msg 127 86 Hello World; #X connect 1 0 0 0; Pure Data https://en.wikipedia.org/wiki/Pure_Data 0 0 https://hopl.info/showlanguage.prx?exp=6444 Pure Data puredata.info Pure Data Pure Data cilk CIL 1994 20 pl http://www.cilk.com/ 0 719 1 23240 1899 true 0 pl 1 text source.cil data false 1999 1994 c opencl nesl unified-parallel-c 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. 2004 85 179 211 945803 Intel cil 446 0 21 text http://www.rosettacode.org/wiki/Category:Cilk United States // y ← α x + y void axpy(int n, float alpha, const float *x, float *y) { for (int i = 0; i < n; i++) { y[i] += alpha * x[i]; } } // true true false https://en.wikipedia.org/wiki/Cilk 3 4 https://hopl.info/showlanguage.prx?exp=1899 CIL cilk.com 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 CIL 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 ferret ferret 2017 Nurullah Akkaya 15 pl lisp http://ferret-lang.org 0 0.4.0 720 1 3 23239 true 0 https://github.com/nakkaya/ferret pl 2016 2024 2015 41 48 1068 15 false 2015 2020 1645 10 8 3 11832 2017 Near East University yaml make markdown true 1224 0 18 1 false 0 true North Cyprus ;;; lazy-sum.clj (defn positive-numbers ([] (positive-numbers 1)) ([n] (cons n (lazy-seq (positive-numbers (inc n)))))) (println (->> (positive-numbers) (take 5) (apply +))) https://github.com/nakkaya/ferret 0 0 ferret-lang.org 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 bend Bend 2023 Victor Taelin 12 pl https://higherorderco.com 0 0.2.18 721 1 5 23235 true 0 https://github.com/HigherOrderCO/Bend pl 2023 2024 90 413 16930 73 false 2023 2025 2176 58 1099 74 37893 bend rust markdown toml yaml json true 18229 0 18 1 false 0 true # Defines the function Sum with two parameters: start and target def Sum(start, target): if start == target: # If the value of start is the same as target, returns start. return start else: # If start is not equal to target, recursively call Sum with # start incremented by 1, and add the result to start. return start + Sum(start + 1, target) def main(): # This translates to (1 + (2 + (3 + (...... + (999999 + 1000000))))) # Note that this will overflow the maximum value of a number in Bend return Sum(1, 1_000_000) https://github.com/HigherOrderCO/Bend 0 0 haste haste 2014 Anton Ekblad 14 pl http://haste-lang.org 0 0.5.4 722 0 13 23235 true 0 https://github.com/valderman/haste-compiler pl 2012 2024 2012 56 115 1446 63 false 2012 2019 1887 48 710 5 129519 2014 https://github.com/valderman/haste-compiler/issues haskell javascript make html markdown bourne-shell c yaml pascal yacc xml logos diff true 1841 0 27 1 false 0 true Sweden https://github.com/valderman/haste-compiler 0 0 haste-lang.org id|title|url|time|timestamp|by|comments|score\n7513516|Haste language|http://haste-lang.org/|2014-04-02 04:10:26 UTC|1396411826|kruipen|73|259 lux Lux 2014 Eduardo Julián 14 pl lisp https://luxlang.github.io/lux/ 0 0.8.0 723 0 6 23234 true 0 https://github.com/LuxLang/lux/ pl 2015 2024 67 50 1666 1 false 2014 2025 2769 17 2359 50 437760 https://github.com/LuxLang lux markdown clojure yaml svg lisp bourne-shell javascript java php python r ruby scheme true 1835 0 28 1 false 0 true Dominican Republic https://github.com/LuxLang/lux/ 0 0 drakon DRAKON 1996 Stepan Mitkin 15 pl https://drakon-editor.com/ 0 724 1 19 23231 true 0 https://github.com/stepan-mitkin/drakon_editor pl 2014 2024 2014 46 56 344 42 false 2014 2020 175 9 633 8 164828 2015 1996 uml perl tcl linux c csharp d erlang go java javascript lua processing python verilog isbn "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." 2007 130 71 208 9912359 Soviet space program tcl c csharp autohotkey bash erlang bourne-shell xml html javascript python java lua cpp sql objective-c go d markdown true true 1193 0 34 1 false text Russia "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." https://github.com/stepan-mitkin/drakon_editor https://en.wikipedia.org/wiki/DRAKON 0 0 drakon-editor.com porffor Porffor 2023 Oliver Medhurst 14 compiler https://porffor.dev/ 0 725 0 7 23230 true 0 https://github.com/CanadaHonk/porffor compiler 2023 2024 20 30 1704 87 false 2023 2025 2531 17 126 10 40132 https://porffor.dev/ Porffor is a unique JS engine/compiler/runtime, compiling JS code to WebAssembly or native ahead-of-time. Porffor is a unique JS engine/compiler/runtime, compiling JS code to WebAssembly or native ahead-of-time. Porffor is a unique JS engine/compiler/runtime, compiling JS code to WebAssembly or native ahead-of-time. javascript typescript markdown json bourne-shell brainfuck html wasm true 1813 0 24 javascript typescript 1 false https://discord.gg/wPV3WgDGwg https://github.com/CanadaHonk/porffor 0 0 cperl cperl 2017 Reini Urban 14 pl http://perl11.github.io/ 0 726 0 22 23227 true 0 https://github.com/perl11/cperl pl 2015 2024 1987 21 17 142 119 false 1987 2022 94417 1592 7391 341 2885140 2021 "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." "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." https://github.com/perl11/ "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." perl yaml c bourne-shell xml pascal json logos cpp tex make javascript markdown d diff css lisp prolog sql yacc bash csv true 1787 0 36 1 false Various https://github.com/perl11/cperl 0 0 perl11.org renpy Ren'Py 2004 16 pl 0 727 1 23223 true 0 pl 47 49 3124 0 renpy python source.renpy programming false 238 2013 2018 1 26 2004 python cython linux freebsd android ios utf-8 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. 2008 130 250 375 17474146 https://github.com/renpy rpy true 870 0 17 text England "### Demo Script Example ### # This script, but not the artwork associated with it, is in the # public domain. Feel free to use it as the basis for your own # game. # If you're trying to understand this script, I recommend skipping # down to the line beginning with 'label start:', at least on your # first read-through. # This init block runs first, and sets up all sorts of things that # are used by the rest of the game. Variables that are set in init # blocks are _not_ saved, unless they are changed later on in the # program. init: # Set up the size of the screen, and the window title. $ config.screen_width = 800 $ config.screen_height = 600 $ config.window_title = ""The Ren'Py Demo Game"" # Declare the images that are used in the program. # Backgrounds. image bg carillon = ""carillon.jpg"" image bg whitehouse = ""whitehouse.jpg"" image bg washington = ""washington.jpg"" image bg onememorial = ""1memorial.jpg"" image black = Solid((0, 0, 0, 255)) # Character pictures. image eileen happy = ""9a_happy.png"" image eileen vhappy = ""9a_vhappy.png"" image eileen concerned = ""9a_concerned.png"" # A character object. This object lets us have the character say # dialogue without us having to repeatedly type her name. It also # lets us change the color of her name. $ e = Character('Eileen', color=(200, 255, 200, 255)) # The start label marks the place where the main menu jumps to to # begin the actual game. label start: # The save_name variable sets the name of the save game. Like all # variables declared outside of init blocks, this variable is # saved and restored with a save file. $ save_name = ""Introduction"" # This variable is only used by our game. If it's true, it means # that we won the date. $ date = False # Clear the game runtime timer, so it doesn't reflect time spent # sitting at the main menu. $ renpy.clear_game_runtime() # Start some m" # true true false https://en.wikipedia.org/wiki/Ren'Py 0 0 Ren'Py https://github.com/williamd1k0/language-renpy.git Ren'Py dax DAX 2009 21 queryLanguage https://docs.microsoft.com/en-us/dax/dax-overview 0 728 1 23220 true 0 queryLanguage false Data analysis expressions msdax 2009 excel-app 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. 2012 76 14 30 37774833 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. 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. Microsoft 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. 401 0 44 msdax EVALUATE ( FILTER ( 'DimProduct', [SafetyStockLevel] < 200 ) ) ORDER BY [EnglishProductName] ASC VAR RETURN NOT EVALUATE DATATABLE ORDER BY START AT DEFINE MEASURE ASC DESC IN BOOLEAN DOUBLE INTEGER DATETIME CURRENCY STRING // /* */ true true true true https://en.wikipedia.org/wiki/Data_analysis_expressions 3 0 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 vega Vega 2013 Jeffrey Heer 12 dataVis library https://vega.github.io/vega/ 0 v5.29.0 729 0 10 23217 true 0 https://github.com/vega/vega dataVis 2013 2024 287 1488 11005 459 false 2013 2025 6774 177 1892 101 2133644 Vega is a visualization grammar, a declarative language for creating, saving, and sharing interactive visualization designs. With Vega, you can describe the visual appearance and interactive behavior of a visualization in a JSON format, and generate web-based views using Canvas or SVG. Vega is a visualization grammar, a declarative language for creating, saving, and sharing interactive visualization designs. With Vega, you can describe the visual appearance and interactive behavior of a visualization in a JSON format, and generate web-based views using Canvas or SVG. Vega is a visualization grammar, a declarative language for creating, saving, and sharing interactive visualization designs. With Vega, you can describe the visual appearance and interactive behavior of a visualization in a JSON format, and generate web-based views using Canvas or SVG. javascript json markdown typescript svg csv html yaml css bourne-shell svg true 15648 0 23 1 false 5 true https://github.com/vega/vega 0 0 autolisp AutoLISP 1986 David Betz 20 pl lisp cad 3d 0 730 2 23217 1842 true 0 pl false a/AutoLISP.lsp 1986 autocad-app vba lisp interlisp lisp-machine-lisp scheme common-lisp t emacs-lisp islisp openlisp picolisp eulisp newlisp racket clojure arc lfe 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. 2001 82 74 232 51458 AutoLISP is based on the LISP programming language, which is simple to learn and powerful for automating design tasks. No specialized programming tool or editor is required to create or modify AutoLISP programs. AutoLISP is based on the LISP programming language, which is simple to learn and powerful for automating design tasks. No specialized programming tool or editor is required to create or modify AutoLISP programs. Autodesk && Basis Software AutoLISP is based on the LISP programming language, which is simple to learn and powerful for automating design tasks. No specialized programming tool or editor is required to create or modify AutoLISP programs. lsp 430 0 23 lisp 1 text http://www.rosettacode.org/wiki/Category:AutoLISP United States "(alert ""Hello World"") " "1 (defun c:pointlabel ( / pnt ) 2 (if (setq pnt (getpoint ""\nSpecify point: "")) 3 (progn 4 (entmake 5 (list 6 '(0 . ""POINT"") 7 (cons 10 (trans pnt 1 0)) 8 ) 9 ) 10 (entmake 11 (list 12 '(0 . ""TEXT"") 13 (cons 10 (trans (cons (+ (car pnt) 0.6) (cdr pnt)) 1 0)) 14 (cons 40 (getvar 'textsize)) 15 (cons 1 (strcat ""X:"" (rtos (car pnt)) "" Y:"" (rtos (cadr pnt)))) 16 ) 17 ) 18 ) 19 ) 20 (princ) 21 )" AutoLISP """" true https://en.wikipedia.org/wiki/AutoLISP 20 1 https://hopl.info/showlanguage.prx?exp=1842 AutoLISP 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 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 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 graph-it GraphIt 2017 18 pl http://graphit-lang.org/ 0 0.1.2 731 1 8 23216 true 0 https://github.com/GraphIt-DSL/graphit pl 2017 2024 2017 21 44 366 6 false 2017 2021 1560 49 914 10 136135 2018 GraphIt is a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with different sizes and structures. GraphIt separates what is computed (algorithm) from how it is computed (schedule). Programmers specify the algorithm using an algorithm language, and performance optimizations are specified using a separate scheduling language. The scheduling language enables programmers to easily search through this complicated tradeoff space by composing together a large set of edge traversal and vertex data layout optimizations. GraphIt is a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with different sizes and structures. GraphIt separates what is computed (algorithm) from how it is computed (schedule). Programmers specify the algorithm using an algorithm language, and performance optimizations are specified using a separate scheduling language. The scheduling language enables programmers to easily search through this complicated tradeoff space by composing together a large set of edge traversal and vertex data layout optimizations. https://github.com/GraphIt-DSL GraphIt is a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with different sizes and structures. GraphIt separates what is computed (algorithm) from how it is computed (schedule). Programmers specify the algorithm using an algorithm language, and performance optimizations are specified using a separate scheduling language. The scheduling language enables programmers to easily search through this complicated tradeoff space by composing together a large set of edge traversal and vertex data layout optimizations. gt cpp python markdown lisp make cmake yaml csv true 549 0 27 false 0 true text United States "element Vertex end element Edge end const edges : edgeset{Edge}(Vertex,Vertex) = load (argv[1]); const vertices : vertexset{Vertex} = edges.getVertices(); const old_rank : vector{Vertex}(double) = 1.0/vertices.size(); const new_rank : vector{Vertex}(double) = 0.0; const out_degree : vector {Vertex}(int) = edges.getOutDegrees(); const contrib : vector{Vertex}(double) = 0.0; const error : vector{Vertex}(double) = 0.0; const damp : double = 0.85; const beta_score : double = (1.0 - damp) / vertices.size(); func computeContrib(v : Vertex) contrib[v] = old_rank[v] / out_degree[v]; end func updateEdge(src : Vertex, dst : Vertex) new_rank[dst] += contrib[src]; end func updateVertex(v : Vertex) var old_score : double = old_rank[v]; new_rank[v] = beta_score + damp*(new_rank[v]); error[v] = fabs(new_rank[v] - old_rank[v]); old_rank[v] = new_rank[v]; new_rank[v] = 0.0; end func printRank(v : Vertex) print old_rank[v]; end func reset(v: Vertex) old_rank[v] = 1.0/vertices.size(); new_rank[v] = 0.0; end func main() for trail in 0:10 startTimer(); vertices.apply(reset); for i in 0:20 vertices.apply(computeContrib); #s1# edges.apply(updateEdge); vertices.apply(updateVertex); end var elapsed_time : double = stopTimer(); print ""elapsed time: ""; print elapsed_time; end end % specify schedules here or use a separate schedule file" https://github.com/GraphIt-DSL/graphit 0 0 graphit-lang.org id|title|url|time|timestamp|by|comments|score\n18499287|GraphIt: A High-Performance Domain-Specific Language for Graph Analytics|http://graphit-lang.org/|2018-11-21 00:50:23 UTC|1542761423|ArtWomb|2|34 maskjs Mask 2012 24 template http://www.atmajs.com/ 0 0.72.47 732 1 8 23216 true 0 https://github.com/atmajs/maskjs template 576 595 306 0 mask source.mask markup 2012 2024 2012 10 6 92 5 false 60 2014 2018 1 2 javascript.py 2012 2023 1714 9 537 24 144383 2013 https://github.com/atmajs mask mask typescript javascript json html markdown yaml css ini true 321 0 35 false 0 true text Germany " // HTML Elements header { img .logo src='/images/~[currentLogo].png' alt=logo; h4 > 'Bar View' if (currentUser) { .account > a href='/acount' > 'Hello, ~[currentUser.username]' } } .view { ul { // Iteration for ((user, index) of users) { li.user data-id='~[user.id]' { // interpolation .name > '~[ user.username ]' // expression .count > '~[: user.level.toFixed(2) ]' // util /* Localization sample * lastActivity: ""Am {0:dd. MM} war der letzte Eintrag"" */ .date > '~[ L: ""lastActivity"", user.date]' } } } // Component :countdownComponent { input type = text > :dualbind value='number'; button x-signal='click: countdownStart' > 'Start'; h5 { '~[bind: number]' :animation x-slot='countdownStart' { @model > 'transition | scale(0) > scale(1) | 500ms' @next > 'background-color | red > blue | 2s linear' } } } } footer > :bazCompo { 'Component generated at ~[: $u.format($c.date, ""HH-mm"") ]' }" Mask https://github.com/atmajs/maskjs // /* */ true true true false 0 0 atmajs.com Mask https://github.com/tenbits/sublime-mask Mask wiredtiger WiredTiger 2010 Keith Bostic and Michael Cahill 13 library database http://source.wiredtiger.com/ 0 733 0 26 23215 true 0 https://github.com/wiredtiger/wiredtiger library 2011 2025 104 392 2245 35 false 2008 2024 29716 141 2470 163 564019 WiredTiger database engine WiredTiger database engine WiredTiger database engine python c cpp cmake bourne-shell bash markdown restructuredtext yaml tcl json html make css toml svg jupyter-notebook javascript perl starlark xml assembly-language powershell dockerfile ini diff true 3584 0 41 mongodb 2 false United States https://github.com/wiredtiger/wiredtiger https://en.wikipedia.org/wiki/WiredTiger 0 0 mps MPS 2010 18 grammarLanguage https://www.jetbrains.com/mps/ 1 734 0 15 23215 true 1 datev https://github.com/JetBrains/MPS grammarLanguage false Meta programming System 2004 2025 95541 123 46129 8649 2018 java 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. 2009 39 23 108 22726517 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. 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. JetBrains 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. java xml mumps svg kotlin markdown diff json bourne-shell html groovy xsd xslt python css true 340 0 33 true text https://github.com/antlr/grammars-v4/tree/master/mps Czech Republic https://twitter.com/jetbrains_mps https://github.com/JetBrains/MPS https://en.wikipedia.org/wiki/JetBrains_MPS 1 0 year|publisher|title|authors|isbn13\n2014|CreateSpace Independent Publishing Platform|The MPS Language Workbench, Vol. 1|Campagne, Fabien|9781497378650 clarion Clarion 1986 18 pl http://www.softvelocity.com 0 735 3 23215 1903 true 0 pl 252 278 223 0 text source.clarion programming false 67 2011 2018 4 3 2000 1989 sql ascii csv foxpro dbase xml html pdf turbo-pascal 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. 2004 65 40 540 508614 Jensen & Partners International && Clarion International && SoftVelocity clw 546 0 20 text http://www.rosettacode.org/wiki/Category:Clarion United States !Hello World in Clarion PROGRAM MAP END CODE MESSAGE('Hello World!') RETURN PROGRAM MAP END CODE MESSAGE('Hello World!') RETURN PROGRAM MAP END CODE MESSAGE('Hello World!','Clarion') RETURN https://en.wikipedia.org/wiki/Clarion_(programming_language) 2 0 https://hopl.info/showlanguage.prx?exp=1903 Clarion softvelocity.com Clarion https://github.com/fushnisoft/SublimeClarion 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 Clarion hodor Hodor 2015 Drew Morris 20 esolang http://www.hodor-lang.org/ 0 1.0.2 736 2 3 23214 true 0 https://github.com/hummingbirdtech/hodor esolang 2015 2024 2015 14 31 327 3 false h/Hodor.hd 2015 2017 25 4 10 1 335 2021 "Using jumbled permutations of the word ""hodor"" over and over again we have simplified programming syntax to make it easier than ever before." "Using jumbled permutations of the word ""hodor"" over and over again we have simplified programming syntax to make it easier than ever before." https://github.com/hummingbirdtech "Using jumbled permutations of the word ""hodor"" over and over again we have simplified programming syntax to make it easier than ever before." hd javascript markdown json true 426 0 24 1 false 1 true https://tio.run/#hodor United States $HODOR: hhodor? Hodor!? Hodor!? oHooodorrhodor orHodor!? d = HoDoRHoDoR () { hodor.hod('Hhodor? Hodor!? Hodor!? o HODOR!? orHodor!? d!'); }; hhodor? Hodor!? Hodor!? oHooodorrhodor orHodor!? d(); hodor.hod('Hhodor? Hodor!? Hodor!? o, Hooodorrhodor orHodor!? d!'); Hodor https://github.com/hummingbirdtech/hodor hodor.hod true 0 0 hodor-lang.org apache-velocity Velocity 2003 19 template http://velocity.apache.org/ 0 737 2 23212 true 0 template false Velocity templates.py 2003 java html sql postscript xml java-server-pages thymeleaf 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. 2005 82 209 133 2285690 Apache Software Foundation vm fhtml true 481 0 20 text https://github.com/antlr/grammars-v4/tree/master/velocity velocity Velocity Hello Velocity World! """" true https://en.wikipedia.org/wiki/Apache_Velocity 2 2 velocity.apache.org 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 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 muon muon 2019 16 pl 0 v0.3.8 738 1 4 23209 true 0 https://github.com/nickmqb/muon pl 2019 2024 2019 28 26 772 9 false m/Muon.mu 2019 2024 127 3 113 1 47873 https://github.com/nickmqb/muon/issues mu csharp markdown c xml true 854 0 22 false 0 true Unknown "printf(fmt cstring) int #Foreign(""printf"") #VarArgs main() { printf(""Hello World"") } " Muon https://github.com/nickmqb/muon printf """" true true 0 0 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 mql MQL5 2005 19 pl 0 739 1 23209 true 0 pl 34 38 1273 0 c_cpp source.mql5 programming false 4 2016 2016 3 1 c_like.py 2005 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. 2014 52 8 60 44398671 MetaQuotes Software mq5 mqh mq4 mq5 mqh 480 0 20 text Russia https://www.wikidata.org/wiki/Q11765028 "//+------------------------------------------------------------------+ //| script-sample.mq5 | //| Copyright 2016, Andrey Osorgin | //+------------------------------------------------------------------+ //| The MIT License (MIT) | //| | //| Permission is hereby granted, free of charge, to any person | //| obtaining a copy of this software and associated documentation | //| files (the ""Software""), to deal in the Software without | //| restriction, including without limitation the rights to use, | //| copy, modify, merge, publish, distribute, sublicense, and/or sell| //| copies of the Software, and to permit persons to whom the | //| Software is furnished to do so, subject to the following | //| conditions: | //| | //| The above copyright notice and this permission notice shall be | //| included in all copies or substantial portions of the Software. | //| | //| THE SOFTWARE IS PROVIDED ""AS IS"", WITHOUT WARRANTY OF ANY KIND, | //| EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES | //| OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND | //| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT | //| HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, | //| WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING | //| FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR | //| OTHER DEALINGS IN THE SOFTWARE. | //| | //| A copy of the MIT License (MIT) is available at | //| https://opensource.org/licenses/MIT | //+------------------------------------------------------------------+ #property version ""1.00"" #property script_show_inputs #include input int StopLoss=100; // Stop Loss input int TakeProfit=100; // Take Profit //+------------------------------------------------------------------+ //| Script program start function | //+------------------------------------------------------------------+ void OnStart() { CTrade trade; //--- long stoplevel=SymbolInfoInteger(Symbol(),SYMBOL_TRADE_STOPS_LEVEL); Print(""Minimum stop level is: "",stoplevel); double ask=SymbolInfoDouble(Symbol(),SYMBOL_ASK); double bid=SymbolInfoDouble(Symbol(),SYMBOL_BID); double sl = NormalizeDouble(bid - StopLoss*Point(),Digits()); double tp = NormalizeDouble(ask + TakeProfit*Point(),Digits()); //--- bool result=trade.Buy(0.01,Symbol(),ask,sl,tp,""test""); //--- Print(""Success? "",result); } //+------------------------------------------------------------------+ " MQL // true true false https://de.wikipedia.org/wiki/MetaQuotes_Language_MQL4/MQL5 6 0 MQL4 https://github.com/mqsoft/MQL5-sublime MQL4 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 rhombus Rhombus 2023 Matthew Flatt 17 pl https://rhombus-lang.org/ 0 740 1 1 23208 true 0 https://github.com/racket/rhombus pl 2019 2025 51 68 391 45 false 2019 2025 1967 46 1270 10 198788 Rhombus is a general-purpose programming language that is easy to use and uniquely customizable. Rhombus is a general-purpose programming language that is easy to use and uniquely customizable. https://dl.acm.org/doi/10.1145/3622818 University of Utah Rhombus is a general-purpose programming language that is easy to use and uniquely customizable. racket true 643 0 18 1 false https://docs.racket-lang.org/rhombus/index.html // simple syntax for everyday tasks class Rect(left, top, right, bottom) fun area(r): let w = r.right - r.left let h = r.bottom - r.top w*h area(Rect(0, 0, 10, 5)) // ⇒ 50 https://github.com/racket/rhombus true true true 0 0 cairo Cairo 2022 13 pl contractLanguage https://www.cairo-lang.org 0 741 1 8 23207 true 0 https://github.com/starkware-libs/cairo pl 2022 2025 19 541 1658 105 false 2022 2025 6535 183 1492 117 593722 https://www.cairo-lang.org/cairovm/ The Rust-inspired language that makes it easy to build scalable dApps with the power of validity proofs. Cairo lets you write provable programs without requiring a deep understanding of the underlying ZK concepts. From onchain gaming to provable ML, Cairo makes building trustless applications possible. Cairo is also the smart-contract language of Starknet, an L2 blockchain that is verified over Ethereum. The Rust-inspired language that makes it easy to build scalable dApps with the power of validity proofs. Cairo lets you write provable programs without requiring a deep understanding of the underlying ZK concepts. From onchain gaming to provable ML, Cairo makes building trustless applications possible. Cairo is also the smart-contract language of Starknet, an L2 blockchain that is verified over Ethereum. The Rust-inspired language that makes it easy to build scalable dApps with the power of validity proofs. Cairo lets you write provable programs without requiring a deep understanding of the underlying ZK concepts. From onchain gaming to provable ML, Cairo makes building trustless applications possible. Cairo is also the smart-contract language of Starknet, an L2 blockchain that is verified over Ethereum. rust asciidoc toml json markdown bourne-shell yaml html true 3466 0 22 rust false use core::felt252; fn main() -> felt252 { let n = 2 + 3; n } https://twitter.com/CairoLang https://github.com/starkware-libs/cairo 0 0 simit Simit 2014 Fredrik Kjolstad 17 pl http://simit-lang.org 0 742 1 10 23204 true 0 https://github.com/simit-lang/simit pl 2016 2024 45 52 452 50 false 2014 2019 2679 29 504 9 200692 2016 Simit is an imperative language with statements, control flow and linear algebra expressions. Simit is an imperative language with statements, control flow and linear algebra expressions. MIT Simit is an imperative language with statements, control flow and linear algebra expressions. cpp cmake markdown vim-script c lisp python make bourne-shell llvmir true 639 0 28 matlab 1 false https://simit-lang.org/language United States func minMax(a : float, b : float) -> (c : float, d : float) if a < b c = a; d = b; else c = b; d = a; end end https://github.com/simit-lang/simit 0 0 simit-lang.org 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 kitlang kitlang 2018 Ben Morris 15 pl https://www.kitlang.org/ 0 743 0 10 23202 true 0 https://github.com/kitlang/kit pl 2018 2024 2018 43 29 1016 19 false 2018 2019 488 13 382 2 26048 A magical, high performance programming language for game development. A magical, high performance programming language for game development. https://github.com/kitlang A magical, high performance programming language for game development. haskell markdown json bourne-shell yaml svg yacc xml logos vim-script true 1118 0 25 1 false https://tio.run/#https://www.kitlang.org/playground.html United States https://twitter.com/kitlanguage https://github.com/kitlang/kit 0 0 kitlang.org open-shading-language Open Shading Language 2008 13 shadingLanguage 3d http://openshadinglanguage.com 0 4.7.2 744 0 18 23200 false 0 https://github.com/imageworks/openshadinglanguage shadingLanguage 2011 2024 2008 198 349 2052 47 false 2008 2025 4346 95 3249 223 670877 2012 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. 24 15 43647388 Sony python cpp xml markdown cmake bash cuda yaml tex yacc html lex make d css glsl restructuredtext javascript true 3336 0 31 false 4 true Canada https://github.com/imageworks/openshadinglanguage https://en.wikipedia.org/wiki/Open_Shading_Language 0 0 openshadinglanguage.com gridstudio-editor gridstudio-editor 2018 Rick Lamers 12 editor https://gridstudio.io 0 745 0 13 23196 false 0 https://github.com/ricklamers/gridstudio editor 2019 2024 2018 323 1500 8874 43 false 2018 2023 206 15 352 128 25067 https://github.com/ricklamers/gridstudio/issues svg javascript json typescript go html css bourne-shell python less markdown yaml dockerfile true 13391 0 25 1 false The Netherlands https://github.com/ricklamers/gridstudio 0 0 gridstudio.io falcon Falcon 2003 Giancarlo Niccolai 24 pl http://falconpl.org 0 746 3 23196 7122 true 0 pl false f/Falcon.fal 2005 2003 perl lua smalltalk php lisp python ruby unicode xml postgresql sqlite json regex linux solaris 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. 2009 57 66 21628757 https://github.com/falconpl ftd fal fam fal ftd fal fam 306 0 29 1 text http://www.rosettacode.org/wiki/Category:Falcon Italy "// Hello World in Falcon > ""Hello World!""" "#!/usr/bin/env falcon > ""Hello World"" " "directive lang=fr_FR // uses 5 characters ISO language code > i""Bonjour à tout le monde!""" Falcon // """" true true false true https://en.wikipedia.org/wiki/Falcon_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=7122 Falcon falconpl.org rakudo Rakudo 2006 Patrick Michaud 13 pl compiler https://rakudo.org 0 https://rakudo.org/downloads 2024.04 747 0 14 23192 true 0 https://github.com/rakudo/rakudo pl 2009 2024 115 372 1719 1394 false 2006 2025 43497 446 1013 82 514492 raku markdown c perl java powershell bourne-shell javascript json yaml cpp csv svg html true 3283 0 28 raku 1 false 2024 false https://docs.raku.org/ https://github.com/rakudo/rakudo 0 0 nasm Netwide Assembler 1996 17 assembly http://www.nasm.us 0 748 1 23192 true 0 assembly false asm.py 2007 2017 x86-assembly assembly-language x86-isa ia-32 linux coff elf powerpc sparc 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. 2002 117 77 297 60647 https://github.com/netwide-assembler asm ASM true 606 0 18 text https://github.com/antlr/grammars-v4/tree/master/asm/nasm United States and Russia NASM "global _start section .data query_string: db ""Enter a character: "" query_string_len: equ $ - query_string out_string: db ""You have input: "" out_string_len: equ $ - out_string section .bss in_char: resw 4 section .text _start: mov rax, 0x2000004 ; put the write-system-call-code into register rax mov rdi, 1 ; tell kernel to use stdout mov rsi, query_string ; rsi is where the kernel expects to find the address of the message mov rdx, query_string_len ; and rdx is where the kernel expects to find the length of the message syscall ; read in the character mov rax, 0x2000003 ; read system call mov rdi, 0 ; stdin mov rsi, in_char ; address for storage, declared in section .bss mov rdx, 2 ; get 2 bytes from the kernel's buffer (one for the carriage return) syscall ; show user the output mov rax, 0x2000004 ; write system call mov rdi, 1 ; stdout mov rsi, out_string mov rdx, out_string_len syscall mov rax, 0x2000004 ; write system call mov rdi, 1 ; stdout mov rsi, in_char mov rdx, 2 ; the second byte is to apply the carriage return expected in the string syscall ; exit system call mov rax, 0x2000001 ; exit system call xor rdi, rdi syscall" ; true true false https://en.wikipedia.org/wiki/Netwide_Assembler 0 0 nasm.us ggplot2 ggplot2 2007 Hadley Wickham and Winston Chang 12 library https://ggplot2.tidyverse.org 0 749 0 5 23191 true 0 https://github.com/tidyverse/ggplot2 library 2008 2024 304 2000 6407 202 false 2007 2025 6757 386 1098 1198 242128 ggplot2 is an open-source data visualization package for the statistical programming language R. ggplot2 is an open-source data visualization package for the statistical programming language R. ggplot2 is an open-source data visualization package for the statistical programming language R. r svg markdown csv yaml https://github.com/rstudio/cheatsheets/blob/main/data-visualization.pdf true 12815 0 18 2 false https://github.com/tidyverse/ggplot2 https://en.wikipedia.org/wiki/Ggplot2 0 0 masm MASM 1981 Thomas Jaeger 14 pl http://www.visualmasm.com 0 750 0 7 23188 2212 true 0 https://github.com/ThomasJaeger/VisualMASM pl 2017 2024 2017 71 87 1327 18 false 2017 2018 169 2 611 1776 1453702 https://github.com/ThomasJaeger/VisualMASM/issues pascal json assembly-language xml html css markdown true 1592 0 21 1 false https://github.com/antlr/grammars-v4/tree/master/asm/masm United States http://www.visualmasm.com/ https://github.com/ThomasJaeger/VisualMASM 0 0 https://hopl.info/showlanguage.prx?exp=2212 jsharp J# 2002 16 pl http://msdn2.microsoft.com/en-us/vjsharp/default.aspx 0 751 1 23187 3718 true 0 pl false j/J#.jsl 2002 j java java-bytecode "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." 2004 154 180 288 419765 Microsoft jsl 791 0 18 text United States "package HelloWorld; public class HelloWorld { public static void main(String[] args) { System.Console.Write(""Hello World""); } } " J# System.Console.Write """" true true https://en.wikipedia.org/wiki/J_Sharp 0 0 https://hopl.info/showlanguage.prx?exp=3718 J# curry Curry 1990 Michael Hanus and Sergio Antoy 25 pl https://www.curry-lang.org/ 0 752 3 23186 true 0 pl 1 1 4 haskell source.curry programming false c/Curry.curry https://smap.curry-lang.org/smap.cgi?upload?lang=Curry&program=%2D%2D+Returns+the+last+number+of+a+list%2E%0Alast+%3A%3A+%5BInt%5D+%2D%3E+Int%0Alast+%28%5F+%2B%2B+%5Bx%5D%29+%3D+x%0A%0A%2D%2D+Returns+some+permutation+of+a+list%2E%0Aperm+%3A%3A+%5Ba%5D+%2D%3E+%5Ba%5D%0Aperm+%5B%5D+++++%3D+%5B%5D%0Aperm+%28x%3Axs%29+%3D+insert+%28perm+xs%29%0A+where+insert+ys+++++%3D+x+%3A+ys%0A+++++++insert+%28y%3Ays%29+%3D+y+%3A+insert+ys%0A+++++++%0Amain+%3D+perm+%22XYZ%22 1990 c haskell prolog 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. 2003 51 53 126 302187 Curry is a declarative multi-paradigm programming language which combines in a seamless way features from functional programming (nested expressions, higher-order functions, strong typing, lazy evaluation) and logic programming (non-determinism, built-in search, free variables, partial data structures). Compared to the single programming paradigms, Curry provides additional features, like optimal evaluation for logic-oriented computations and flexible, non-deterministic pattern matching with user-defined functions. Curry is a declarative multi-paradigm programming language which combines in a seamless way features from functional programming (nested expressions, higher-order functions, strong typing, lazy evaluation) and logic programming (non-determinism, built-in search, free variables, partial data structures). Compared to the single programming paradigms, Curry provides additional features, like optimal evaluation for logic-oriented computations and flexible, non-deterministic pattern matching with user-defined functions. University of Kiel Curry is a declarative multi-paradigm programming language which combines in a seamless way features from functional programming (nested expressions, higher-order functions, strong typing, lazy evaluation) and logic programming (non-determinism, built-in search, free variables, partial data structures). Compared to the single programming paradigms, Curry provides additional features, like optimal evaluation for logic-oriented computations and flexible, non-deterministic pattern matching with user-defined functions. curry curry 276 0 29 haskell haskell 2 false https://www.curry-lang.org/various/mailinglist/ text http://www.rosettacode.org/wiki/Category:Curry Germany "-- ""Hello World"" demo for the Tcl/Tk library import Tk main = runWidget ""Hello"" (TkCol [] [TkLabel [TkText ""Hello World""], TkButton tkExit [TkText ""Stop""]]) " https://riju.codes/curry "main :: IO () main = putStrLn ""Hello, world!"" " insert x ys = x : ys insert x (y:ys) = y : insert x ys Curry """" true true https://en.wikipedia.org/wiki/Curry_(programming_language) 1 0 Curry 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 Curry gerbil Gerbil Scheme 2016 14 pl lisp https://cons.io/ 0 753 0 17 23184 true 0 https://github.com/vyzo/gerbil pl 2016 2024 2016 34 112 1139 118 false 2016 2025 5070 96 1420 75 526353 https://github.com/vyzo/gerbil/issues scheme markdown bash bourne-shell svg yaml lisp make json c protobuf tex javascript ruby dockerfile stylus html true 1573 0 32 false Unknown https://github.com/vyzo/gerbil ; true true true 0 0 chibicc chibicc 2019 Rui Ueyama 12 compiler 0 754 0 4 23182 true 0 https://github.com/rui314/chibicc compiler 2019 2024 2019 174 842 9226 96 false 2019 2020 826 1 75 1 12771 A Small C Compiler. A Small C Compiler. https://github.com/rui314 A Small C Compiler. c bourne-shell markdown make true 11754 0 17 c 1 false Singapore https://github.com/rui314/chibicc 0 0 grep grep 1973 Ken Thompson 13 pl 0 755 1 23181 2295 true 0 pl false 1974 unix regex perl grep is a command-line utility for searching plain-text data sets for lines that match a regular expression. Its name comes from the ed command g/re/p (globally search a regular expression and print), which has the same effect: doing a global search with the regular expression and printing all matching lines. Grep was originally developed for the Unix operating system, but later available for all Unix-like systems. 2002 619 559 46642 Bell Labs https://cheatsheets.zip/grep true 3115 0 13 1 https://www.gnu.org/software/grep/manual/grep.html https://man7.org/linux/man-pages/man1/grep.1.html United States $ grep root /etc/passwd root:x:0:0:root:/root:/bin/bash operator:x:11:0:operator:/root:/sbin/nologin $ grep -n root /etc/passwd 1:root:x:0:0:root:/root:/bin/bash 12:operator:x:11:0:operator:/root:/sbin/nologin $ grep -c false /etc/passwd 7 https://en.wikipedia.org/wiki/Grep 0 0 https://hopl.info/showlanguage.prx?exp=2295 aframe A-Frame 2015 Diego Marcos and Don McCurdy and Kevin Ngo 18 framework 3d library https://aframe.io 0 https://aframe.io/blog 1.7.0 756 1 7 23181 false 0 https://github.com/aframevr/aframe framework false 2015 2025 7631 489 674 883 240686 A-Frame is an open-source web framework for building virtual reality (VR) experiences. It is built on top of HTML, making it simple to create 3D scenes and VR applications that run in a web browser. A-Frame is based on the Entity-Component-System (ECS) pattern and integrates with WebVR/WebXR for immersive experiences. A-Frame is an open-source web framework for building virtual reality (VR) experiences. It is built on top of HTML, making it simple to create 3D scenes and VR applications that run in a web browser. A-Frame is based on the Entity-Component-System (ECS) pattern and integrates with WebVR/WebXR for immersive experiences. Mozilla A-Frame is an open-source web framework for building virtual reality (VR) experiences. It is built on top of HTML, making it simple to create 3D scenes and VR applications that run in a web browser. A-Frame is based on the Entity-Component-System (ECS) pattern and integrates with WebVR/WebXR for immersive experiences. javascript markdown html json yaml svg css true 511 0 27 3 false 1 true https://aframe.io/docs/ United States " " https://github.com/aframevr/aframe https://en.wikipedia.org/wiki/A-Frame_(software) 0 0 occam Occam 1983 David May 23 pl 0 757 3 23181 1002 true 0 pl false o/occam.occam 1983 ocaml ease go csp pascal haskell python 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. 2001 61 63 213 22660 Inmos International plc occam 325 0 25 1 https://mahi.ucsd.edu/Steve/Occam/documentation.html text http://www.rosettacode.org/wiki/Category:Occam United Kingdom "PROGRAM Hello -- Hello world in Occam #USE ioconv SEQ write.full.string(screen,""Hello World!"") " "PROGRAM Hello #USE ioconv SEQ write.full.string(screen,""Hello World"") " ALT count1 < 100 & c1 ? data SEQ count1 := count1 + 1 merged ! data count2 < 100 & c2 ? data SEQ count2 := count2 + 1 merged ! data status ? request SEQ out ! count1 out ! count2 occam write.full.string """" true true true https://en.wikipedia.org/wiki/Occam_(programming_language) 17 24 https://hopl.info/showlanguage.prx?exp=1002 Occam 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 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 title|year|author|goodreadsId|rating|ratings|reviews\nProgramming In Occam||Geraint Jones|3878947|3.00|3|1 powerpc PowerPC 1992 12 isa 0 758 0 23176 true 0 isa false 1992 powerisa solaris unix linux x86-isa freebsd 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. 2001 646 1637 1385 24281 Apple && IBM && Motorola 9126 59 14 https://developer.ibm.com/articles/l-ppc/ na https://en.wikipedia.org/wiki/PowerPC 10 2 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 powerpc 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 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 vigil Vigil 2013 Bob Nystrom 13 esolang 0 759 1 2 23176 true 0 https://github.com/munificent/vigil esolang 2013 2024 2013 75 60 2861 23 false 2013 2022 15 7 6 1 255 python markdown true 3049 0 16 1 false def fib(n): if n < 2: result = n else: result = fib(n - 1) + fib(n - 2) # fib() never returns negative number. swear result >= 0 return result https://github.com/munificent/vigil # true true false 0 0 c-shell C shell 1978 23 pl http://mx.gw.com 13 760 2 23173 true 13 eiffel fardlang git iterm2 java ncl noweb opam-pm pygments python racket smpl sugar pl false c/C Shell.csh 1978 c linux bourne-shell algol-68 unicode grep bash "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." 2002 19 173 3 95833 University of California Berkeley true 116 0 28 csh tcsh text United States "#!/bin/csh echo ""Hello World"" " # Always creates an empty file if ( ! -e myfile ) echo mytext > myfile C Shell # echo """" true true true true false true https://en.wikipedia.org/wiki/C_Shell 0 0 C shell mx.gw.com wavefront-object Wavefront OBJ format 1988 13 textDataFormat 3d 0 761 2 23171 true 0 textDataFormat 331144 0 text source.wavefront.obj data false 45 2016 2017 5 1 OBJ 2004 ascii OBJ (or .OBJ) is a geometry definition file format first developed by Wavefront Technologies for its Advanced Visualizer animation package. The file format is open and has been adopted by other 3D graphics application vendors. The OBJ file format is a simple data-format that represents 3D geometry alone — namely, the position of each vertex, the UV position of each texture coordinate vertex, vertex normals, and the faces that make each polygon defined as a list of vertices, and texture vertices. Vertices are stored in a counter-clockwise order by default, making explicit declaration of face normals unnecessary. OBJ coordinates have no units, but OBJ files can contain scale information in a human readable comment line. 2005 552 177 386 1710972 "The Wavefront OBJ format is a format for defining the 3D geometry for the surface of one or more objects. The format was first used by Wavefront Technologies around 1990 and a specification was published to encourage interoperability. The introduction to the specification stated, ""Object files define the geometry and other properties for objects in Wavefront’s Advanced Visualizer. Object files can also be used to transfer geometric data back and forth between the Advanced Visualizer and other applications."" Since the mid 1990s, the ASCII-based format has been treated as a vendor-neutral format, referred to as 'Wavefront OBJ,"" ""Alias/Wavefront OBJ,"" or simply ""OBJ."" In 2020, the format remains widely used, particularly for 3D printing of objects in multiple colors." "The Wavefront OBJ format is a format for defining the 3D geometry for the surface of one or more objects. The format was first used by Wavefront Technologies around 1990 and a specification was published to encourage interoperability. The introduction to the specification stated, ""Object files define the geometry and other properties for objects in Wavefront’s Advanced Visualizer. Object files can also be used to transfer geometric data back and forth between the Advanced Visualizer and other applications."" Since the mid 1990s, the ASCII-based format has been treated as a vendor-neutral format, referred to as 'Wavefront OBJ,"" ""Alias/Wavefront OBJ,"" or simply ""OBJ."" In 2020, the format remains widely used, particularly for 3D printing of objects in multiple colors." "The Wavefront OBJ format is a format for defining the 3D geometry for the surface of one or more objects. The format was first used by Wavefront Technologies around 1990 and a specification was published to encourage interoperability. The introduction to the specification stated, ""Object files define the geometry and other properties for objects in Wavefront’s Advanced Visualizer. Object files can also be used to transfer geometric data back and forth between the Advanced Visualizer and other applications."" Since the mid 1990s, the ASCII-based format has been treated as a vendor-neutral format, referred to as 'Wavefront OBJ,"" ""Alias/Wavefront OBJ,"" or simply ""OBJ."" In 2020, the format remains widely used, particularly for 3D printing of objects in multiple colors." obj 2980 0 13 text https://github.com/antlr/grammars-v4/tree/master/wavefront https://scholar.google.com/scholar?q=Wavefront+file+formats&hl=en&as_sdt=0%2C5&as_ylo=1980&as_yhi=1992 cstype bmatrix deg 3 3 step 3 3 bmat u 1 -3 3 -1 \ 0 3 -6 3 \ 0 0 3 -3 \ 0 0 0 1 bmat v 1 -3 -3 2 \ 2 2 2 3 \ 0 0 0 -2 \ 0 0 0 2 # Special point and space curve data vp 0.500 vp 0.700 vp 1.100 vp 0.200 0.950 v 0.300 1.500 0.100 v 0.000 0.000 0.000 v 1.000 1.000 0.000 v 2.000 1.000 0.000 v 3.000 0.000 0.000 cstype bezier deg 3 curv 0.2 0.9 -4 -3 -2 -1 sp 1 parm u 0.00 1.00 end # Trimming curve vp -0.675 1.850 3.000 vp 0.915 1.930 vp 2.485 0.470 2.000 vp 2.485 -1.030 vp 1.605 -1.890 10.700 vp -0.745 -0.654 0.500 cstype rat bezier curv2 -6 -5 -4 -3 -2 -1 -6 parm u 0.00 1.00 2.00 sp 2 3 end # Surface v -1.350 -1.030 0.000 v 0.130 -1.030 0.432 7.600 v 1.480 -1.030 0.000 2.300 v -1.460 0.060 0.201 v 0.120 0.060 0.915 0.500 v 1.380 0.060 0.454 1.500 v -1.480 1.030 0.000 2.300 v 0.120 1.030 0.394 6.100 v 1.170 1.030 0.000 3.300 cstype rat bspline deg 2 2 surf -1.0 2.5 -2.0 2.0 -9 -8 -7 -6 -5 -4 -3 -2 -1 parm u -1.00 -1.00 -1.00 2.50 2.50 2.50 parm v -2.00 -2.00 -2.00 2.00 2.00 2.00 trim 0.0 2.0 1 2.2 2.2 3 sp 4 con 1 2.0 2.0 1 2 4.0 3.0 1 end "Pr/map_Pr # roughness Pm/map_Pm # metallic Ps/map_Ps # sheen Pc # clearcoat thickness Pcr # clearcoat roughness Ke/map_Ke # emissive aniso # anisotropy anisor # anisotropy rotation norm # normal map, same format as ""bump"" parameter" https://en.wikipedia.org/wiki/Wavefront_.obj_file 0 0 https://github.com/Alhadis/language-wavefront Wavefront Object java-bytecode Java Bytecode 1995 14 bytecode 0 762 1 23171 true 0 bytecode false 1995 jvm java assembly-language c coldfusion jruby jython ruby python groovy scala ada clojure lisp javafx-script kotlin object-pascal free-pascal cil Java bytecode is the instruction set of the Java virtual machine (JVM). 2005 302 175 373 38321273 Oracle 1530 0 15 https://docs.oracle.com/javase/specs/jvms/se7/html/ text United States 0: iconst_2 1: istore_1 2: iload_1 3: sipush 1000 6: if_icmpge 44 9: iconst_2 10: istore_2 11: iload_2 12: iload_1 13: if_icmpge 31 16: iload_1 17: iload_2 18: irem 19: ifne 25 22: goto 38 25: iinc 2, 1 28: goto 11 31: getstatic #84; // Field java/lang/System.out:Ljava/io/PrintStream; 34: iload_1 35: invokevirtual #85; // Method java/io/PrintStream.println:(I)V 38: iinc 1, 1 41: goto 2 44: return // true true false https://en.wikipedia.org/wiki/Java_bytecode 0 0 picolisp PicoLisp 1988 Alexander Burger 23 pl lisp https://picolisp.com/ 0 http://pico-lisp.blogspot.com/ 763 1 23170 true 0 pl 85 99 114 0 picolisp pil lisp source.lisp programming false 40 2005 2018 1 6 2007 1988 lisp linux s-expressions common-lisp emacs-lisp prolog c assembly-language java PicoLisp is an open source Lisp dialect. It runs on Linux and other POSIX-compliant systems. 2009 19 28 124 25055375 https://www.mail-archive.com/picolisp@software-lab.de l l 316 0 24 1 https://tio.run/#picolisp https://picolisp.com/wiki/?Documentation text http://www.rosettacode.org/wiki/Category:PicoLisp Germany "# 11dec13abu # (c) Software Lab. Alexander Burger (de permute (Lst) (ifn (cdr Lst) (cons Lst) (mapcan '((X) (mapcar '((Y) (cons X Y)) (permute (delete X Lst)) ) ) Lst ) ) ) (de subsets (N Lst) (cond ((=0 N) '(NIL)) ((not Lst)) (T (conc (mapcar '((X) (cons (car Lst) X)) (subsets (dec N) (cdr Lst)) ) (subsets N (cdr Lst)) ) ) ) ) (de shuffle (Lst) (by '(NIL (rand)) sort Lst) ) (de samples (Cnt Lst) (make (until (=0 Cnt) (when (>= Cnt (rand 1 (length Lst))) (link (car Lst)) (dec 'Cnt) ) (pop 'Lst) ) ) ) # Genetic Algorithm (de gen (""Pop"" ""Cond"" ""Re"" ""Mu"" ""Se"") (until (""Cond"" ""Pop"") (for (""P"" ""Pop"" ""P"" (cdr ""P"")) (set ""P"" (maxi ""Se"" # Selection (make (for (""P"" ""Pop"" ""P"") (rot ""P"" (rand 1 (length ""P""))) (link # Recombination + Mutation (""Mu"" (""Re"" (pop '""P"") (pop '""P""))) ) ) ) ) ) ) ) (maxi ""Se"" ""Pop"") ) # Alpha-Beta tree search (de game (""Flg"" ""Cnt"" ""Moves"" ""Move"" ""Cost"") (let (""Alpha"" '(1000000) ""Beta"" -1000000) (recur (""Flg"" ""Cnt"" ""Alpha"" ""Beta"") (let? ""Lst"" (""Moves"" ""Flg"") (if (=0 (dec '""Cnt"")) (loop (""Move"" (caar ""Lst"")) (setq ""*Val"" (list (""Cost"" ""Flg"") (car ""Lst""))) (""Move"" (cdar ""Lst"")) (T (>= ""Beta"" (car ""*Val"")) (cons ""Beta"" (car ""Lst"") (cdr ""Alpha"")) ) (when (> (car ""Alpha"") (car ""*Val"")) (setq ""Alpha"" ""*Val"") ) (NIL (setq ""Lst"" (cdr ""Lst"")) ""Alpha"") ) (setq ""Lst"" (sort (mapcar '((""Mov"") (prog2 (""Move"" (car ""Mov"")) (cons (""Cost"" ""Flg"") ""Mov"") (""Move"" (cdr ""Mov"")) ) ) ""Lst"" ) ) ) (loop (""Move"" (cadar ""Lst"")) (setq ""*Val"" (if (recurse (not ""Flg"") ""Cnt"" (cons (- ""Beta"")) (- (car ""Alpha""))) (cons (- (car @)) (cdar ""Lst"") (cdr @)) (list (caar ""Lst"") (cdar ""Lst"")) ) ) (""Move"" (cddar ""Lst"")) (T (>= ""Beta"" (car ""*Val"")) (cons ""Beta"" (cdar ""Lst"") (cdr ""Alpha"")) ) (when (> (car ""Alpha"") (car ""*Val"")) (setq ""Alpha"" ""*Val"") ) (NIL (setq ""Lst"" (cdr ""Lst"")) ""Alpha"") ) ) ) ) ) ) ### Grids ### (de grid (DX DY FX FY) (let Grid (make (for X DX (link (make (for Y DY (set (link (if (> DX 26) (box) (intern (pack (char (+ X 96)) Y)) ) ) (cons (cons) (cons)) ) ) ) ) ) ) (let West (and FX (last Grid)) (for (Lst Grid Lst) (let (Col (pop 'Lst) East (or (car Lst) (and FX (car Grid))) South (and FY (last Col)) ) (for (L Col L) (with (pop 'L) (set (: 0 1) (pop 'West)) # west (con (: 0 1) (pop 'East)) # east (set (: 0 -1) South) # south (con (: 0 -1) # north (or (car L) (and FY (car Col))) ) (setq South This) ) ) (setq West Col) ) ) ) Grid ) ) (de west (This) (: 0 1 1) ) (de east (This) (: 0 1 -1) ) (de south (This) (: 0 -1 1) ) (de north (This) (: 0 -1 -1) ) (de disp (""Grid"" ""How"" ""Fun"" ""X"" ""Y"" ""DX"" ""DY"") (setq ""Grid"" (if ""X"" (mapcar '((L) (flip (head ""DY"" (nth L ""Y"")))) (head ""DX"" (nth ""Grid"" ""X"")) ) (mapcar reverse ""Grid"") ) ) (let (N (+ (length (cdar ""Grid"")) (or ""Y"" 1)) Sp (length N)) (""border"" north) (while (caar ""Grid"") (prin "" "" (align Sp N) "" "" (and ""How"" (if (and (nT ""How"") (west (caar ""Grid""))) "" "" '|)) ) (for L ""Grid"" (prin (""Fun"" (car L)) (and ""How"" (if (and (nT ""How"") (east (car L))) "" "" '|)) ) ) (prinl) (""border"" south) (map pop ""Grid"") (dec 'N) ) (unless (> (default ""X"" 1) 26) (space (inc Sp)) (for @ ""Grid"" (prin "" "" (and ""How"" "" "") (char (+ 96 ""X""))) (T (> (inc '""X"") 26)) ) (prinl) ) ) ) (de ""border"" (Dir) (when ""How"" (space Sp) (prin "" +"") (for L ""Grid"" (prin (if (and (nT ""How"") (Dir (car L))) "" +"" ""---+"")) ) (prinl) ) ) " # true true false https://en.wikipedia.org/wiki/PicoLisp 0 0 picolisp.com PicoLisp https://github.com/textmate/lisp.tmbundle PicoLisp nostr Nostr 2020 Giovanni Torres Parra 12 protocol microblogging https://nostr.com/ 0 764 0 1 23169 true 0 https://github.com/nostr-protocol/nostr protocol 2020 2024 194 313 9793 65 false Notes and Other Stuff Transmitted by Relays 2020 2025 141 24 2 1 45 Nostr is a simple, open protocol that enables global, decentralized, and censorship-resistant social media. Nostr is a simple, open protocol that enables global, decentralized, and censorship-resistant social media. Nostr is a simple, open protocol that enables global, decentralized, and censorship-resistant social media. markdown true 10778 0 13 1 false https://github.com/nostr-protocol/nostr https://en.wikipedia.org/wiki/Nostr 0 0 vimwiki Vimwiki 2008 Maxim Kim 12 wikiMarkup http://vimwiki.github.io/ 0 v2.4.1 765 1 8 23168 true 0 https://github.com/vimwiki/vimwiki wikiMarkup 2012 2024 2008 110 625 8674 193 false 2008 2024 1147 172 115 7 43944 vim-script markdown bourne-shell svg yaml css dockerfile toml true 10723 0 20 1 false 2 true https://riju.codes/vimwiki Hello, world! https://github.com/vimwiki/vimwiki 0 0 vimwiki.github.io pl-m PL/M 1973 17 pl 1 766 1 23168 591 true 1 cloc pl false Programming Language for Microcomputers 1973 algol pl-i xpl c "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 DEC'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)." 2004 68 67 108 543057 Microcomputer Applications Associates 360 0 22 lit plm text United States FIND: PROCEDURE(PA,PB) BYTE; DECLARE (PA,PB) BYTE; /* FIND THE STRING IN SCRATCH STARTING AT PA AND ENDING AT PB */ DECLARE J ADDRESS, (K, MATCH) BYTE; J = BACK ; MATCH = FALSE; DO WHILE NOT MATCH AND (MAXM > J); LAST,J = J + 1; /* START SCAN AT J */ K = PA ; /* ATTEMPT STRING MATCH AT K */ DO WHILE SCRATCH(K) = MEMORY(LAST) AND NOT (MATCH := K = PB); /* MATCHED ONE MORE CHARACTER */ K = K + 1; LAST = LAST + 1; END; END; IF MATCH THEN /* MOVE STORAGE */ DO; LAST = LAST - 1; CALL MOVER; END; RETURN MATCH; END FIND; /* */ := true true true false https://en.wikipedia.org/wiki/PL/M 0 0 https://hopl.info/showlanguage.prx?exp=591 squeak Squeak 1996 17 pl http://www.squeak.org 0 767 1 23168 true 0 pl false 1999 1996 smalltalk newsqueak ios pharo lisp logo simula self etoys scratch linux 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. 2002 111 142 339 37426 Apple && Disney 576 0 19 text United States """Hello world in Squeak"" Transcript show: 'Hello World'" https://twitter.com/squeaksmalltalk ' true https://en.wikipedia.org/wiki/Squeak 3 8 Squeak squeak.org 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 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 mochi mochi 2014 15 pl 0 v0.2.7 768 1 6 23167 true 0 https://github.com/i2y/mochi pl 2014 2024 2014 47 31 914 14 false 2014 2016 402 14 93 1 13262 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. 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. https://github.com/i2y/mochi/issues 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. python markdown restructuredtext make bourne-shell dockerfile true 1022 0 21 false 0 true text Japan def factorial(n, m): if n == 1: m else: factorial(n - 1, n * m) https://github.com/i2y/mochi https://github.com/pya/mochi-kernel 0 0 ox OX 1996 Jurgen A. Doornik 26 pl http://www.oxmetrics.net/ 0 769 2 23167 2718 true 0 pl 12 19 58 0 text source.ox programming false o/OX.oz 20 2015 2015 3 2 2002 2011 linux r Ox is an object-oriented matrix programming language with a mathematical and statistical function library, developed by Jurgen Doornik. It has been designed for econometric programming. It is available for Windows, Mac OS X and Linux platforms. The downloadable console version of Ox is free for academic use. A commercial version is available for non-academic use. According to its documentation, it should be cited whenever results are published.The programming environment for econometric modelling OxMetrics is based on Ox. 2006 6 3 22 7762427 OxMetrics Technologies ox oxh oxo oz false 251 0 29 1 text United Kingdom {Show 'Hello World'} nldge::ParticleLogLikeli() { decl it, ip, mss, mbas, ms, my, mx, vw, vwi, dws, mhi, mhdet, loglikeli, mData, vxm, vxs, mxm=<>, mxsu=<>, mxsl=<>, time, timeall, timeran=0, timelik=0, timefun=0, timeint=0, timeres=0; mData = GetData(m_asY); mhdet = sqrt((2*M_PI)^m_cY * determinant(m_mMSbE.^2)); // covariance determinant mhi = invert(m_mMSbE.^2); // invert covariance of measurement shocks ms = m_vSss + zeros(m_cPar, m_cS); // start particles mx = m_vXss + zeros(m_cPar, m_cX); // steady state of state and policy loglikeli = 0; // init likelihood //timeall=timer(); for(it = 0; it < sizer(mData); it++) { mss = rann(m_cPar, m_cSS) * m_mSSbE; // state noise fg(&ms, ms, mx, mss); // transition prior as proposal mx = m_oApprox.FastInterpolate(ms); // interpolate fy(&my, ms, mx, zeros(m_cPar, m_cMS)); // evaluate importance weights my -= mData[it][]; // observation error vw = exp(-0.5 * outer(my,mhi,'d')' )/mhdet; // vw = exp(-0.5 * sumr(my*mhi .*my ) )/mhdet; vw = vw .== .NaN .? 0 .: vw; // no policy can happen for extrem particles dws = sumc(vw); if(dws==0) return -.Inf; // or extremely wrong parameters loglikeli += log(dws/m_cPar) ; // loglikelihood contribution //timelik += (timer()-time)/100; //time=timer(); vwi = resample(vw/dws)-1; // selection step in c++ ms = ms[vwi][]; // on normalized weights mx = mx[vwi][]; } return loglikeli; } OX // Show ' true true true false true https://en.wikipedia.org/wiki/Ox_(programming_language) 4 0 https://hopl.info/showlanguage.prx?exp=2718 oxmetrics.net Ox https://github.com/andreashetland/sublime-text-ox 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 Ox gettext Gettext Catalog 1990 16 textMarkup 0 770 1 23165 true 0 textMarkup 509 650 62782 0 pot text source.po prose false 22 2007 2014 3 textfmts.py 1995 c emacs-editor unix csharp perl php python scala In computing, gettext is an internationalization and localization (i18n) system commonly used for writing multilingual programs on Unix-like computer operating systems. The most commonly used implementation of gettext is GNU gettext, released by the GNU Project in 1995. 2004 107 66 271 646489 Free Software Foundation po pot pot po true 755 0 16 text United States https://www.gnu.org/software/gettext/ Gettext Catalog "#: src/name.c:36 msgid ""My name is %s.\n"" msgstr ""Je m'appelle %s.\n""" true true https://en.wikipedia.org/wiki/Gettext 0 0 Gettext Catalog https://github.com/textmate/gettext.tmbundle Gettext Catalog luna-1 Luna 2011 TJ Holowaychuk 13 pl https://github.com/tj/luna 0 771 1 4 23162 true 0 https://github.com/tj/luna pl 2011 2024 129 149 2452 41 false 2011 2017 639 16 78 2 8373 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. 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. https://github.com/tj/luna/issues 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. c markdown make yaml true 2917 0 17 1 false United Kingdom "def greet(name:string) return ""Hello "" + name end" https://github.com/tj/luna 0 0 genie Genie 2008 Jamie McCracken 24 pl 0 772 3 23159 8118 true 0 pl 17 17 21 0 text none programming false g/Genie.gs 2008 python boo d object-pascal vala java c Genie is a modern, general-purpose high-level programming language in active development since 2008. It was designed as an alternative, simpler and cleaner dialect for the Vala compiler, while preserving the same functionality of the Vala language. Genie uses the same compiler and libraries as Vala; the two can indeed be used alongside each other. The differences are only syntactic. Genie's syntax is derived from numerous modern languages like Python, Boo, D and Delphi. In the vein of Python, Genie uses indentation rather than curly brackets to delimit blocks. Like Vala, Genie uses the GObject type system to create classes and interfaces declared in Genie source code, without imposing additional runtime requirements (i.e., unlike Python, Java or C#, it does not require a virtual machine). Genie allows access to C libraries, especially those based in GObject (like GTK+), without using a different application binary interface (ABI). During compilation, the code is first translated to C source and header files, which are then compiled to platform-specific machine code using any available C compiler like GCC, thus allowing cross-platform software development. Although both Vala and Genie are being developed and promoted by GNOME, programs developed in Vala and Genie don't depend on the GNOME Desktop Environment, usually requiring only GLib. 2009 52 234 103 25291443 GNOME Foundation gs gs gs true 280 0 26 1 text http://www.rosettacode.org/wiki/Category:Genie United States "init print( ""Hello, World!"" ) " "[indent=2] init print ""Hello World""" "class Sample def run() stdout.printf(""Hello, world!\n"") init var sample = new Sample() sample.run()" Genie print """" true true true true https://en.wikipedia.org/wiki/Genie_(programming_language) 1 2 https://hopl.info/showlanguage.prx?exp=8118 Genie year|publisher|title|authors|isbn13\n||Genie (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133162990 Genie year|title|doi|citations|influentialCitations|authors|paperId\n2017|Letting the Genie Out of the Lamp: Using Natural Language Processing Tools to Predict Math Performance|10.1007/978-3-319-59888-8_28|11|0|S. Crossley and V. Kostyuk|156fabf8ba04f94c75191d2bd42b665e868a5e07\n2018|The Code Genie Programming Environment|10.1109/EIT.2018.8500194|2|0|Hadeel Mohammed Jawad and Deb de Laski-Smith and Samir Tout|18aae41b2d008ba0261db80c8794e53c9cff377b spiral spiral 2017 Marko Grdinić 15 pl 0 773 1 12 23158 true 0 https://github.com/mrakgr/The-Spiral-Language pl 2017 2024 2017 36 27 916 1 false 2017 2024 8072 11 3038 56 4330 https://github.com/mrakgr/The-Spiral-Language/issues python c f-sharp json cpp typescript html cuda markdown xml powershell toml true 1009 0 28 1 false Croatia inl x = 2 // Define a 64-bit integer in Spiral. inl mult a b = a * b inl f g = g 1 2, g 3.0 4.0 // Would give a type error in F#. f mult https://github.com/mrakgr/The-Spiral-Language // true true false 0 0 xaml XAML 2008 10 xmlFormat 11 774 1 23157 true 11 cmake dynamo-visual-language flow9 hhvm jinx monkeyx opencv powershell ripple roslyn-compiler uno xmlFormat false 2008 xml visual-studio-editor csharp visual-basic.net xbl html javascript linux Extensible Application Markup Language (XAML (listen)) is a declarative XML-based language developed by Microsoft that is used for initializing structured values and objects. It is available under Microsoft's Open Specification Promise. The acronym originally stood for Extensible Avalon Markup Language, Avalon being the code-name for Windows Presentation Foundation (WPF).XAML is used extensively in .NET Framework 3.0 & .NET Framework 4.0 technologies, particularly Windows Presentation Foundation (WPF), Silverlight, Windows Workflow Foundation (WF), Windows Runtime XAML Framework and Windows Store apps. In WPF, XAML forms a user interface markup language to define UI elements, data binding, events, and other features. In WF, workflows can be defined using XAML. XAML can also be used in Silverlight applications, Windows Phone apps and Windows Store apps. XAML elements map directly to Common Language Runtime object instances, while XAML attributes map to Common Language Runtime properties and events on those objects. XAML files can be created and edited with visual design tools like Microsoft Expression Blend, Microsoft Visual Studio, and the hostable Windows Workflow Foundation visual designer. They can also be created and edited with a standard text editor, a code editor like XAMLPad, or a graphical editor like Vector Architect. Anything that is created or implemented in XAML can be expressed using a more traditional .NET language, such as C# or Visual Basic .NET. However, a key aspect of the technology is the reduced complexity needed for tools to process XAML, because it is based on XML. Consequently, a variety of products are emerging, particularly in the WPF space, which create XAML-based applications. As XAML is simply based on XML, developers and designers are able to share and edit content freely amongst themselves without requiring compilation. XAML also benefits from being a declarative definition of the UI rather than procedural code to generate it. 2004 159 451 512 626631 202885 0 11 xaml https://www.noesisengine.com/docs/Gui.Core.XamlIntroduction.html https://reddit.com/r/xaml " XAML Example " https://en.wikipedia.org/wiki/Extensible_Application_Markup_Language 23 1 year|publisher|title|authors|isbn13\n2012|O'Reilly Media|HLSL and Pixel Shaders for XAML Developers: A Comprehensive Guide to Creating HLSL Pixel Shaders for WPF and Silverlight Applications|Ritscher, Walt|9781449319847\n20121130|Springer Nature|Beginning Windows 8 Application Development - XAML Edition|Kyle Burns|9781430245674\n2019|Apress|Building Xamarin.Forms Mobile Apps Using XAML: Mobile Cross-Platform XAML and Xamarin.Forms Fundamentals|Dan Hermes and Nima Mazloumi|9781484240304\n2013-02-04T00:00:01Z|Microsoft Press|Programming Windows: Writing Windows 8 Apps With C# and XAML (Developer Reference)|Petzold, Charles|9780735671768\n2013|Sams Publishing|Windows 8.1 Apps with XAML and C# Unleashed|Nathan, Adam|9780133744408\n2012|Sams Publishing|Windows 8 Apps with XAML and C# Unleashed|Nathan, Adam|9780132984348\n2019|Sams Publishing|Windows 8 Apps with XAML and C# Unleashed|Nathan, Adam|9780672336010\n2012|Apress|Windows 8 XAML Primer: Your essential guide to Windows 8 development (Expert's Voice in Xaml)|Liberty, Jesse|9781430249122\n2014|Addison-Wesley Professional|Programming the Windows Runtime by Example: A Comprehensive Guide to WinRT with Examples in C# and XAML (Microsoft Windows Development Series)|Likness, Jeremy and Garland, John|9780133430400\n2013|Apress|Windows 8 App Projects - XAML and C# Edition (Expert's Voice in Windows 8)|Vermeir, Nico|9781430250661\n2015|Apress|Pro XAML with C#: Application Development Strategies (covers WPF, Windows 8.1, and Windows Phone 8.1)|James, Buddy and Lalonde, Lori|9781430267751\n2012|Wrox|Professional Windows 8 Programming: Application Development with C# and XAML|Lecrenski, Nick and Holland, Doug and Sanders, Allen and Ashley, Kevin|9781118205709\n2012|Apress|Windows 8 Apps Revealed Using XAML and C# (Expert's Voice in Windows 8)|Freeman, Adam|9781430250357\n2014-06-16T00:00:01Z|AddisonWesley Professional|Programming the Windows Runtime by Example: A Comprehensive Guide to WinRT with Examples in C# and XAML (Microsoft Windows Development Series)|Likness, Jeremy|9780321927972\n2006|Packt Publishing|Programming Windows Workflow Foundation: Practical WF Techniques and Examples using XAML and C#: A C# developer's guide to the features and programming interfaces of Windows Workflow Foundation|Allen, K. Scott|9781904811213\n2012|Apress|Windows 8 XAML Primer: Your essential guide to Windows 8 development (Expert's Voice in Xaml)|Liberty, Jesse|9781430249115\n20120703|O'Reilly Media, Inc.|HLSL and Pixel Shaders for XAML Developers|Walt Ritscher|9781449325022\n2014|Apress|Pro Windows 8.1 Development with XAML and C#|Liberty, Jesse and Galloway, Jon and Japikse, Philip|9781430240488\n|Wiley India Private Limited|Professional Windows 8 Programming: Application Development with C# and XAML|Nick Lecrenski|9788126540181\n2013|WILEY|Programming Windows: Writing Windows 8 Apps with C# and XAML|Charles Petzold|9789350045084\n20120703|O'Reilly Media, Inc.|HLSL and Pixel Shaders for XAML Developers|Walt Ritscher|9781449325015\n20130603|Simon & Schuster|Windows Store App Development: C# and XAML|Pete Brown|9781638352884\n20061222|Packt Publishing|Programming Windows Workflow Foundation: Practical WF Techniques and Examples using XAML and C#|K. Scott Allen|9781847190154 year|title|doi|citations|influentialCitations|authors|paperId\n2012|Beginning Windows 8 Application Development: XAML Edition|10.1007/978-1-4302-4567-4|3|2|Kyle Burns|06552de9db9aed1eba2a675855580fd129a5ded9 koara koara 2016 Andy Van Den Heuvel 15 textMarkup https://web.archive.org/web/20160221081308/http://koara.io/projects 0 0.14.0 775 0 4 23157 true 0 https://github.com/koara/koara-java textMarkup 2015 2018 2015 3 0 3 0 false 2015 2018 248 1 36 2 400 https://github.com/koara java gradle markdown yaml true 1006 0 19 1 false 0 true https://search.maven.org/artifact/io.koara/koara Belgium https://github.com/koara/koara-java 0 0 koara.io 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 vyxal Vyxal 2020 lyxal 19 esolang http://vyxal.pythonanywhere.com 0 v4.2.0 776 1 10 23157 true 0 https://github.com/Vyxal/Vyxal esolang 2020 2024 2020 6 31 265 4 false 2020 2025 10125 76 132 69 2975536 Code Golf vy vyxal scala markdown yaml python javascript scheme css html bourne-shell json true 439 0 31 1 false 4 true false https://github.com/Vyxal/Vyxal/tree/main/documents Australia ₁ƛ₍₃₅kF½*∑∴, https://www.reddit.com/r/vyxal https://github.com/Vyxal/Vyxal 0 0 vyxal.pythonanywhere.com dns DNS 1985 Paul Mockapetris 11 protocol 0 777 0 23156 true 2 doh gns protocol false Domain Name System 1985 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. 3154 1658 8339 SRI 15790 0 11 1 United States https://en.wikipedia.org/wiki/Domain_Name_System 6 2 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 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 oxyl Oxyl 2019 J Rain De Jager 15 pl https://www.oxyllang.org/ 0 1.1.2-alpha-opam3 778 0 10 23156 true 0 https://gitlab.com/selfReferentialName/oxylc pl false 2019 2020 444 3 69 99 7836 Oxyl is a functional programming language focused on being explicit and safe but not clunky or verbose Oxyl is a functional programming language focused on being explicit and safe but not clunky or verbose https://gitlab.com/selfReferentialName/oxylc/-/issues Oxyl is a functional programming language focused on being explicit and safe but not clunky or verbose bourne-shell assembly-language c vim-script asciidoc yaml make python dockerfile bash true 1004 0 25 1 false 1 true https://opam.ocaml.org/packages/oxylc South Africa https://gitlab.com/selfReferentialName/oxylc 0 0 oxyllang.org c-- C-- 1997 Simon Peyton Jones 13 pl http://www.cs.tufts.edu/~nr/c--/index.html 0 779 1 23155 3733 true 0 pl false c/C-- 1997 c ascii assembly-language modula-3 bcpl llvmir 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. 2005 568 45 148 1422467 Tufts University 2861 0 13 1 text United States "target byteorder little; import puts; export main; section ""data""{ s:bits8[] ""Hello World\0""; } foreign ""C"" main(){ foreign ""C"" puts(""address""s); foreign ""C"" return(0); } " C-- https://en.wikipedia.org/wiki/C-- 0 0 https://hopl.info/showlanguage.prx?exp=3733 popr popr 2012 24 pl https://popr.dev 0 780 1 14 23153 true 0 https://github.com/HackerFoo/poprc pl 2012 2024 2012 19 10 240 0 false 2012 2021 1806 3 164 4 47585 http://hackerfoo.com/eval.html 2019 Popr applies concatenative programming to types as well as values, striving for purity and correctness, and efficient execution. Popr applies concatenative programming to types as well as values, striving for purity and correctness, and efficient execution. http://hackerfoo.com/presentations/ttpl_slides.html https://github.com/HackerFoo/poprc/issues Popr applies concatenative programming to types as well as values, striving for purity and correctness, and efficient execution. c svg bourne-shell make python nix lisp markdown yaml tex html css bash json c true 275 0 40 false text United States 1 2 | 3 + https://github.com/HackerFoo/poprc __ true false true true false 0 0 popr.dev chicken CHICKEN 2000 Felix Winkelmann 20 pl compiler lisp https://www.call-cc.org/ 1 5.3.0 781 1 9 23150 8676 true 1 queue https://code.call-cc.org/git/chicken-core.git pl false Chicken Scheme 2009 2025 6765 80 371 34 1994 scheme linux ios android stalin 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. 2000 24 128 4397102 The Chicken Team scheme bourne-shell c lisp tex make tcl css html true 221 0 30 scheme 1 false 5 true https://wiki.call-cc.org/man/5/The%20User%27s%20Manual 3605 Various "A glimpse of CHICKEN ;;; hello-world.scm (print ""Hello, world!"") ;;; Running it interpreted: $ csi -s hello-world.scm Hello, world! ;;; Compiling and running the executable binary: $ csc hello-world.scm $ ./hello-world Hello, world!" https://code.call-cc.org/git/chicken-core.git https://en.wikipedia.org/wiki/CHICKEN_(Scheme_implementation) 0 0 https://hopl.info/showlanguage.prx?exp=8676 potion Potion 2007 Jonathan Gillette 15 pl http://perl11.org/potion/ 0 782 0 10 23144 true 0 https://github.com/perl11/potion pl 2009 2024 2008 29 90 659 21 false 2008 2024 2421 30 214 5 28069 -1 Potion is an object- and mixin-oriented (traits) language. Potion is an object- and mixin-oriented (traits) language. https://github.com/perl11 Potion is an object- and mixin-oriented (traits) language. c bourne-shell markdown make yaml yacc perl css lisp ruby true 976 0 25 1 false United States and Germany and The Netherlands https://news.ycombinator.com/item?id=21176027 https://github.com/perl11/potion https://web.archive.org/web/20150325130627/https://en.wikipedia.org/wiki/Potion_(programming_language) 0 0 seed7 Seed7 2005 Thomas Mertes 29 pl http://seed7.sourceforge.net 0 783 2 23144 true 0 pl false s/Seed7.s7 2005 linux unix pascal modula-2 ada algol-68 c java unicode tls http ftp smtp mysql mariadb sqlite postgresql xml 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. 2012 37 78 114 36346048 https://sourceforge.net/p/seed7/mailman/seed7-users sd7 s7i s7 sd7 s7i 206 0 35 1 text http://www.rosettacode.org/wiki/Category:Seed7 Austria https://www.reddit.com/r/ProgrammingLanguages/comments/n0nii7/have_you_heard_about_seed7 "# Hello World in Seed7 $ include ""seed7_05.s7i""; const proc: main is func begin writeln(""Hello World!""); end func; " "$ include ""seed7_05.s7i""; const proc: main is func begin writeln(""Hello World""); end func; " Seed7 # writeln """" := true true true true true false true https://en.wikipedia.org/wiki/Seed7 0 0 Seed7 seed7.sourceforge.net game GAME 1977 12 pl 0 784 0 23143 1847 true 0 pl false 1958 A game is a structured form of play, usually undertaken for enjoyment and sometimes used as an educational tool. Games are distinct from work, which is usually carried out for remuneration, and from art, which is more often an expression of aesthetic or ideological elements. However, the distinction is not clear-cut, and many games are also considered to be work (such as professional players of spectator sports or games) or art (such as jigsaw puzzles or games involving an artistic layout such as Mahjong, solitaire, or some video games). Games are sometimes played purely for entertainment, sometimes for achievement or reward as well. They can be played alone, in teams, or online; by amateurs or by professionals. The players may have an audience of non-players, such as when people are entertained by watching a chess championship. On the other hand, players in a game may constitute their own audience as they take their turn to play. Often, part of the entertainment for children playing a game is deciding who is part of their audience and who is a player. Key components of games are goals, rules, challenge, and interaction. Games generally involve mental or physical stimulation, and often both. Many games help develop practical skills, serve as a form of exercise, or otherwise perform an educational, simulational, or psychological role. Attested as early as 2600 BC, games are a universal part of human experience and present in all cultures. The Royal Game of Ur, Senet, and Mancala are some of the oldest known games. 2001 1706 3200 18723138 University of Toronto 8550 0 12 https://learn.microsoft.com/en-us/gaming/ 305 Canada https://semanticscholar.org/paper/7b082816a74fb1f9f198c0fbdf8a128bcefa31a6 https://en.wikipedia.org/wiki/Game 99 0 https://hopl.info/showlanguage.prx?exp=1847 year|publisher|title|authors|isbn13\n2006|Apress|The Game Maker's Apprentice: Game Development for Beginners|Jacob Habgood and Mark Overmars|9781590596159\n2003|The MIT Press|Rules of Play: Game Design Fundamentals (The MIT Press)|Tekinbas, Katie Salen and Zimmerman, Eric|9780262240451\n2017|Addison-Wesley Professional|Advanced Game Design: A Systems Approach: A Systems Approach|Sellers, Michael|9780134667607\n2002|For Dummies|Windows Game Programming For Dummies|LaMothe, André|9780764516788\n2012|Watson-Guptill|Drawing Basics and Video Game Art: Classic to Cutting-Edge Art Techniques for Winning Video Game Design|Solarski, Chris|9780823098477\n2008|Jones & Bartlett Learning|Introduction to 3D Game Programming with DirectX 10|Luna, Frank|9781598220537\n2013|Addison-Wesley Professional|Game Programming Algorithms and Techniques: A Platform-Agnostic Approach (Game Design)|Madhav, Sanjay|9780321940155\n2014|Addison-Wesley Professional|Introduction to Game Design, Prototyping, and Development: From Concept to Playable Game with Unity and C#|Gibson Bond, Jeremy|9780321933164\n2007|Cambridge University Press|Algorithmic Game Theory||9780521872829\n2008|The MIT Press|Game Sound: An Introduction to the History, Theory, and Practice of Video Game Music and Sound Design (The MIT Press)|Collins, Karen|9780262033787\n2005|The MIT Press|The Game Design Reader: A Rules of Play Anthology (The MIT Press)||9780262195362\n2014|Addison-wesley|A Game Design Vocabulary: Exploring The Foundational Principles Behind Good Game Design|Anthropy, Anna.|9780321886927\n2014|Routledge|The Essential Guide to Game Audio|Horowitz, Steve|9780415706704\n2003|New Riders Games|Core Techniques and Algorithms in Game Programming|Dalmau, Daniel Sanchez-Crespo|9780131020092\n2009|A K Peters/CRC Press|Game Engine Architecture|Gregory, Jason|9781568814131\n2009|Cengage Learning PTR|Getting Started with Game Maker|Ford, Jr Jerry Lee|9781598638820\n2012|Cengage Learning PTR|Game Coding Complete, Fourth Edition|McShaffry, Mike and Graham, David|9781133776574\n2009|Course Technology/cengage Learning|Getting Started With Game Maker|Ford, Jerry Lee.|9781598638820\n2012|Mercury Learning & Information|Introduction to 3D Game Programming with DirectX 11|Luna, Frank|9781936420223\n2000|Charles River Media|Game Programming Gems (GAME PROGRAMMING GEMS SERIES)|DeLoura, Mark|9781584500490\n2009|Cengage Learning PTR|Beginning OpenGL Game Programming, Second Edition|Benstead, Luke|9781598635287\n2003|Sams Publishing|Managed DirectX 9 Kick Start: Graphics and Game Programming|Miller, Tom|9780672325960\n2016|Sams Publishing|Unreal Engine 4 Game Development in 24 Hours, Sams Teach Yourself|Cookson, Aram and DowlingSoka, Ryan and Crumpler, Clinton and Johnson, Tim|9780672337628\n2011|Cengage Learning PTR|XNA Game Studio 4.0 for Xbox 360 Developers|Harbour, Jonathan S.|9781584505372\n2011|Cengage Learning PTR|Wizards and Warriors: Massively Multiplayer Online Game Creation|Darby, Jason|9781598638516\n2007|Wiley|Game Programming: The L Line, The Express Line to Learning|Harris, Andy|9780470068229\n2017|Packt Publishing|Game Development Patterns and Best Practices: Better games, less hassle|Doran, John P. and Casanova, Matt|9781787127838\n2010|Wiley|Level Up!: The Guide to Great Video Game Design|Rogers, Scott|9780470688670\n2002|Course Technology PTR|Visual Basic Game Programming with DirectX (The Premier Press Game Development Series)|Harbour, Jonathan S.|9781931841252\n2004|Sams|Beginning Game Programming|Morrison, Michael|9780672326592\n2007|Apress|Beginning Game Development with Python and Pygame: From Novice to Professional (Expert's Voice)|McGugan, Will|9781590598726\n2007|Que|ActionScript 3.0 Game Programming University|Rosenzweig, Gary|9780789737021\n2013|Packt Publishing|LÖVE for Lua Game Programming|Akinlaja, Darmie|9781782161608\n1998|American Mathematical Society|A Gentle Introduction to Game Theory (Mathematical World, Vol. 13)|Saul Stahl|9780821813393\n2002|Muska & Lipman/Premier-Trade|Game Programming Tricks of the Trade (The Premier Press Game Development Series)|Phillips, Lorenzo|9781931841696\n1986|Cambridge University Press|Game Theory and Political Theory: An Introduction|Ordeshook, Peter C.|9780521315937\n2011|Packt Publishing|Unity 3.x Game Development by Example Beginner's Guide|Creighton, Ryan Henson|9781849691840\n2015|Packt Publishing|Learning LibGDX Game Development - Second Edition|Nair, Suryakumar Balakrishnan and Oehlke, Andreas|9781783554775\n2014|Prentice Hall|Core HTML5 2D Game Programming|Geary, David|9780133564242\n2005|Apress|Physics for Game Programmers|Palmer, Grant|9781590594728\n1990|Dell|Golf: The Mind Game|Mackenzie, Marlin M.|9780440502098\n2004|Charles River Media|AI Game Engine Programming (Game Programming Series)|Schwab, Brian|9781584503446\n2009|Charles River Media|David Perry on Game Design: A Brainstorming ToolBox|Perry, David and DeMaria, Rusel|9781584506683\n1995|Waite Group Pr|Black Art of 3D Game Programming: Writing Your Own High-Speed 3D Polygon Video Games in C|Lamothe, Andre|9781571690043\n2001|Wordware Publishing, Inc.|Computer Game Design: Theory and Practice|Rouse, Richard|9781556227356\n2016|Packt Publishing|Beginning C++ Game Programming|Horton, John|9781786466198\n2004|Cengage Learning PTR|Beginning Game Programming|Harbour, Jonathan S.|9781592005857\n2005|Cengage Learning PTR|The Game Producer's Handbook|Irish, Dan|9781592006175\n2006|Prentice Hall|Fundamentals of Game Design|Adams, Ernest and Rollings, Andrew|9780131687479\n2012|Pearson P T R|Core HTML5 Canvas: Graphics, Animation, and Game Development|Geary, David|9780132761611\n2004|Course Technology PTR|3D Game Engine Programming (Game Development Series)|Zerbst, Stefan and Duvel, Oliver|9781592003518\n2013|Packt Publishing|Unity Android Game Development by Example Beginner's Guide|Finnegan, Thomas|9781849692014\n2006|Course Technology|Game Development Essentials: Game Interface Design|Saunders, Kevin and Novak, Jeannie|9781418016203\n2014|Packt Publishing|GameMaker Game Programming with GML|DeLucas, Matthew|9781783559442\n1996|Waite Group Pr|Black Art of Java Game Programming|Fan, Joel and Tenitchi, Calin and Ries, Eric|9781571690432\n2006|Cengage Learning PTR|Beginning C++ Through Game Programming, Second Edition|Dawson, Michael|9781598633603\n2018|Addison-Wesley Professional|Game Programming in C++: Creating 3D Games (Game Design)|Madhav, Sanjay|9780134597201\n2000|Woodhead Publishing|Game Theory: Mathematical Models of Conflict (Horwood Series in Mathematics & Applications)|Jones, A. J.|9781898563143\n2008|Wrox|Professional XNA Programming: Building Games for Xbox 360 and Windows with XNA Game Studio 2.0|Nitschke, Benjamin|9780470261286\n2003|Cengage Learning PTR|Beginner’s Guide to DarkBASIC Game Programming (Game Development)|Harbour, Jonathan S. and Smith, Joshua|9781592000098\n2004|Addison-Wesley|Object-Oriented Game Development|Gold, Julian|9780321176608\n2018|Addison-wesley,|Game Programming In C++: Creating 3d Games|Madhav, Sanjay (author.)|9780134597201\n2014|Cengage Learning PTR|Beginning Game Programming|Harbour, Jonathan S.|9781305258952\n2007|McGraw-Hill Osborne Media|Microsoft XNA Game Studio Creators Guide: An Introduction to XNA Game Programming|Cawood,Stephen and McGee,Pat|9780071490719\n2004|CRC Press|3D Game Engine Architecture: Engineering Real-Time Applications with Wild Magic (The Morgan Kaufmann Series in Interactive 3D Technology)|Eberly, David H.|9780122290640\n2003|Sams Publishing|Sams Teach Yourself Game Programming in 24 Hours|Morrison, Michael|9780672324611\n2008|Cengage Learning|AI Game Engine Programming|Schwab, Brian|9781584505723\n2009|Cengage Learning|Game Coding Complete|McShaffry, Mike|9781584506805\n2005|Paraglyph Press|Game Coding Complete|McShaffry, Mike|9781932111910\n1989|Springer|Mathematical Introduction to Linear Programming and Game Theory (Undergraduate Texts in Mathematics)|Brickman, Louis|9780387969312\n2005|For Dummies|Beginning Flash Game Programming For Dummies|Harris, Andy|9780764589621\n2007|Cengage Learning PTR|Beginning Java Game Programming Second Edition|Harbour, Jonathan S.|9781598634761\n1994|Springer|Introduction to Game Theory (Universitext)|Morris, Peter|9780387942841\n2008|Focal Press|The Complete Guide to Game Audio, Second Edition: For Composers, Musicians, Sound Designers, Game Developers (Gama Network Series)|Marks, Aaron|9780240810744\n2012|Cengage Learning PTR|3D Game Programming All in One, Third Edition|Finney, Kenneth C|9781435457447\n2011|Cengage Learning PTR|UDK Game Development|Thorn, Alan|9781435460188\n2004|Cengage Learning PTR|Beginning Illustration and Storyboarding for Games (Premier Press Game Development)|Pardew, Les|9781592004959\n2004|Cengage Learning PTR|Game Interface Design|Fox, Brent|9781592005932\n2002|Muska & Lipman/Premier-Trade|Isometric Game Programming with DirectX 7.0 w/CD (Premier Press Game Development (Software))|Pazera, Ernest|9780761530893\n2006|New Riders Pub|Level Design for Games: Creating Compelling Game Experiences|Co, Phil|9780321375971\n2005|Cengage Learning PTR|More OpenGL Game Programming|Astle, Dave|9781592008308\n2004|Cengage Learning PTR|Game Design for Teens|Pardew, Les and Pugh, Scott and Nunamaker, Eric and Iverson, Brent L. and Wolfley, Ross|9781592004966\n2003|Apress|.NET Game Programming with DirectX 9.0|Alexandre Santos Lobao and Ellen Hatton|9781590590515\n2015-03-25|Packt Publishing|iOS Game Programming Cookbook|Bhanu Birani and Chhavi Vaishnav|9781784398255\n2006|Charles River Media|Programming An Rts Game With Direct3d|Carl Granberg|9781584504986\n2019|Independently published|Unity from Zero to Proficiency (Beginner): A Step-by-step guide to coding your first game|Felicia, Patrick|9781091872028\n2004|Course Technology PTR|Mathematics for Game Developers (Game Development)|Tremblay, Christopher|9781592000388\n2012|Apress|Foundation Game Design with ActionScript 3.0|van der Spuy, Rex|9781430239932\n1995|Waite Group Pr|Black Art of Windows Game Programming|Lyons, Eric R.|9781878739957\n2018|Apress|Developing 2D Games with Unity: Independent Game Programming with C#|Halpern, Jared|9781484237717\n2018|Packt Publishing|Game Programming using Qt 5 Beginner's Guide: Create amazing games with Qt 5, C++, and Qt Quick, 2nd Edition|Strakhov, Pavel and Wysota, Witold and Haas, Lorenz|9781788399999\n2011|Sams Publishing|Sams Teach Yourself Windows Phone 7 Game Programming in 24 Hours|Harbour, Jonathan|9780672335549\n2009|Packt Publishing|3D Game Development with Microsoft Silverlight 3: Beginner's Guide|Hillar,Gastón C.|9781847198921\n2013|Apress|HTML5 Game Programming with enchant.js|Shimizu, Ryo and Furukawa, Hidekazu and Fushimi, Ryohei and Tanaka, Ryo and Kratzer, Kevin and McInnis, Brandon and Inc, enchantjs|9781430247432\n2011|Academic Internet Publishers|[(Studyguide for Game Graphics Programming by Sherrod, Allen, ISBN 9781584505167 )] [Author: Cram101 Textbook Reviews] [Jun-2011]||9781584505167\n2013|Packt Publishing|SFML Game Development|Haller, Jan and Vogelius Hansson, Henrik and Moreira, Artur|9781849696845\n2009|Sams Publishing|Microsoft XNA Game Studio 3.0 Unleashed|Carter, Chad|9780672330223\n2017|Packt Publishing|Mastering Unity 2017 Game Development with C#: Create professional games with solid gameplay features and professional-grade workflow, 2nd Edition|Thorn, Alan|9781788398398\n2006|Jones & Bartlett Learning|Introduction To 3D Game Programming With Directx 9.0C: A Shader Approach (Wordware Game and Graphics Library)|Luna, Frank|9781598220162 mupad muPad 1997 20 pl http://mathworks.com/discovery/mupad.html 0 785 0 23139 7523 true 0 pl 69 71 39 0 text source.mupad programming false 18 2012 2018 4 algebra.py 1997 linux matlab java "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." 2004 29 76 102 30874575 University of Paderborn mu mu false 366 0 20 text Germany MuPAD true true true https://en.wikipedia.org/wiki/MuPAD 10 0 https://hopl.info/showlanguage.prx?exp=7523 mupad https://github.com/ccreutzig/sublime-MuPAD 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 mupad 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 tea Tea 1997 23 pl http://www2.pdmfc.com/tea 0 786 4 23139 true 0 pl 14 15 17 0 text source.tea markup false t/Tea.tea 10 2012 2015 1 3 templates.py 1997 tcl java scheme xml jvm 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). 2005 14 20 55 3431871 tea tea tea 291 0 26 text 2862 class Square Rectangle ( ) method Square constructor ( size ) { $super constructor $size $size } "echo ""Hello World"" " <% template foo() %> Tea Tea # echo """" true true true false true https://en.wikipedia.org/wiki/Tea_(programming_language) 0 0 Tea https://github.com/pferruggiaro/sublime-tea Tea gwion Gwion 2016 16 pl https://Gwion.github.io/Gwion 0 787 0 8 23137 true 0 https://github.com/fennecdjay/Gwion pl 2016 2024 2016 20 44 531 1 false 2016 2025 8517 33 1042 30 47368 Gwion is a strongly-timed musical programming language . Gwion is a strongly-timed musical programming language . https://github.com/Gwion Gwion is a strongly-timed musical programming language . c yaml bourne-shell markdown bash make ini nix true 698 0 24 false https://tio.run/#gwion text The Netherlands and United States and Turkey and France https://compilerspotlight.substack.com/p/language-showcase-gwion?sd=pf https://github.com/fennecdjay/Gwion 0 0 curv curv 2016 Doug Moen 14 pl http://www.curv3d.org/ 0 788 0 16 23136 true 0 https://github.com/curv3d/curv pl 2017 2024 2016 31 73 1134 31 false 2016 2023 3957 25 1557 21 675092 2018 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. 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. https://github.com/curv3d 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. cpp markdown restructuredtext python xml cmake css bourne-shell make glsl m4 yaml html c javascript powershell true 1380 0 30 1 false Canada https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0 https://github.com/curv3d/curv 0 0 curv3d.org noms-db noms-db 2015 Aaron Boodman and Erik Arvidsson 12 database 0 789 0 9 23135 false 0 https://github.com/attic-labs/noms database 2015 2024 2015 198 267 7444 293 false 2015 2021 4016 56 451 72 33650 Noms is a decentralized database philosophically descendant from the Git version control system. Noms is a decentralized database philosophically descendant from the Git version control system. https://github.com/attic-labs Noms is a decentralized database philosophically descendant from the Git version control system. go markdown python javascript html yaml bourne-shell json dockerfile true 8302 0 22 2 false https://github.com/attic-labs/noms/blob/master/doc/faq.md United States https://github.com/attic-labs/noms 0 0 hujson HuJSON 2019 David Crawshaw 16 dataNotation 0 790 0 3 23125 true 0 https://github.com/tailscale/hujson dataNotation 2019 2024 2019 35 23 588 4 false 2019 2025 43 11 22 1 117 https://github.com/tailscale go yaml markdown true 669 0 22 1 false Various https://nigeltao.github.io/blog/2021/json-with-commas-comments.html https://github.com/tailscale/hujson // /* */ true true true 0 0 kal Kal 2012 18 pl http://rzimmerman.github.io/kal 0 0.5.6 791 1 3 23123 true 0 https://github.com/rzimmerman/kal pl 2012 2024 26 18 395 27 false javascript.py 2012 2014 444 6 47 2 8162 Kal is a highly readable, easy-to-use language that compiles to JavaScript. Kal is a highly readable, easy-to-use language that compiles to JavaScript. https://github.com/rzimmerman/kal/issues Kal is a highly readable, easy-to-use language that compiles to JavaScript. kal markdown json yaml javascript true 457 0 22 false 0 true United States task getUserFriends (userName) wait for user from db.users.findOne {name:userName} wait for friends from db.friends.find {userId:user.id} return friends Kal https://github.com/rzimmerman/kal true true true 0 0 pomsky Pomsky 2022 Ludwig Stecher 14 pl https://pomsky-lang.org/ 0 v0.4.3 792 1 12 23122 true 0 https://github.com/rulex-rs/pomsky pl 2022 2024 2022 9 19 1270 31 false Rulex 2022 2024 457 7 586 2 25187 https://github.com/rulex-rs rust markdown toml javascript yaml java csharp python z-shell bash svg json true 1336 0 26 1 false 0 true Germany 'Hello' ' '+ ('world' | 'pomsky') https://github.com/rulex-rs/pomsky 0 0 hashlink hashlink 2015 Nicolas Cannasse 14 bytecode https://hashlink.haxe.org/ 0 793 0 10 23121 true 0 https://github.com/HaxeFoundation/hashlink bytecode 2015 2024 2015 46 149 801 83 false 2015 2025 1755 84 803 10 721119 https://github.com/HaxeFoundation c haxe xml cmake json markdown cpp yaml make objective-c true 1334 0 24 1 false text Various https://github.com/HaxeFoundation/hashlink 0 0 hashlink.haxe.org luajit LuaJIT 2005 Mike Pall 12 compiler http://luajit.org/luajit.html 0 v2.1.0-beta3 794 0 5 23120 true 0 https://github.com/LuaJIT/LuaJIT compiler 2015 2024 2009 254 944 4555 62 false 2009 2025 2905 1 232 11 131820 https://github.com/LuaJIT c lua html make css true 7390 0 17 1 false 2 true Germany and Denmark https://github.com/LuaJIT/LuaJIT 0 0 ascii ASCII 1963 11 characterEncoding 0 795 1 23119 true 1 txt characterEncoding false American Standard Code for Information Interchange 1963 punched-tape c vi multics unix ftp utf-8 unicode java perl 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. 2001 4139 4364 3541 586 Started out as 7 bits. Now 8. Started out as 7 bits. Now 8. American National Standards Institute Started out as 7 bits. Now 8. 20715 0 11 na 7938 United States "!""#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~" https://en.wikipedia.org/wiki/ASCII 0 0 nqc Not Quite C 2017 Nora Sandler 19 pl 0 796 1 6 23115 true 0 https://github.com/nlsandler/nqcc pl 2017 2024 2017 16 16 271 5 false Not Quite C 2017 2022 86 3 116 1 2942 c linux 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. 2004 11 9 60 969174 https://github.com/nlsandler/nqcc/issues c ocaml bourne-shell markdown bash make true 398 0 26 1 false text United States task main () // Main program { SetPower(OUT_A, OUT_FULL); // Turn on motor A at 100% power. OnFor(OUT_A, 200); // Let the motor run for two seconds, and then turn it off. } https://github.com/nlsandler/nqcc // true true false https://en.wikipedia.org/wiki/Not_Quite_C 0 0 revolution-programming-language Revolution 1993 Mark Waddingham 14 pl https://livecode.com/ 0 9.6.3 797 1 25 23114 true 0 https://github.com/livecode/livecode pl 2013 2024 2013 71 220 475 189 false 2013 2021 29990 124 7646 150 1213423 2001 linux unix android ios hypertalk hypercard sql "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." 2011 2 56 5 30890362 LiveCode Ltd markdown cpp json python objective-cpp java xml bourne-shell c diff perl javascript make html awk pascal sql lisp yaml objective-c korn-shell r svg bash ini true 1291 0 40 livecode 1 false 9 true United Kingdom "put url ""binfile:picture.jpg"" into url ""ftp://john:passwd@ftp.example.net:2121/picture.jpg""" https://github.com/livecode/livecode https://en.wikipedia.org/wiki/Revolution_(programming_language) 0 0 phel Phel 2020 Jens Haase 17 pl lisp https://phel-lang.org/ 0 v0.14.1 798 1 8 23111 true 0 https://github.com/phel-lang/phel-lang pl 2020 2024 2020 12 22 413 17 false 2020 2025 2358 29 813 6 55754 2020 https://github.com/phel-lang php markdown json yaml svg xml bourne-shell dockerfile php true 510 0 26 1 false 0 true United States " (ns hello-world\boot) (println ""Hello, World!"")" https://twitter.com/phel_lang https://github.com/phel-lang/phel-lang 0 0 phel-lang.org mako Mako 2006 18 template https://www.makotemplates.org/ 3 799 1 23109 true 3 cloc minidsdb pygments template 3698 4341 188 0 text text.html.mako programming false 17 2012 2016 6 templates.py 2006 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. 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. https://www.makotemplates.org/community.html 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. mako mao mao 201 0 20 mako mao text United States "<%inherit file=""base.html""/> <% rows = [[v for v in range(0,10)] for row in range(0,10)] %> % for row in rows: ${makerow(row)} % endfor
<%def name=""makerow(row)""> % for name in row: ${name}\ % endfor " Mako true true 0 0 makotemplates.org Mako https://github.com/marconi/mako-tmbundle Mako wyvern Wyvern 2012 15 pl http://wyvernlang.github.io/ 0 800 1 17 23107 true 0 https://github.com/wyvernlang/wyvern pl 2012 2024 2012 79 66 551 63 false w/Wyvern.wyv 2012 2025 3542 70 1532 46 122637 2013 Wyvern is a computer programming language created by Jonathan Aldrich and Alex Potanin for the development of web and mobile applications with security and assurance being number one priority. Wyvern supports object capabilities, it is structurally typed, and aims to make secure way of programming easier than insecure - as described in the Wyvern Manifesto. One of the early available features that make Wyvern special is a way to safely use multiple programming languages within the same program so programmers can use the language most appropriate for each function while at the same time increasing the program's security. It is currently in a prototype stage and distributed under a GPLv2 license. 8 2 43528524 wyv java javascript bash json markdown bourne-shell logos ejs python xml html protobuf lisp css yaml svg make true 881 0 34 false "require stdout stdout.print(""Hello World"") " Wyvern https://github.com/wyvernlang/wyvern stdout.print """" true true https://en.wikipedia.org/wiki/Wyvern_(programming_language) 0 0 wyvernlang.github.io nestedtext NestedText 2020 Ken Kundert 19 dataNotation https://nestedtext.org 0 801 1 11 23107 true 0 https://github.com/KenKundert/nestedtext dataNotation 2020 2024 2020 11 12 343 1 false configs.py 2020 2025 539 9 102 1 11400 https://nurdletech.com nt python restructuredtext yaml ini toml json make xml bourne-shell csv css true 390 0 32 yaml 1 false United States # Contact information for our officers Katheryn McDaniel: position: president address: > 138 Almond Street > Topeka, Kansas 20697 phone: cell: 1-210-555-5297 home: 1-210-555-8470 # Katheryn prefers that we always call her on her cell phone. email: KateMcD@aol.com additional roles: - board member Margaret Hodge: position: vice president address: > 2586 Marigold Lane > Topeka, Kansas 20682 phone: 1-470-555-0398 email: margaret.hodge@ku.edu additional roles: - new membership task force - accounting task force NestedText https://github.com/KenKundert/nestedtext # true true false 0 0 nestedtext.org homa Homa 2018 John Ousterhout 21 protocol https://homa-transport.atlassian.net/wiki/spaces/HOMA/overview https://github.com/PlatformLab/HomaModule/blob/master/protocol.md 0 v2.0 802 0 9 23102 true 0 https://github.com/PlatformLab/HomaModule protocol 2018 2024 2018 13 41 171 2 false 2018 2025 1296 16 150 4 61078 TCP’s problems are too fundamental and interrelated to be fixed; the only way to harness the full performance potential of modern networks is to introduce a new transport protocol into the datacenter. TCP’s problems are too fundamental and interrelated to be fixed; the only way to harness the full performance potential of modern networks is to introduce a new transport protocol into the datacenter. Stanford University TCP’s problems are too fundamental and interrelated to be fixed; the only way to harness the full performance potential of modern networks is to introduce a new transport protocol into the datacenter. python c cpp markdown bash make bourne-shell perl cmake true 312 0 31 tcp 1 false 2 false https://homa-transport.atlassian.net/wiki/spaces/HOMA/overview United States https://web.stanford.edu/~ouster/cgi-bin/papers/replaceTcp.pdf https://github.com/PlatformLab/HomaModule 0 0 web.stanford.edu/ seq Seq 2019 15 pl https://seq-lang.org 0 v0.11.0 803 1 12 23101 true 0 https://github.com/seq-lang/seq pl 2018 2024 22 50 698 22 false 2018 2022 2998 17 481 12 112283 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. 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. MIT 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. cpp python restructuredtext json cmake markdown typescript yaml bourne-shell javascript make dockerfile true 867 0 28 python false 0 true United States http://cb.csail.mit.edu/cb/seq/oopsla19-paper34.pdf from sys import argv from genomeindex import * # index and process 20-mers def process(kmer: k20, index: GenomeIndex[k20]): prefetch index[kmer], index[~kmer] hits_fwd = index[kmer] hits_rev = index[~kmer] https://github.com/seq-lang/seq 0 0 open-nn OpenNN 2003 13 library https://www.opennn.net/ 0 v6.0.8 804 0 17 23099 true 0 https://github.com/Artelnics/opennn library 2015 2024 106 352 1136 37 false 2015 2024 8163 97 12297 502 1043002 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. 11 42129549 https://github.com/Artelnics/opennn cpp cmake fortran-77 csv xml c cuda bourne-shell python markdown yaml html bash javascript css xslt dtd true 2366 0 30 false 6 true https://www.opennn.net/documentation/opennn_start.html https://github.com/Artelnics/opennn https://en.wikipedia.org/wiki/OpenNN 0 0 opennn.net clu CLU 1975 Barbara Liskov 20 pl http://www.pmg.lcs.mit.edu/CLU.html 0 805 2 23095 637 true 0 pl false c/CLU.clu 1975 sparc algol-60 lisp simula ada argus lua ruby sather swift algol ml cpl java python csharp perl 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. 2001 62 48 166 7575 MIT clu 331 0 22 1 text https://github.com/antlr/grammars-v4/tree/master/clu United States "start_up = proc () po: stream := stream$primary_output () stream$putl (po, ""Hello World"") end start_up " complex_number = cluster is add, subtract, multiply, ... rep = record [ real_part: real, imag_part: real ] add = proc ... end add; subtract = proc ... end subtract; multiply = proc ... end multiply; ... end complex_number; CLU stream$putl """" true true https://en.wikipedia.org/wiki/CLU_(programming_language) 1 5 https://hopl.info/showlanguage.prx?exp=637 CLU year|publisher|title|authors|isbn13\n2011||Clu (programming Language)|Jordan Naoum|9786136725222 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 unlambda UNLAMBDA 1999 David Madore 25 esolang http://www.madore.org/~david/programs/unlambda/ 0 806 3 23093 2598 true 0 esolang false u/Unlambda.unl 1999 scheme c java "Unlambda is a minimal, ""nearly pure"" functional programming language invented by David Madore. It is based on combinatory logic, a version of the lambda calculus that omits the lambda operator. It relies mainly on two built-in functions (s and k) and an apply operator (written `, the backquote character). These alone make it Turing-complete, but there are also some input/output (I/O) functions to enable interacting with the user, some shortcut functions, and a lazy evaluation function. Variables are unsupported. Unlambda is free and open-source software distributed under a GNU General Public License (GPL) 2.0 or later." 2002 41 48 108 146927 unl true 226 0 26 1 https://tio.run/#unlambda https://esolangs.org/wiki/Unlambda text Unlambda https://repl.it/languages/unlambda http://www.rosettacode.org/wiki/Category:Unlambda United States # Hello World in unlambda `r```````````.H.e.l.l.o. .w.o.r.l.di `r```````````.H.e.l.l.o. .w.o.r.l.di https://riju.codes/unlambda `. `.!`.d`.l`.r`.o`.w`. `.,`.o`.l`.l`.e`.Hi Unlambda # true true false https://en.wikipedia.org/wiki/Unlambda 2 0 https://hopl.info/showlanguage.prx?exp=2598 year|publisher|title|authors|isbn13\n||Esoteric Programming Languages: Brainfuck, Intercal, Befunge, Esoteric Programming Language, Kvikkalkul, One Instruction Set Computer, Unlambda|Books and LLC|9781155349770\n2010||Langage De Programmation Exotique: Brainfuck, Malbolge, Snusp, Befunge, Shakespeare Programming Language, Thue, Lolcode, Whitespace, Unlambda|Groupe and Livres|9781159746025 astro astro 2016 15 pl http://www.nairaland.com/3557200/astro-programming-language-0.2-indefinite 0 807 0 3 23088 true 0 https://github.com/AppCypher/Astro pl 4 4 4515 html jsx text/jsx source.astro markup 2017 2024 2017 40 29 747 7 false 2017 2019 1462 10 41 4 4425 astro rust toml markdown true 846 0 19 false astro text http://www.rosettacode.org/wiki/Category:Astro Nigeria https://github.com/AppCypher/Astro 0 0 Astro Astro noulith noulith 2022 Brian Chen 14 pl https://betaveros.github.io 0 808 0 6 23082 true 0 https://github.com/betaveros/noulith pl 2022 2024 2022 9 20 1132 4 false 2022 2024 269 5 29 6 21402 *slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it *slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it https://github.com/betaveros/noulith/issues *slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it rust vim-script markdown html toml javascript true 1199 0 20 1 false https://github.com/betaveros/noulith/blob/main/README.md United States https://github.com/betaveros/noulith 0 0 elena ELENA 2013 Aleksey Rakov 20 pl http://elenalang.sourceforge.net/ 0 v6.0.10 809 1 14 23080 true 0 https://github.com/ELENA-LANG/elena-lang pl 2013 2024 2013 16 25 234 108 false e/Elena.elena 2013 2025 5675 13 956 51 320183 ELENA Language Project elena lex cpp html xml assembly-language markdown bash yaml css make cmake hlsl python javascript true 324 0 36 1 false 6 true Germany https://news.ycombinator.com/item?id=24222038 "public program [ console writeLine(""Hello World""). ] " https://twitter.com/elena_language Elena https://github.com/ELENA-LANG/elena-lang writeLine """" true true 0 0 elenalang.sourceforge.net co-dfns co-dfns 2012 Aaron Hsu 15 pl https://www.patreon.com/arcfide 0 v2018.11.29 810 0 4 23079 true 0 https://github.com/Co-dfns/Co-dfns pl 2012 2024 2012 32 32 691 4 false 2012 2025 5505 24 321 410 477940 https://github.com/Co-dfns/ apl c markdown yaml true 813 0 19 1 false 2018 false United States https://dl.acm.org/doi/10.1145/2627373.2627384 https://twitter.com/patreon https://github.com/Co-dfns/Co-dfns 0 0 pcre PCRE 1997 Philip Hazel 16 queryLanguage http://pcre.org/ 0 811 0 12 23079 true 0 https://github.com/philiphazel/pcre2 queryLanguage false Perl Compatible Regular Expressions 2014 2025 2090 62 485 18 386337 2000 1997 regex c perl php r cmake unicode ascii utf-8 python "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." 2005 101 40 259 1712290 https://github.com/PCRE2Project html c cmake bourne-shell python yaml perl m4 starlark make zig markdown true 589 0 28 1 false text https://github.com/antlr/grammars-v4/tree/master/pcre Unknown https://github.com/philiphazel/pcre2 https://en.wikipedia.org/wiki/Perl_Compatible_Regular_Expressions 0 0 pcre.org abnf Augmented Backus-Naur Form 2008 17 grammarLanguage 0 812 2 23079 true 0 grammarLanguage 1 0 text source.abnf data false 46 2016 2016 1 2 Augmented Backus-Naur Form grammar_notation.py 2010 regex "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." 51 22 60476 abnf abnf 475 0 20 text https://github.com/antlr/grammars-v4/tree/master/abnf "; Source: https://github.com/toml-lang/toml ; License: MIT ;; This is an attempt to define TOML in ABNF according to the grammar defined ;; in RFC 4234 (http://www.ietf.org/rfc/rfc4234.txt). ;; TOML toml = expression *( newline expression ) expression = ( ws / ws comment / ws keyval ws [ comment ] / ws table ws [ comment ] ) ;; Newline newline = ( %x0A / ; LF %x0D.0A ; CRLF ) newlines = 1*newline ;; Whitespace ws = *( %x20 / ; Space %x09 ; Horizontal tab ) ;; Comment comment-start-symbol = %x23 ; # non-eol = %x09 / %x20-10FFFF comment = comment-start-symbol *non-eol ;; Key-Value pairs keyval-sep = ws %x3D ws ; = keyval = key keyval-sep val key = unquoted-key / quoted-key unquoted-key = 1*( ALPHA / DIGIT / %x2D / %x5F ) ; A-Z / a-z / 0-9 / - / _ quoted-key = quotation-mark 1*basic-char quotation-mark ; See Basic Strings val = integer / float / string / boolean / date-time / array / inline-table ;; Table table = std-table / array-table ;; Standard Table std-table-open = %x5B ws ; [ Left square bracket std-table-close = ws %x5D ; ] Right square bracket table-key-sep = ws %x2E ws ; . Period std-table = std-table-open key *( table-key-sep key) std-table-close ;; Array Table array-table-open = %x5B.5B ws ; [[ Double left square bracket array-table-close = ws %x5D.5D ; ]] Double right square bracket array-table = array-table-open key *( table-key-sep key) array-table-close ;; Integer integer = [ minus / plus ] int minus = %x2D ; - plus = %x2B ; + digit1-9 = %x31-39 ; 1-9 underscore = %x5F ; _ int = DIGIT / digit1-9 1*( DIGIT / underscore DIGIT ) ;; Float float = integer ( frac / frac exp / exp ) zero-prefixable-int = DIGIT *( DIGIT / underscore DIGIT ) frac = decimal-point zero-prefixable-int decimal-point = %x2E ; . exp = e integer e = %x65 / %x45 ; e E ;; String string = basic-string / ml-basic-string / literal-string / ml-literal-string ;; Basic String basic-string = quotation-mark *basic-char quotation-mark quotation-mark = %x22 ; "" basic-char = basic-unescaped / escaped escaped = escape ( %x22 / ; "" quotation mark U+0022 %x5C / ; \ reverse solidus U+005C %x2F / ; / solidus U+002F %x62 / ; b backspace U+0008 %x66 / ; f form feed U+000C %x6E / ; n line feed U+000A %x72 / ; r carriage return U+000D %x74 / ; t tab U+0009 %x75 4HEXDIG / ; uXXXX U+XXXX %x55 8HEXDIG ) ; UXXXXXXXX U+XXXXXXXX basic-unescaped = %x20-21 / %x23-5B / %x5D-10FFFF escape = %x5C ; \ ;; Multiline Basic String ml-basic-string-delim = quotation-mark quotation-mark quotation-mark ml-basic-string = ml-basic-string-delim ml-basic-body ml-basic-string-delim ml-basic-body = *( ml-basic-char / newline / ( escape newline )) ml-basic-char = ml-basic-unescaped / escaped ml-basic-unescaped = %x20-5B / %x5D-10FFFF ;; Literal String literal-string = apostraphe *literal-char apostraphe apostraphe = %x27 ; ' Apostrophe literal-char = %x09 / %x20-26 / %x28-10FFFF ;; Multiline Literal String ml-literal-string-delim = apostraphe apostraphe apostraphe ml-literal-string = ml-literal-string-delim ml-literal-body ml-literal-string-delim ml-literal-body = *( ml-literal-char / newline ) ml-literal-char = %x09 / %x20-10FFFF ;; Boolean boolean = true / false true = %x74.72.75.65 ; true false = %x66.61.6C.73.65 ; false ;; Datetime (as defined in RFC 3339) date-fullyear = 4DIGIT date-month = 2DIGIT ; 01-12 date-mday = 2DIGIT ; 01-28, 01-29, 01-30, 01-31 based on month/year time-hour = 2DIGIT ; 00-23 time-minute = 2DIGIT ; 00-59 time-second = 2DIGIT ; 00-58, 00-59, 00-60 based on leap second rules time-secfrac = ""."" 1*DIGIT time-numoffset = ( ""+"" / ""-"" ) time-hour "":"" time-minute time-offset = ""Z"" / time-numoffset partial-time = time-hour "":"" time-minute "":"" time-second [time-secfrac] full-date = date-fullyear ""-"" date-month ""-"" date-mday full-time = partial-time time-offset date-time = full-date ""T"" full-time ;; Array array-open = %x5B ws ; [ array-close = ws %x5D ; ] array = array-open array-values array-close array-values = [ val [ array-sep ] [ ( comment newlines) / newlines ] / val array-sep [ ( comment newlines) / newlines ] array-values ] array-sep = ws %x2C ws ; , Comma ;; Inline Table inline-table-open = %x7B ws ; { inline-table-close = ws %x7D ; } inline-table-sep = ws %x2C ws ; , Comma inline-table = inline-table-open inline-table-keyvals inline-table-close inline-table-keyvals = [ inline-table-keyvals-non-empty ] inline-table-keyvals-non-empty = key keyval-sep val / key keyval-sep val inline-table-sep inline-table-keyvals-non-empty ;; Built-in ABNF terms, reproduced here for clarity ; ALPHA = %x41-5A / %x61-7A ; A-Z / a-z ; DIGIT = %x30-39 ; 0-9 ; HEXDIG = DIGIT / ""A"" / ""B"" / ""C"" / ""D"" / ""E"" / ""F"" " ABNF "postal-address = name-part street zip-part name-part = *(personal-part SP) last-name [SP suffix] CRLF name-part =/ personal-part CRLF personal-part = first-name / (initial ""."") first-name = *ALPHA initial = ALPHA last-name = *ALPHA suffix = (""Jr."" / ""Sr."" / 1*(""I"" / ""V"" / ""X"")) street = [apt SP] house-num SP street-name CRLF apt = 1*4DIGIT house-num = 1*8(DIGIT / ALPHA) street-name = 1*VCHAR zip-part = town-name "","" SP state 1*2SP zip-code CRLF town-name = 1*(ALPHA / SP) state = 2ALPHA zip-code = 5DIGIT [""-"" 4DIGIT]" ; true false true true true false https://en.wikipedia.org/wiki/Augmented_Backus–Naur_form 0 0 https://github.com/sanssecours/ABNF.tmbundle ABNF karel Karel 1981 Richard E. Pattis 17 pl 0 813 2 23079 958 true 0 pl false k/Karel.kl 1981 pascal java javascript robomind 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. 2005 91 27 205 1433925 University of California Irvine kl 475 0 19 1 text https://github.com/antlr/grammars-v4/tree/master/karel United States "PROGRAM hello_world BEGIN WRITE(""Hello World"", CR) END hello_world " BEGINNING-OF-PROGRAM DEFINE turnRight AS BEGIN turnLeft; turnLeft; turnLeft; END BEGINNING-OF-EXECUTION ITERATE 3 TIMES BEGIN turnRight; move END turnoff END-OF-EXECUTION END-OF-PROGRAM Karel WRITE """" true true https://en.wikipedia.org/wiki/Karel_(programming_language) 10 0 https://hopl.info/showlanguage.prx?exp=958 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 ssharp Script.NET 2007 19 pl http://www.protsyk.com/scriptdotnet/ 0 814 1 4 23078 true 0 https://github.com/PetroProtsyk/SSharp pl 2010 2024 2010 18 35 124 16 false Script.NET 2010 2021 69 6 420 2 37706 2007 javascript vba boo jython nemerle 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. 2007 23 11 63 13819923 S# is a weakly-typed dynamic language and runtime infrastructure to make your applications extendable, customizable and highly flexible. S# is a weakly-typed dynamic language and runtime infrastructure to make your applications extendable, customizable and highly flexible. https://github.com/PetroProtsyk/SSharp/issues S# is a weakly-typed dynamic language and runtime infrastructure to make your applications extendable, customizable and highly flexible. csharp xml yaml json true 372 0 24 false text The Netherlands function Push(item) [ //Limit to 10 items pre(me{{Not a typo|.}}Count < 10 ); post(); invariant(); ] { //me is mutated object, //stack in this case me.Push(item); } function Pop() [//Check emptiness hardik pre(me{{Not a typo|.}}Count > 0); post(); invariant(); ] { return me.Pop(); } stack = new Stack<|int|>(); //Create Mutant hardik //1. Set Functions, override stack{{Not a typo|.}}Push mObject=[Push->Push,PopCheck->Pop]; //2. Capture object mObject.Mutate(stack); for (i=0; i<5; i++) mObject.Push(i); Console.WriteLine((string)mObject.PopCheck()); https://github.com/PetroProtsyk/SSharp // true true false https://en.wikipedia.org/wiki/Script.NET 0 0 hasklig hasklig 2012 Ryan Stewart 12 font 0 815 0 7 23076 false 0 https://github.com/i-tu/Hasklig font 2014 2024 2012 81 156 5564 43 false 2012 2021 557 59 47313 144 2462496 a code font with monospaced ligatures a code font with monospaced ligatures https://github.com/i-tu/Hasklig/issues a code font with monospaced ligatures xml markdown bourne-shell html python css clojure true 6092 0 19 1 false Finland https://github.com/i-tu/Hasklig 0 0 freebasic FreeBASIC 2004 Andre Victor 15 pl 0 816 1 23075 true 0 pl 41 41 535 fb text vb text/x-vb source.vbnet programming false 2016 freebsd linux quickbasic c basic opengl 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. 2005 156 157 468 1443566 The FreeBASIC Development Team bi bas 800 0 15 1 http://www.rosettacode.org/wiki/Category:FreeBASIC Various Dim As Vector Ptr player = New Vector() *player = Type(100, 100) Print player->getX Print player->getY Delete player Sleep 'Prevents the program window from closing instantly true true true false https://en.wikipedia.org/wiki/FreeBASIC 0 0 FreeBasic FreeBasic cone Cone 2017 Jonathan Goodwin 16 pl http://cone.jondgoodwin.com/ 0 817 0 4 23071 true 0 https://github.com/jondgoodwin/cone pl 2017 2024 2017 22 17 517 3 false 2017 2022 1117 6 161 25 20994 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. 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. https://github.com/jondgoodwin/cone 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. c markdown xml cmake true 576 0 20 1 false text Australia and Belgium and France and Sweden and Indonesia https://github.com/jondgoodwin/cone 1 0 cone.jondgoodwin.com 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 hl7 HL7 1989 13 pl http://www.hl7.org/ 0 818 0 23069 6203 true 0 pl false 1996 1989 "Health Level Seven or HL7 refers to a set of international standards for transfer of clinical and administrative data between software applications used by various healthcare providers. These standards focus on the application layer, which is ""layer 7"" in the OSI model. The HL7 standards are produced by Health Level Seven International, an international standards organization, and are adopted by other standards issuing bodies such as American National Standards Institute and International Organization for Standardization. Hospitals and other healthcare provider organizations typically have many different computer systems used for everything from billing records to patient tracking. All of these systems should communicate with each other (or ""interface"") when they receive new information, or when they wish to retrieve information, but not all do so. HL7 International specifies a number of flexible standards, guidelines, and methodologies by which various healthcare systems can communicate with each other. Such guidelines or data standards are a set of rules that allow information to be shared and processed in a uniform and consistent manner. These data standards are meant to allow healthcare organizations to easily share clinical information. Theoretically, this ability to exchange information should help to minimize the tendency for medical care to be geographically isolated and highly variable.HL7 International considers the following standards to be its primary standards – those standards that are most commonly used and implemented: Version 2.x Messaging Standard – an interoperability specification for health and medical transactions Version 3 Messaging Standard – an interoperability specification for health and medical transactions Clinical Document Architecture (CDA) – an exchange model for clinical documents, based on HL7 Version 3 Continuity of Care Document (CCD) – a US specification for the exchange of medical summaries, based on CDA. Structured Product Labeling (SPL) – the published information that accompanies a medicine, based on HL7 Version 3 Clinical Context Object Workgroup (CCOW) – an interoperability specification for the visual integration of user applicationsOther HL7 standards/methodologies include: Fast Healthcare Interoperability Resources (FHIR) – a standard for the exchange of resources Arden Syntax – a grammar for representing medical conditions and recommendations as a Medical Logic Module (MLM) Claims Attachments – a Standard Healthcare Attachment to augment another healthcare transaction Functional Specification of Electronic Health Record (EHR) / Personal Health Record (PHR) systems – a standardized description of health and medical functions sought for or available in such software applications GELLO – a standard expression language used for clinical decision support" 413 207 384081 Health Level Seven International 2086 0 13 United States https://en.wikipedia.org/wiki/Health_Level_7 https://twitter.com/hl7 https://en.wikipedia.org/wiki/Health_Level_7 1 0 https://hopl.info/showlanguage.prx?exp=6203 hl7.org year|publisher|title|authors|isbn13\n2014|Apress|HL7 for BizTalk|Edidin, Howard and Bhardwaj, Vikas|9781430267638 lsl Linden Scripting Language 2003 27 pl 0 819 2 23068 true 0 pl 373 397 638 0 lsl lsl source.lsl programming false l/LSL.lsl 46 2007 2017 2 3 Linden Scripting Language scripting.py Linden Research, Inc lsl lslp lsl lsl 200 0 31 text http://www.rosettacode.org/wiki/Category:LSL United States http://wiki.secondlife.com/wiki/LSL_Portal "default { state_entry() { llSay(0, ""Hello World""); } }" "/* Testing syntax highlighting for the Linden Scripting Language */ integer someIntNormal = 3672; integer someIntHex = 0x00000000; integer someIntMath = PI_BY_TWO; integer event = 5673;// 'event' is invalid.illegal key someKeyTexture = TEXTURE_DEFAULT; string someStringSpecial = EOF; some_user_defined_function_without_return_type(string inputAsString) { llSay(PUBLIC_CHANNEL, inputAsString); } string user_defined_function_returning_a_string(key inputAsKey) { return (string)inputAsKey; } default { state_entry() { key someKey = NULL_KEY; someKey = llGetOwner(); string someString = user_defined_function_returning_a_string(someKey); some_user_defined_function_without_return_type(someString); } touch_start(integer num_detected) { list agentsInRegion = llGetAgentList(AGENT_LIST_REGION, []); integer numOfAgents = llGetListLength(agentsInRegion); integer index; // defaults to 0 for (; index <= numOfAgents - 1; index++) // for each agent in region { llRegionSayTo(llList2Key(agentsInRegion, index), PUBLIC_CHANNEL, ""Hello, Avatar!""); } } touch_end(integer num_detected) { someIntNormal = 3672; someIntHex = 0x00000000; someIntMath = PI_BY_TWO; event = 5673;// 'event' is invalid.illegal someKeyTexture = TEXTURE_DEFAULT; someStringSpecial = EOF; llSetInventoryPermMask(""some item"", MASK_NEXT, PERM_ALL);// 'llSetInventoryPermMask' is reserved.godmode llWhisper(PUBLIC_CHANNEL, ""Leaving \""default\"" now...""); state other; } } state other { state_entry() { llWhisper(PUBLIC_CHANNEL, ""Entered \""state other\"", returning to \""default\"" again...""); state default; } }" LSL LSL // /* */ """" true true true true true true false true 0 0 LSL https://github.com/textmate/secondlife-lsl.tmbundle LSL opal Opal 1994 20 pl 0 820 2 15 23065 true 0 https://github.com/TU-Berlin/opal pl 9 10 14 0 text source.opal programming 2016 2024 1998 6 4 13 0 false 46 2013 2017 1 3 1998 2016 833 9 3723 9 310579 OPAL (OPtimized Applicative Language) is a functional programming language first developed at the Technical University of Berlin. 2005 11 5 23 1936835 https://github.com/TU-Berlin opal c tex tcl bourne-shell lisp clojure perl bash cmake vim-script make lex java logos markdown true 310 0 36 false text Germany https://link.springer.com/chapter/10.1007%2F3-540-57840-4_34 "-- Deepak Chopra nonsense text generator -- see https://github.com/StoneCypher/DeepakChopra_Opal/ starts = [""Experiential truth "", ""The physical world "", ""Non-judgment "", ""Quantum physics ""] middles = [""nurtures an "", ""projects onto "", ""imparts reality to "", ""constructs with ""] qualifiers = [""abundance of "", ""the barrier of "", ""self-righteous "", ""potential ""] finishes = [""marvel."", ""choices."", ""creativity."", ""actions.""] alert starts.sample + middles.sample + qualifiers.sample + finishes.sample" IMPLEMENTATION GCD IMPORT Nat COMPLETELY DEF GCD(a,b) == IF a % b = 0 THEN b ELSE IF a-b < b THEN GCD(b,a-b) ELSE GCD(a-b,b) FI FI https://github.com/TU-Berlin/opal -- true true false https://en.wikipedia.org/wiki/Opal_(programming_language) 0 0 Opal https://github.com/artifactz/sublime-opal Opal visdown visdown 2016 Amit Kapoor 15 textMarkup https://visdown.com/ 0 0.1.0 821 1 7 23062 true 0 https://github.com/amitkaps/visdown textMarkup 2016 2024 2016 20 38 663 12 false 2016 2021 74 2 65 5 38545 2017 Write visualisation using a simple declarative markup like you would write code. Just wrap it in fenced block (three backticks) and mark the language as `vis`. Write visualisation using a simple declarative markup like you would write code. Just wrap it in fenced block (three backticks) and mark the language as `vis`. Write visualisation using a simple declarative markup like you would write code. Just wrap it in fenced block (three backticks) and mark the language as `vis`. javascript markdown svg csv json css html true 781 0 22 1 false 0 true text ```vis data: url: data/cars.csv mark: point encoding: x: field: kmpl type: quantitative y: field: price type: quantitative ``` https://github.com/amitkaps/visdown 0 0 visdown.com leo-editor leo-editor 2013 vivainio2 13 editor https://leoeditor.com 0 v6.7.8 822 0 20 23061 false 0 https://github.com/leo-editor/leo-editor editor 2014 2024 2008 50 156 1469 31 false 2008 2025 35910 110 5340 252 627909 2013 https://github.com/leo-editor python html javascript svg xml css markdown restructuredtext qt ini bourne-shell php typescript toml xslt make yaml json qml rust true 2049 0 33 1 false 6 true United States and Canada https://github.com/leo-editor/leo-editor 0 0 leoeditor.com livr Livr 2012 Viktor Turskyi 16 dataValidationLanguage https://livr-spec.org/ 0 823 1 4 23060 true 1 json-schema https://github.com/koorchik/LIVR dataValidationLanguage 2012 2024 2012 16 22 287 22 false Language Independent Validation Rules 2012 2022 251 15 264 12 4007 http://webbylab.github.io/livr-playground/ 2013 https://github.com/koorchik/LIVR/issues json markdown svg less true 370 0 20 1 false United States { name: 'required', phone: {max_length: 10}, address: {nested_object: { city: 'required', zip: ['required', 'positive_integer'] }} } https://github.com/koorchik/LIVR 0 0 livr-spec.org malbolge Malbolge 1998 Ben Olmstead 13 esolang 0 824 3 23058 true 0 esolang false m/Malbolge.mb 1998 brainfuck intercal befunge ascii 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. 2003 401 66 420 237720 https://web.archive.org/web/20040404144205/http://www.mines.edu/students/b/bolmstea/randlang/index.html mb 2025 0 13 1 https://tio.run/#malbolge https://esolangs.org/wiki/Malbolge http://www.rosettacode.org/wiki/Category:Malbolge United States "(=<`#9]~6ZY32Vx/4Rs+0No-&Jk)""Fh}|Bcy?,vNz]KZ%oG4UUS0/@-eMc(:'8" https://riju.codes/malbolge " (=<`#9]~6ZY32Vx/4Rs+0No-&Jk)""Fh}|Bcy?`=*z]Kw%oG4UUS0/@-ejc(:'8dc " "0000000000111111111122222222223333333333444444444455555555556666666666777777777788888888889999 0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123 ---------------------------------------------------------------------------------------------- 9m<.TVac`uY*MK'X~xDl}REokN:#?G""i@5z]&gqtyfr$(we4{WP)H-Zn,[%\3dL+Q;>U!pJS72FhOA1CB6v^=I_0/8|jsb" Malbolge https://en.wikipedia.org/wiki/Malbolge 0 0 marp Marp 2018 14 textMarkup https://marp.app/ 0 3.9.0 825 1 7 23057 true 0 https://github.com/marp-team/marp-core textMarkup 2018 2024 10 127 753 14 false 2018 2024 1298 6 66 5 19697 Presentations in markdown Presentations in markdown https://github.com/marp-team Presentations in markdown typescript javascript markdown scss yaml json svg true 1142 0 22 markdown false 3 true Japan --- theme: gaia size: 4:3 --- # A traditional 4:3 slide https://github.com/marp-team/marp-core 0 0 hvm2 HVM2 2024 Victor Taelin 11 vm https://higherorderco.com 0 826 0 8 23056 false 1 hvm https://github.com/higherorderco/hvm vm 2022 2024 97 390 10355 40 false 2024 2024 1357 23 87 9 12626 A massively parallel, optimal functional runtime in Rust A massively parallel, optimal functional runtime in Rust A massively parallel, optimal functional runtime in Rust rust yaml cuda markdown javascript c toml python true 11550 0 20 hvm 1 false https://github.com/higherorderco/hvm 0 0 uno Uno 2002 18 pl https://fuseopen.com 0 3.0.0-beta.10 827 1 18 23052 true 0 https://github.com/fuse-open/uno pl 24 37 232 0 csharp clike text/x-csharp source.cs programming 2018 2024 2002 9 23 89 14 false 235 2014 2018 3 30 2002 2024 6037 33 3339 38 201678 2017 The Uno langauge is a dialect of C#, designed for cross-compilation to C++ and other languages. Uno does not require the .NET Framework, but has instead a more lightweight library called UnoCore. The syntax of Uno is more or less identical to C#, with deviations documented here. The Uno langauge is a dialect of C#, designed for cross-compilation to C++ and other languages. Uno does not require the .NET Framework, but has instead a more lightweight library called UnoCore. The syntax of Uno is more or less identical to C#, with deviations documented here. The Uno langauge is a dialect of C#, designed for cross-compilation to C++ and other languages. Uno does not require the .NET Framework, but has instead a more lightweight library called UnoCore. The syntax of Uno is more or less identical to C#, with deviations documented here. uno csharp xml java cpp bourne-shell objective-cpp markdown json javascript python gradle cmake xaml bash yaml make swift typescript true 393 0 36 false 3 true https://tio.run/#uno text https://fuseopen.com/docs/uno/uno-lang.html using Uno; using Uno.Collections; using Uno.Graphics; using Uno.Scenes; using Uno.Designer; using Uno.Content; using Uno.Content.Models; using Uno.UI; namespace PONG2D { public class PlayerPads : Node { Image _player1Image; Image _player2Image; [Inline] public Image Player1 { get { return _player1Image; } set { if (_player1Image != value) { _player1Image = value; } } } [Inline] public Image Player2 { get { return _player2Image; } set { if (_player2Image != value) { _player2Image = value; } } } [Hide] public float2 Player1Pos { get { return (Player1.ActualPosition); } set { if (Player1 != null) Player1.Position = value; } } [Hide] public float2 Player2Pos { get { return (Player2.ActualPosition); } set { if (Player2 != null) Player2.Position = value; } } public Rect Player1Rect { get { return new Rect(Player1Pos, float2(Player1.Width, Player2.Height)); } set { Player1Pos = value.Position; if (Player1 != null) { Player1.Width = value.Size.X; Player1.Height = value.Size.Y; } } } public Rect Player2Rect { get { return new Rect(Player2Pos, float2(Player2.Width, Player2.Height)); } set { Player2Pos = value.Position; if (Player2 != null) { Player2.Width = value.Size.X; Player2.Height = value.Size.Y; } } } public Ball Ball { get; set; } public float PadVelocity { get; set; } public PlayerPads() { } void UpdatePositions() { } protected override void OnUpdate() { base.OnUpdate(); if (Input.IsKeyDown(Uno.Platform.Key.W)) { Player1Pos = float2(0, Player1Pos.Y - PadVelocity); } if (Input.IsKeyDown(Uno.Platform.Key.S)) { Player1Pos = float2(0, Player1Pos.Y + PadVelocity); } if (Input.IsKeyDown(Uno.Platform.Key.Up)) { Player2Pos = float2(0, Player2Pos.Y - PadVelocity); } if (Input.IsKeyDown(Uno.Platform.Key.Down)) { Player2Pos = float2(0, Player2Pos.Y + PadVelocity); } if (Ball != null) { if (Ball.BallRectangle.Intersects(Player1Rect) || Ball.BallRectangle.Intersects(Player2Rect)) { Ball.BallVelocity = float2(Ball.BallVelocity.X * -1f, Ball.BallVelocity.Y); } } } } } https://github.com/fuse-open/uno 0 0 fuseopen.com Uno https://github.com/atom/language-csharp Uno aretext aretext 2020 Will Daly 20 editor https://aretext.org 0 https://devnonsense.com/posts/ 1.0 828 0 11 23051 false 0 https://github.com/aretext/aretext editor 2021 2024 2020 11 14 248 4 false 2020 2025 1577 9 267 5 33029 Minimalist text editor with vim-compatible key bindings. Minimalist text editor with vim-compatible key bindings. https://dev-nonsense.com Minimalist text editor with vim-compatible key bindings. go markdown yaml json bourne-shell make xml html python c rust https://aretext.org/docs/cheat-sheet.html true 301 0 31 1 false 1 true https://raw.githubusercontent.com/aretext/aretext/main/screencast.gif https://aretext.org/docs/#getting-started United States https://aretext.org/docs/#getting-started https://github.com/aretext/aretext 0 0 aretext.org berry Berry 2018 官文亮 14 pl https://github.com/berry-lang/berry 0 v1.1.0 829 1 10 23049 true 0 https://github.com/berry-lang/berry pl 2018 2024 32 95 790 19 false 2018 2025 1054 39 209 3 52022 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). 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). https://github.com/berry-lang/ 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). c restructuredtext python json markdown make yaml cmake xml bourne-shell true 1116 0 24 1 false 1 true China def fib(x) if (x <= 1) return x end return fib(x - 1) + fib(x - 2) end https://github.com/berry-lang/berry 0 0 tap TAP 1988 17 protocol https://testanything.org/ 0 830 1 1 23047 true 0 https://github.com/TestAnything/test-anything-protocol protocol 2009 2024 2009 17 7 43 1 false Test Anything Protocol testing.py 2009 2009 10 1 3 1 1830 2007 1987 perl 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. 2006 56 19 122 7039060 tap xml true 448 0 18 false na 6828 TAP https://reddit.com/r/testanythingprotocol 1..4 ok 1 - Input file opened not ok 2 - First line of the input valid. More output from test 2. There can be arbitrary number of lines for any output so long as there is at least some kind of whitespace at beginning of line. ok 3 - Read the rest of the file #TAP meta information not ok 4 - Summarized correctly # TODO: not written yet https://github.com/TestAnything/test-anything-protocol https://en.wikipedia.org/wiki/Test_Anything_Protocol 2 0 testanything.org 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 sweetjs Sweet.js 2012 Tim Disney 12 pl https://sweetjs.org 0 3.0.13 831 0 4 23046 true 0 https://github.com/sweet-js/sweet-core/ pl 2012 2024 131 207 4584 66 false 2012 2017 2272 41 88 26 23587 Facebook javascript json markdown yaml true 5248 0 16 1 false 3 true United States https://github.com/sweet-js/sweet-core/ 0 0 clash clash 2015 13 pl http://www.clash-lang.org 0 v1.8.1 832 0 18 23046 true 0 https://github.com/clash-lang/clash-compiler pl 2013 2024 58 149 1404 307 false 2012 2025 7453 89 1372 23 285006 2015 Haskell Foundation haskell yaml xml svg markdown restructuredtext bourne-shell c nix python tcl json dockerfile bash make powershell ini css true 1942 0 31 false 1 true The Netherlands https://github.com/clash-lang/clash-compiler 0 0 clash-lang.org 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 oxygene Oxygene 2002 21 pl http://elementscompiler.com 0 833 2 23043 true 0 pl 32 35 65 0 text none programming false o/Oxygene.pas 2014 2017 object-pascal csharp eiffel java f-sharp delphi swift free-pascal "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." 2006 50 212 346 4249746 RemObjects Software oxygene pas 271 0 23 text http://www.rosettacode.org/wiki/Category:Oxygene United States implementation class method ConsoleApp.Main; begin Console.WriteLine('Hello World'); end; end. Type: System.Int32 -> a = 23, b = 15 -> a = 15, b = 23 Type: System.String -> a = abc, b = def -> a = def, b = abc Type: System.Double -> a = 1,1, b = 1,2 -> a = 1,2, b = 1,1 Oxygene Console.WriteLine ' true true https://en.wikipedia.org/wiki/Oxygene_(programming_language) 2 0 Oxygene elementscompiler.com Oxygene 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 Oxygene icedcoffeescript IcedCoffeeScript 2009 Max Krohn 14 pl https://maxtaco.github.io/coffee-script/ 0 108.0.14 834 0 7 23042 true 0 https://github.com/maxtaco/coffee-script/ pl 2011 2024 21 58 728 84 false 2009 2019 8264 201 279 28 152734 https://github.com/maxtaco/coffee-script/issues coffee coffeescript javascript html markdown css json xml javascript true 1105 0 23 1 false 108 true United States https://github.com/maxtaco/coffee-script/ 0 0 hla High Level Assembly 2011 Randall Hyde 20 assembly https://plantation-productions.com/Webster/HighLevelAsm/index.html 0 835 1 23041 true 0 assembly false High Level Assembly 2011 assembly-language linux freebsd ia-32 pascal ada modula-2 microsoft-macro-assembler turbo-assembler x86-isa c nasm gas coff elf High Level Assembly (HLA) is an high-level assembly language developed by Randall Hyde. It allows the use of higher-level language constructs to aid both beginners and advanced assembly developers. It fully supports advanced data types and object-oriented programming. It uses a syntax loosely based on several high-level programming languages (HLLs), such as Pascal, Ada, Modula-2, and C++, to allow creating readable assembly language programs, and to allow HLL programmers to learn HLA as fast as possible. 2004 54 55 190 723581 Plantation Productions, Inc true true 291 0 24 pascal ada modula-2 cpp 1 text http://www.rosettacode.org/wiki/Category:HLA United States https://sourceforge.net/projects/hlav1/ procedure SetFormat; static chr :w.CHARRANGE; chr2 :w.CHARRANGE; cf :w.CHARFORMAT; begin SetFormat; w.SendMessage(hwnd, w.EM_GETMODIFY,0,0); push (eax); w.SendMessage(hwnd, w.EM_EXGETSEL,0, &chr); w.SendMessage(hwnd, w.EM_HIDESELECTION, true,0); mov (0, chr2.cpMin); mov (-1,chr2.cpMax); w.SendMessage(hwnd, w.EM_EXSETSEL,0,&chr2); mov (@size(cf), cf.cbSize); mov (w.CFM_CHARSET | w.CFM_FACE | w.CFM_SIZE | w.CFM_COLOR, cf.dwMask); mov (logfont.lfCharSet, al); mov (al,cf.bCharSet); mov (logfont.lfPitchAndFamily, al); mov (al, cf.bPitchAndFamily); w.lstrcpyn(cf.szFaceName,&logfont.lfFaceName,w.LF_FACESIZE); mov (logfont.lfHeight, eax); neg (eax); mov (15,ecx); mul (ecx); mov (eax, cf.yHeight); mov (rgb, cf.crTextColor); w.SendMessage(hwnd, w.EM_SETCHARFORMAT, w.SCF_SELECTION,&cf); w.SendMessage(hREd, w.WM_SETFONT, hFont, true); w.SendMessage(hREd, w.EM_SETMARGINS, w.EC_LEFTMARGIN,5); pop (eax); w.SendMessage(hwnd, w.EM_SETMODIFY, eax,0); w.SendMessage(hwnd, w.EM_EXSETSEL,0,&chr); w.SendMessage(hwnd,w.EM_HIDESELECTION, false, 0); end SetFormat; true true true https://en.wikipedia.org/wiki/High_Level_Assembly 0 0 threejs Three.js 2010 Ricardo Cabello 11 library https://threejs.org/ 0 836 0 9 23038 true 0 https://github.com/mrdoob/three.js library 2010 2024 2546 35365 102620 523 false 2010 2025 45780 2501 5356 1395 3536513 Javascript library for making animated 3D computer graphics in a web browser using WebGL. Javascript library for making animated 3D computer graphics in a web browser using WebGL. Javascript library for making animated 3D computer graphics in a web browser using WebGL. html javascript svg json markdown css yaml xml scss true 211238 0 20 1 false https://github.com/mrdoob/three.js https://en.wikipedia.org/wiki/Three.js 0 0 bython Bython 2016 13 pl 0 837 2 4 23037 true 0 https://github.com/mathialo/bython pl 2016 2024 2016 19 42 1762 26 false 2016 2018 170 4 33 1 1524 Python with braces. Because python is awesome, but whitespace is awful. Python with braces. Because python is awesome, but whitespace is awful. Python with braces. Because python is awesome, but whitespace is awful. python markdown make bash true 1893 0 18 false Norway "def print_message(num_of_times) { for i in range(num_of_times) { print(""Bython is awesome!""); } } if __name__ == ""__main__"" { print_message(10); }" https://riju.codes/bython "print(""Hello, world!"")" https://github.com/mathialo/bython print true 0 0 axiom AXIOM 1992 12 pl 0 838 0 23035 1673 true 0 pl false 1964 "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." 2001 994 1197 928 IBM 4990 0 12 https://axm.dev/language.html http://www.rosettacode.org/wiki/Category:Axiom United States https://semanticscholar.org/paper/5aa0cc98cc623c61d77cd900dbacc21d921152a3 https://en.wikipedia.org/wiki/Axiom 0 6 https://hopl.info/showlanguage.prx?exp=1673 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 diagram DIAGRAM 1980 12 pl 0 839 0 23034 7795 true 0 pl false 1984 uml drakon ladder-logic 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. 2004 981 500 598669 SRI 4925 0 12 6435 United States https://semanticscholar.org/paper/7b773624063af98bf0bfb75c705e489f736aa7f8 https://en.wikipedia.org/wiki/Diagram 4 25 https://hopl.info/showlanguage.prx?exp=7795 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 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. Năvră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 gentoo-ebuild Gentoo Ebuild 1999 20 pl https://wiki.gentoo.org/wiki/Ebuild 0 840 1 23031 true 0 pl 1476 0 Shell sh shell text/x-sh source.shell programming false 243 2013 2018 31 bash "An ebuild is a specialized bash script which automates compilation and installation procedures for software packages. The format was created by the Gentoo Linux project for use in its Portage software management system. Each version of an application or package in the Portage repository has a specific ebuild script written for it. The script is used by the emerge tool, also created by the Gentoo Linux project, to calculate any dependencies of the desired software installation, download the required files (and patch them, if necessary), configure the package (based on ""USE flag"" settings), compile, and perform a sandboxed installation (in /var/tmp/portage/[ebuild name]/image/ by default). Upon successful completion of these steps, the installed files are merged into the live system, outside the sandbox. Although most ebuilds found in the Gentoo Portage repository are used to compile programs from source code, there are also ebuilds to install binary packages, ebuilds that install only documentation or data such as fonts, and basic ebuilds called ""metabuilds"" whose sole purpose is to trigger the installation of other ebuilds (such as the GNOME or KDE metabuilds)." 2003 13 43 109 361390 An ebuild file is a text file, used by Gentoo package managers, which identifies a specific software package and how the Gentoo package manager should handle it. It uses a bash-like syntax style and is standardized through the EAPI version. Gentoo Linux uses ebuilds as the package management format for individual software titles. An ebuild file is a text file, used by Gentoo package managers, which identifies a specific software package and how the Gentoo package manager should handle it. It uses a bash-like syntax style and is standardized through the EAPI version. Gentoo Linux uses ebuilds as the package management format for individual software titles. Gentoo Foundation An ebuild file is a text file, used by Gentoo package managers, which identifies a specific software package and how the Gentoo package manager should handle it. It uses a bash-like syntax style and is standardized through the EAPI version. Gentoo Linux uses ebuilds as the package management format for individual software titles. ebuild 286 0 21 text United States https://wiki.gentoo.org/wiki/Basic_guide_to_write_Gentoo_Ebuilds " Copyright 1999-2018 Gentoo Foundation # Distributed under the terms of the GNU General Public License v2 EAPI=6 DESCRIPTION=""A classical example to use when starting on something new"" HOMEPAGE=""https://wiki.gentoo.org/index.php?title=Basic_guide_to_write_Gentoo_Ebuilds"" SRC_URI=""https://dev.gentoo.org/~tomwij/files/wiki/hello-world-1.0.tar.gz"" LICENSE=""MIT"" SLOT=""0"" KEYWORDS=""~alpha ~amd64 ~arm ~hppa ~ia64 ~ppc ~ppc64 ~s390 ~sh ~sparc ~x86""" https://twitter.com/gentoo # true true false https://en.wikipedia.org/wiki/Ebuild 0 0 https://github.com/atom/language-shellscript Gentoo Ebuild rockstar Rockstar 2018 Dylan Beattie 25 esolang https://codewithrockstar.com/ 0 v1.0.0 841 2 7 23031 true 1 rockstar-rkt https://github.com/dylanbeattie/rockstar esolang 2021 2024 2018 2 4 79 0 false r/Rockstar.rock 2018 2021 471 54 237 2 62271 2018 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. 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. https://github.com/RockstarLang 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. rock javascript css markdown html json yaml python true 147 0 34 1 false 1 true https://tio.run/#rockstar text http://www.rosettacode.org/wiki/Category:Rockstar United Kingdom "Midnight takes your heart and your soul While your heart is as high as your soul Put your heart without your soul into your heart Give back your heart Desire is a lovestruck ladykiller My world is nothing Fire is ice Hate is water Until my world is Desire, Build my world up If Midnight taking my world, Fire is nothing and Midnight taking my world, Hate is nothing Shout ""FizzBuzz!"" Take it to the top If Midnight taking my world, Fire is nothing Shout ""Fizz!"" Take it to the top If Midnight taking my world, Hate is nothing Say ""Buzz!"" Take it to the top Whisper my world" "Scream ""Hello World"" " Rockstar https://github.com/dylanbeattie/rockstar Scream """" true true 0 0 codewithrockstar.com pari-gp PARI/GP 1985 23 pl http://pari.math.u-bordeaux.fr/ 0 842 2 23029 true 0 pl false PARI/GP 1985 c pascal fortran perl python sagemath 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. 2002 42 146 183 24383128 Université Bordeaux true 231 0 25 https://tio.run/#pari-gp text PARI/GP pari-gp France PARI/GP https://riju.codes/parigp "print(""Hello, world!"")" ? \p 212 realprecision = 221 significant digits (212 digits displayed) ? (1.378-0.09143*I)^(14.87+0.3721*I) time = 0 ms. %1 = 80.817082637557070449383034933010288336925078193546211741027496566803185 11092579265743992920628314516739962724446042667886245322716456966120413965187 3272488827365261487845201056199035423784093096984005713791800191 - 94.8384618 89186304973351271821601500916571303364865064205039706592481303045713982306764 33264430511752515705768858710051382035377195497482934017239179757538824688799 0680136241031895212412150770309289450962931402933*I ? 123456! + 0. time = 1,656 ms. %2 = 2.6040699049291378729513930560926568818273270409503019584610185579952057 37967683415793560716617127908735520017061666000857261271456698589373086528293 4317244121152865814030204645985573419251305342231135573491050756 E574964 ? sin(x) time = 0 ms. %3 = x - 1/6*x^3 + 1/120*x^5 - 1/5040*x^7 + 1/362880*x^9 - 1/39916800*x^11 + 1/6227020800*x^13 - 1/1307674368000*x^15 + O(x^17) ? for(z=25,30, print (factor(2^z-1))) [31, 1; 601, 1; 1801, 1] [3, 1; 2731, 1; 8191, 1] [7, 1; 73, 1; 262657, 1] [3, 1; 5, 1; 29, 1; 43, 1; 113, 1; 127, 1] [233, 1; 1103, 1; 2089, 1] [3, 2; 7, 1; 11, 1; 31, 1; 151, 1; 331, 1] time = 5 ms. ? K = bnfinit(x^2 + 23); K.cyc time = 1ms. %4 = [3] /* This number field has class number 3. */ /* */ true true false https://github.com/jdemeyer/pari_jupyter https://en.wikipedia.org/wiki/PARI/GP 0 0 pari.math.u-bordeaux.fr smallbasic SmallBASIC 2001 17 pl https://smallbasic.github.io 0 v0.12.6 843 0 23 23026 true 0 https://github.com/smallbasic/SmallBASIC pl 2012 2024 2003 10 37 210 33 false 2003 2024 2624 14 620 16 131787 2018 microsoft-small-basic basic qbasic c gw-basic brainfuck linux android SmallBASIC is a BASIC programming language dialect with interpreters released as free software under the GNU General Public License version 2. 2003 15 107 125 320475 https://sourceforge.net/p/smallbasic/_list/tickets visual-basic c cpp tex make xml java html css gradle m4 jsx csv bourne-shell perl lisp php dtd xslt markdown json java-server-pages javascript true 432 0 40 false 0 true Greece https://sourceforge.net/projects/smallbasic/ https://github.com/smallbasic/SmallBASIC https://en.wikipedia.org/wiki/SmallBASIC 0 0 smallbasic.github.io dbase DBase 1979 14 application http://www.dbase.com/ 0 844 2 23023 false 0 application false d/dBase.dbf 1995 1979 c clipper foxpro xbase sql jet-propulsion-laboratory-display-information-system assembly-language shapefile excel-app emacs-editor visual-foxpro "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." 2003 205 163 669 209537 dBase, LLC dbf false 1046 0 14 text United States "? ""Hello World"" " https://twitter.com/dbaseworld "i = 2 myMacro = ""i + 10"" i = &myMacro * comment: i now has the value 12" dBase https://en.wikipedia.org/wiki/DBase 6 0 dbase.com 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 dm DM 1994 24 pl http://www.byond.com/docs/guide/ 0 845 2 23016 true 0 pl 338 394 2108 0 byond c_cpp source.dm programming false 24 2016 2016 1 1 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. 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. BYOND Software 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. dm dmf dm 201 0 29 text 7101 http://www.rosettacode.org/wiki/Category:DM Unknown http://www.byond.com/developer "mob verb smile() world << ""[usr] grins."" giggle() world << ""[usr] giggles."" cry() world << ""[usr] cries \his heart out.""" "// This is a single line comment. /* This is a multi-line comment */ // Pre-processor keywords #define PI 3.1415 #if PI == 4 #define G 5 #elif PI == 3 #define I 6 #else #define K 7 #endif var/GlobalCounter = 0 var/const/CONST_VARIABLE = 2 var/list/MyList = list(""anything"", 1, new /datum/entity) var/list/EmptyList[99] // creates a list of 99 null entries var/list/NullList = null /* Entity Class */ /datum/entity var/name = ""Entity"" var/number = 0 /datum/entity/proc/myFunction() world.log << ""Entity has called myFunction"" /datum/entity/New() number = GlobalCounter++ /* Unit Class, Extends from Entity */ /datum/entity/unit name = ""Unit"" /datum/entity/unit/New() ..() // calls the parent's proc; equal to super() and base() in other languages number = rand(1, 99) /datum/entity/unit/myFunction() world.log << ""Unit has overriden and called myFunction"" // Global Function /proc/ReverseList(var/list/input) var/list/output = list() for(var/i = input.len; i >= 1; i--) // IMPORTANT: List Arrays count from 1. output += input[i] // ""+= x"" is "".Add(x)"" return output // Bitflags /proc/DoStuff() var/bitflag = 0 bitflag |= 8 return bitflag /proc/DoOtherStuff() var/bitflag = 65535 // 16 bits is the maximum amount bitflag &= ~8 return bitflag // Logic /proc/DoNothing() var/pi = PI if(pi == 4) world.log << ""PI is 4"" else if(pi == CONST_VARIABLE) world.log << ""PI is [CONST_VARIABLE]!"" else world.log << ""PI is approximety [pi]"" #undef PI // Undefine PI" // /* */ true true true false 1 0 DM https://github.com/PJB3005/atomic-dreams year|publisher|title|authors|isbn13\n2009|Apress|Pro SpringSource dm Server (Expert's Voice in Open Source)|Mak, Gary and Rubio, Daniel|9781430216407 DM ffmpeg FFmpeg 2000 Fabrice Bellard and Bobby Bingham 11 application https://ffmpeg.org/ 0 v0.6.1 846 0 18 23014 false 0 https://github.com/FFmpeg/FFmpeg application 2011 2024 2000 1438 11912 44064 3 false 2000 2025 145942 2549 9456 442 2152460 c assembly-language make bourne-shell opencl xml cuda perl objective-c markdown cpp css python xsd metal awk ruby html true 82371 0 30 2 false 0 true https://github.com/FFmpeg/FFmpeg https://en.wikipedia.org/wiki/FFmpeg 0 0 lodash Lodash 2009 John-David Dalton 11 library https://lodash.com/ 0 5.0.0 847 0 7 23011 true 0 https://github.com/lodash/lodash library 2012 2024 842 7003 59352 94 false 2009 2024 8432 273 149 50 147009 typescript javascript markdown json yaml bourne-shell toml true 80656 0 18 1 false 5 true https://github.com/lodash/lodash https://en.wikipedia.org/wiki/Lodash 0 0 lpc LPC 1995 Lars Pensjö 21 pl http://lpmuds.net 0 848 2 23011 1409 true 0 pl false Lars Pensjö C 2006 1993 c lisp perl pike java php 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. 2004 47 264 211 904645 Chalmers Datorförening 256 0 22 1 text https://github.com/antlr/grammars-v4/tree/master/lpc Sweden function op = (: return sqrt($1 * $1 + $2 * $2); :); // true true false https://en.wikipedia.org/wiki/LPC_(programming_language) 0 1 https://hopl.info/showlanguage.prx?exp=1409 LPC lpmuds.net 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 mercurial Mercurial 2005 Olivia Mackall and Pierre-Yves David 13 versionControlApplication 0 https://www.mercurial-scm.org/downloads 6.6.3 849 0 23003 false 0 versionControlApplication false Software Freedom Conservancy 2005 python c freebsd linux subversion http rust clisp octave nginx-config 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. 2005 333 228 752 2810009 https://www.mercurial-scm.org/wiki/BugTracker true 1685 0 17 2 6 true text United States https://en.wikipedia.org/wiki/Mercurial 0 0 pogoscript PogoScript 2011 18 pl http://pogoscript.org/ 0 0.10.0 850 1 8 23002 true 0 https://github.com/featurist/pogoscript pl 4 12 51 0 text source.pogoscript programming 2011 2024 2011 14 9 129 21 false 9 2012 2015 1 2 2011 2015 1174 4 272 6 20595 2011 https://github.com/featurist pogo javascript markdown make ruby json diff html yaml true 362 0 26 false 0 true text United Kingdom "httpism = require 'httpism' async = require 'async' resolve = require 'url'.resolve exports.squash (url) ! = html = httpism.get ! (url).body squash html ! (html, url) squash html (html, url, callback) = replacements = sort (links in (html).concat(scripts in (html))) for each @(r) in (replacements) @{ r.url = resolve(url, r.href) } async.map (replacements, get) @(err, requested) callback (err, replace (requested) in (html)) sort (replacements) = replacements.sort @(a, b) @{ a.index - b.index } get (replacement) = replacement.body = httpism.get ! (replacement.url).body replacement replace (replacements) in (html) = i = 0 parts = """" for each @(rep) in (replacements) parts := ""#(parts)#(html.substring(i, rep.index))<#(rep.tag)>#(rep.body)"" i := rep.index + rep.length parts + html.substr(i) links in (html) = link reg = r/]*href=[""']?([^""']+)[""'][^\>]*(\/\>|\>\s*\<\/link\>)/gi elements in (html) matching (link reg) as 'style' scripts in (html) = script reg = r/]*src=[""']?([^""']+)[""'][^\>]*(\/\>|\>\s*\<\/script\>)/gi elements in (html) matching (script reg) as 'script' elements in (html) matching (reg) as (tag) = elements = [] while (m = reg.exec (html)) elements.push { tag = tag, index = m.index, length = m.0.length, href = m.1 } elements " https://twitter.com/pogoscript https://github.com/featurist/pogoscript 0 0 pogoscript.org PogoScript https://github.com/featurist/PogoScript.tmbundle PogoScript pic PIC 1988 Brian Kernighan 18 textMarkup 0 851 1 23001 1007 true 1 pikchr textMarkup 0 0 Roff text troff text/troff source.pic markup false 351 2016 2018 3 3 1988 diagram troff tex linux 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. 2017 1 19 1 8033525 Bell labs pic chem 225 0 19 1 text 2402 United States # Dextroamphetamine molecule .cstart .ps 26 size 28 R1: ring double 1,2 3,4 5,6 bond 60 from R1.V2 bond 120 A1: front bond down ; CH3 bond 60 from A1 ; NH2 .ps .cend # true true false https://en.wikipedia.org/wiki/Pic_(programming_language) 72 0 https://hopl.info/showlanguage.prx?exp=1007 https://github.com/Alhadis/language-roff "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" Pic leveldb LevelDB 2011 Sanjay Ghemawat and Jeff Dean 11 database 0 852 0 6 23000 false 0 https://github.com/google/leveldb database 2014 2024 1312 7851 36694 336 false 2011 2025 449 82 154 2 31291 LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values. LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values. Google LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values. cpp markdown cmake yaml html c true 60350 0 18 2 false https://github.com/google/leveldb https://en.wikipedia.org/wiki/LevelDB 0 0 superjson Superjson 2014 Matthew Mueller 12 dataNotation 0 2.2.1 853 1 6 23000 true 0 https://github.com/blitz-js/superjson dataNotation 2014 2024 2014 10 83 3901 27 false 2014 2024 395 36 35 3 93912 A superset of JSON adding: undefined bigint Date RegExp Set Map Error A superset of JSON adding: undefined bigint Date RegExp Set Map Error A superset of JSON adding: undefined bigint Date RegExp Set Map Error typescript json markdown javascript yaml bourne-shell true 4187 0 19 json 1 false 2 true const object = { normal: 'string', timestamp: new Date(), test: /superjson/, }; const { json, meta } = serialize(object); https://github.com/blitz-js/superjson 0 0 svgbob svgbob 2016 Jovansonlee Cesar 12 textMarkup https://ivanceras.github.io/svgbob-editor/ 0 0.7.2 854 0 6 22997 true 0 https://github.com/ivanceras/svgbob textMarkup 2016 2024 2016 39 107 3801 32 false 2016 2025 623 17 92 4 50290 Svgbob is a diagramming model which uses a set of typing characters to approximate the intended shape. Svgbob is a diagramming model which uses a set of typing characters to approximate the intended shape. Svgbob is a diagramming model which uses a set of typing characters to approximate the intended shape. rust bourne-shell markdown svg toml yaml true 4141 0 18 1 false 0 true true https://github.com/ivanceras/svgbob 0 0 xgboost XGBoost 2014 Tianqi Chen 11 library https://xgboost.readthedocs.io/en/stable/ 0 v2.0.3 855 0 28 22996 true 0 https://github.com/dmlc/xgboost library 2014 2024 912 8688 25893 449 false 2014 2025 8053 716 1370 36 236188 cpp python cuda scala r restructuredtext bourne-shell java markdown yaml cmake dockerfile c csv xml make powershell css svg protobuf json toml m4 tex groovy javascript jupyter-notebook ini true 52695 0 39 1 false 2 true https://github.com/dmlc/xgboost https://en.wikipedia.org/wiki/XGBoost 0 0 bpmn BPMN 2004 12 visual 0 856 0 22992 true 0 visual false Business Process Model and Notation 2005 uml bpel xml yawl 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. 2005 806 715 716 3015586 Business Process Management Initiative && Object Management Group 4050 0 13 https://www.bpmn.org/ text United States https://en.wikipedia.org/wiki/Business_Process_Model_and_Notation 2 16 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 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 rocksdb RocksDB 2011 11 database http://rocksdb.org 0 857 0 21 22991 false 0 https://github.com/facebook/rocksdb database 2012 2024 995 6341 28750 1063 false 2011 2025 15612 1180 2084 225 778904 A library that provides an embeddable, persistent key-value store for fast storage. A library that provides an embeddable, persistent key-value store for fast storage. Facebook A library that provides an embeddable, persistent key-value store for fast storage. cpp java markdown html bourne-shell python yaml cmake scss ini make svg xml json c bash perl dockerfile assembly-language powershell protobuf true 48975 0 32 false https://github.com/facebook/rocksdb https://en.wikipedia.org/wiki/RocksDB 0 0 abs abs 2018 Alessandro Nadalin 15 pl https://www.abs-lang.org 0 2.6.0 858 1 12 22991 true 0 https://github.com/abs-lang/abs pl 2018 2024 14 35 512 59 false 2018 2023 851 21 297 34 111135 2018 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. 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. 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. javascript markdown html go bourne-shell json yaml stylus make dockerfile svg css true 640 0 27 1 false 2 true United Arab Emirates "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); if !r.ok { echo(""Could not fetch game data. Bummer!"") exit(1) } doc = r.json() arena = doc.basicGameData.arena.name city = doc.basicGameData.arena.city echo(""The game was played at the %s in %s"", arena, city) highlight = doc.basicGameData.nugget.text if highlight.len() { echo(""The press said: \""%s\"""", highlight) } # The game was played at the TD Garden in Boston # The press said: ""Thomas scores 19 of 44 points in 4th quarter""" https://github.com/abs-lang/abs 0 0 abs-lang.org 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 imhex ImHex 2020 11 editor https://imhex.werwolv.net/ 0 859 0 18 22989 false 0 https://github.com/WerWolv/ImHex editor 2020 2024 475 1825 41800 273 false 2020 2025 5410 176 981 42 475942 A Hex Editor for Reverse Engineers, Programmers and people who value their retinas when working at 3 AM A Hex Editor for Reverse Engineers, Programmers and people who value their retinas when working at 3 AM A Hex Editor for Reverse Engineers, Programmers and people who value their retinas when working at 3 AM cpp json cmake markdown yaml svg csharp xml glsl dockerfile bourne-shell python c javascript css objective-c html diff true 47453 0 29 false https://imhex.werwolv.net/docs/ https://imhex.werwolv.net/discord https://github.com/WerWolv/ImHex 0 0 joy Joy 2001 Manfred von Thun 16 pl 0 860 1 22988 2137 true 3 apter-f ck xy pl false 2001 scheme fp factor forth unlambda c symbol 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. 2003 48 52 130 696166 La Trobe University 260 0 16 1 https://tio.run/#joy text 4281 http://www.rosettacode.org/wiki/Category:Joy Australia DEFINE qsort == [small] [] [uncons [>] split] [enconcat] binrec. true false https://en.wikipedia.org/wiki/Joy_(programming_language) 4 0 https://hopl.info/showlanguage.prx?exp=2137 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 rdfa RDFa 2004 11 xmlFormat http://rdfa.info/ 0 861 1 22986 true 1 notation3 xmlFormat false 2006 2004 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. 1419 212 4321818 W3C 7116 0 12 json-ld United States "
Wikinomics Don Tapscott 2006-10-01
" https://en.wikipedia.org/wiki/RDFa 0 0 rdfa.info beanshell BeanShell 1999 21 pl http://www.beanshell.org/ 0 862 2 22985 true 0 pl false b/Beanshell.bsh 1999 1999 java jvm javascript perl 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. 2005 44 120 118 1565435 Java Community Process bsh true 241 0 23 https://tio.run/#beanshell text Various "print (""Hello World""); " https://riju.codes/beanshell "print(""Hello, world!""); " Beanshell print """" true true https://en.wikipedia.org/wiki/BeanShell 3 0 beanshell.org 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 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 cwerg Cwerg 2019 Robert Muth 16 pl 0 863 1 12 22983 true 0 https://github.com/robertmuth/Cwerg pl 2019 2024 15 12 436 20 false 2019 2025 2773 3 656 27 1828293 The best C-like language that can be implemented in 10kLOC. The best C-like language that can be implemented in 10kLOC. The best C-like language that can be implemented in 10kLOC. python cpp assembly-language c markdown make wasm yaml javascript svg cmake bourne-shell true 476 0 29 1 false "module: import fmt fun main(argc s32, argv ^^u8) s32: fmt::print#(""hello world\n"") return 0" https://github.com/robertmuth/Cwerg -- true true true true true 0 0 miranda Miranda 1985 David Turner 19 pl https://www.cs.kent.ac.uk/people/staff/dat/miranda/ 0 864 3 22980 911 true 0 pl false m/Miranda.m 1985 krc ml hope clean haskell c unix iswim occam python pascal 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. 2002 56 47 140 93267 Research Software Ltd m m 300 0 21 1 text United Kingdom "main :: [sys_message] main = [Stdout ""Hello World""] " https://riju.codes/miranda "main = [Stdout ""Hello, world!""] " > || The infinite list of all prime numbers. The list of potential prime numbers starts as all integers from 2 onwards; as each prime is returned, all the following numbers that can exactly be divided by it are filtered out of the list of candidates. > primes = sieve [2..] > sieve (p:x) = p : sieve [n | n <- x; n mod p ~= 0] Miranda https://www.cs.kent.ac.uk/people/staff/dat/miranda/downloads/ Stdout """" true true true https://en.wikipedia.org/wiki/Miranda_(programming_language) 2 7 https://hopl.info/showlanguage.prx?exp=911 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 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 ld-json JSON Lines 2013 Ian Ward 20 dataNotation http://jsonlines.org/ 0 865 1 5 22979 true 0 https://github.com/wardi/jsonlines dataNotation 2013 2024 2013 7 32 127 19 false newline-delimited JSON 2013 2024 124 34 22 1 1111 2013 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. 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. https://github.com/wardi/jsonlines/issues 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. ldj jsonl css html javascript markdown json true 259 0 30 json 1 false Canada https://en.wikipedia.org/wiki/JSON_streaming "[""Name"", ""Session"", ""Score"", ""Completed""] [""Gilbert"", ""2013"", 24, true] [""Alexa"", ""2013"", 29, true] [""May"", ""2012B"", 14, false] [""Deloise"", ""2012A"", 19, true]" https://github.com/wardi/jsonlines true false true 0 0 jsonlines.org mathpix-markdown Mathpix Markdown 2019 15 textMarkup 0 1.3.7 866 1 9 22978 true 0 https://github.com/Mathpix/mathpix-markdown-it textMarkup 2019 2024 16 42 471 53 false 2019 2025 1133 10 1009 230 442443 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. 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. https://github.com/Mathpix 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. typescript javascript markdown json jsx css html yaml ejs true 608 0 25 markdown false 1 true https://mathpix.com/docs/mathpix-markdown/syntax-reference United States https://mathpix.com/markdown-to-latex Compute $f(x) = x^2 + 2$ if $x=2$. https://github.com/Mathpix/mathpix-markdown-it 0 0 maxscript MAXScript 1996 23 pl http://docs.autodesk.com/3DSMAX/14/ENU/MAXScript%20Help%202012/ 0 867 2 22976 true 0 pl 321 333 2084 0 text source.maxscript programming false m/MaxScript.ms 46 2015 2018 5 1 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. 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. Autodesk 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. ms mcr ms 201 0 25 text http://www.rosettacode.org/wiki/Category:MAXScript United States https://dl.acm.org/citation.cfm?id=522752 "print ""Hello World"" -- ""Hello World"" -- Note that MAXScript is expression-based, so simply writing ""Hello World"" is -- sufficient to echo it for the reader. Like Haskell, all MAXScript expressions -- *must* return values, even if they're unused. " fn CalculateVolumeAndCentreOfMass obj = ( local Volume= 0.0 local Centre= [0.0, 0.0, 0.0] local theMesh = snapshotasmesh obj local numFaces = theMesh.numfaces for i = 1 to numFaces do ( local Face= getFace theMesh i local vert2 = getVert theMesh Face.z local vert1 = getVert theMesh Face.y local vert0 = getVert theMesh Face.x local dV = Dot (Cross (vert1 - vert0) (vert2 - vert0)) vert0 Volume+= dV Centre+= (vert0 + vert1 + vert2) * dV ) delete theMesh Volume /= 6 Centre /= 24 Centre /= Volume #(Volume,Centre) ) MaxScript print """" true true false true 3 0 MAXScript MAXScript https://github.com/Alhadis/language-maxscript 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 MAXScript gluon gluon 2014 12 pl https://gluon-lang.org 0 1.0.37 868 0 7 22969 true 0 https://github.com/gluon-lang/gluon pl 2015 2024 2014 60 145 3168 163 false 2014 2024 3973 65 365 14 106384 2018 https://github.com/gluon-lang/ rust markdown toml bourne-shell yaml html css true 3670 0 19 false 1 true Australia and Sweden https://github.com/gluon-lang/gluon 0 0 gluon-lang.org netlinx NetLinx 2007 19 pl 0 869 1 22968 true 0 pl 21 25 122 0 text source.netlinx programming false 115 2013 2018 2 2 2007 c ascii 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. 2007 14 2 20 9870556 AMX, LLC axserb axierb axs axi 290 0 24 text United States https://www.amx.com/en/site_elements/language-reference-guide-netlinx-programming-language "(*********************************************************** Mock Projector For testing syntax highlighting ************************************************************) #if_not_defined MOCK_PROJECTOR #define MOCK_PROJECTOR 1 (***********************************************************) (* System Type : NetLinx *) (***********************************************************) (* DEVICE NUMBER DEFINITIONS GO BELOW *) (***********************************************************) DEFINE_DEVICE dvPROJECTOR = 5001:1:0; (***********************************************************) (* CONSTANT DEFINITIONS GO BELOW *) (***********************************************************) DEFINE_CONSTANT // Power States POWER_STATE_ON = 0; POWER_STATE_OFF = 1; POWER_STATE_WARMING = 2; POWER_STATE_COOLING = 3; // Inputs INPUT_HDMI = 0; INPUT_VGA = 1; INPUT_COMPOSITE = 2; INPUT_SVIDEO = 3; (***********************************************************) (* INCLUDES GO BELOW *) (***********************************************************) #include 'amx-lib-log' (***********************************************************) (* DATA TYPE DEFINITIONS GO BELOW *) (***********************************************************) DEFINE_TYPE struct projector_t { integer power_state; integer input; integer lamp_hours; } (***********************************************************) (* VARIABLE DEFINITIONS GO BELOW *) (***********************************************************) DEFINE_VARIABLE volatile projector_t proj_1; (***********************************************************) (* SUBROUTINE/FUNCTION DEFINITIONS GO BELOW *) (***********************************************************) define_function initialize(projector_t self) { self.power_state = POWER_STATE_OFF; self.input = INPUT_HDMI; self.lamp_hours = 0; } define_function switch_input(projector_t self, integer input) { self.input = input; print(LOG_LEVEL_INFO, ""'Projector set to input: ', itoa(input)""); } (***********************************************************) (* STARTUP CODE GOES BELOW *) (***********************************************************) DEFINE_START initialize(proj_1); (***********************************************************) (* THE EVENTS GO BELOW *) (***********************************************************) DEFINE_EVENT data_event[dvPROJECTOR] { string: { parse_message(data.text); } command: {} online: {} offline: {} } button_event[dvTP, BTN_HDMI] button_event[dvTP, BTN_VGA] button_event[dvTP, BTN_COMPOSITE] button_event[dvTP, BTN_SVIDEO] { push: { switch (button.input.channel) { case BTN_HDMI: switch_input(proj_1, INPUT_HDMI); case BTN_VGA: switch_input(proj_1, INPUT_VGA); case BTN_COMPOSITE: switch_input(proj_1, INPUT_COMPOSITE); case BTN_SVIDEO: switch_input(proj_1, INPUT_SVIDEO); } } release: {} } (***********************************************************) (* THE MAINLINE GOES BELOW *) (***********************************************************) DEFINE_PROGRAM [dvTP, BTN_POWER_ON] = (proj_1.power_state == POWER_STATE_ON); [dvTP, BTN_POWER_OFF] = (proj_1.power_state == POWER_STATE_OFF); (***********************************************************) (* END OF PROGRAM *) (* DO NOT PUT ANY CODE BELOW THIS COMMENT *) (***********************************************************) #end_if " // (* *) true true true false https://en.wikipedia.org/wiki/NetLinx 0 0 NetLinx https://github.com/amclain/sublime-netlinx NetLinx nu Nu 2007 Tim Burks 19 pl lisp 0 870 3 22968 true 0 pl 331 375 Nukefile 215 0 nush nush scheme scheme text/x-scheme source.nu programming false n/Nu.nu 107 2008 2017 2 7 2007 x86-isa lisp objective-c ruby linux f-script 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. 2008 14 13 55 17151577 https://github.com/programming-nu nu nu true 290 0 21 1 text 7528 United States and Germany "(puts ""Hello World"") " "#!/usr/bin/env nush (puts ""Hello"") " "(unless @prefix (set @prefix ""#{((((NSProcessInfo processInfo) arguments) 0) dirName)}.."")) (unless @icon_files (set @icon_files (array ""#{@prefix}/share/nu/resources/nu.icns"")))" Nu puts """" true true https://en.wikipedia.org/wiki/Nu_(programming_language) 0 0 Nu https://github.com/jsallis/nu.tmbundle Nu asciimath AsciiMath 2014 Peter Krautzberger 13 textMarkup http://asciimath.org/ 0 871 1 4 22965 true 0 https://github.com/mathjax/asciimathml textMarkup 2014 2024 2014 39 183 956 54 false 2014 2021 166 16 29 1 9665 AsciiMath is an easy-to-write markup language for mathematics. AsciiMath is an easy-to-write markup language for mathematics. AsciiMath is an easy-to-write markup language for mathematics. html javascript markdown php true 1523 0 18 latex 1 false sum_(i=1)^n i^3=((n(n+1))/2)^2 https://github.com/mathjax/asciimathml 0 0 asciimath.org hyphy HyPhy 2008 16 pl http://hyphy.org/w/index.php/HyPhy_Batch_Language 0 2.5.61 872 1 11 22965 true 0 https://github.com/veg/hyphy pl 69 73 113 0 text none programming 2011 2024 2008 22 68 201 10 false 2008 2025 4033 56 916 60 484389 University of California San Diego && North Carolina State University bf cpp brainfuck yaml c cmake markdown bourne-shell python xml opencl javascript true 463 0 28 false 2 true text United States "#profile START;s = 0;m = {5,1};for (k=0; k<250000; k=k+1){ s = s + k; t = Random (0,5); m [t] = m [t] + 1;}#profile PAUSE;s2 = 0;for (k=1; k<10000; k=k+1){ s2 = s2+1/k;}#profile _hyphy_profile_dump;stats = _hyphy_profile_dump[""STATS""];_profile_summer = {1,Rows(stats)};_profile_summer = _profile_summer[""1""] * stats;_instructions = _hyphy_profile_dump[""INSTRUCTION""];_indices = _hyphy_profile_dump[""INSTRUCTION INDEX""];fprintf (stdout, ""\nTotal run time (seconds) : "", Format(_profile_summer[1]/1000000,15,6), ""\nTotal number of steps : "", Format(_profile_summer[0],15,0), ""\n\n""); for (k=0; k ( evt.type :: { 'error' -> log('Error: ' + evt.message) 'req' -> (evt.end)({ status: 200 headers: {'Content-Type': 'text/plain'} body: 'Hello, World!' }) } )) https://twitter.com/thesephist https://github.com/thesephist/ink 0 0 dotink.co simulink Simulink 1984 13 pl https://www.mathworks.com/products/simulink.html?s_cid=wiki_simulink_2 0 874 0 22963 true 0 pl false 2017 linux matlab c vhdl verilog modelica labview 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. 2004 299 133 300 562695 MathWorks false 1516 0 13 text https://en.wikipedia.org/wiki/Simulink 19 13 Simulink 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 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 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 metalang99 Metalang99 2021 hirrolot 14 pl https://metalang99.readthedocs.io/en/latest/ 0 v1.13.3 875 0 9 22963 true 0 https://github.com/hirrolot/metalang99 pl 2020 2024 2020 18 24 840 2 false 2020 2024 1693 4 119 14 16564 Metalang99: A functional language for C99 preprocessor metaprogramming Metalang99: A functional language for C99 preprocessor metaprogramming https://github.com/hirrolot/metalang99/issues Metalang99: A functional language for C99 preprocessor metaprogramming c restructuredtext bourne-shell markdown cmake tex yaml python make true 918 0 23 1 false 1 true Kazakhstan https://reddit.com/r/ProgrammingLanguages/comments/lswnya/metalang99_a_functional_language_for_c99/ https://github.com/hirrolot/metalang99 0 0 hobbes hobbes 2017 Kalani Thielen 13 pl http://hobbes.readthedocs.io/ 0 876 0 14 22957 true 0 https://github.com/Morgan-Stanley/hobbes pl 2017 2024 2017 56 104 1161 46 false 2017 2024 540 31 308 5 101692 https://github.com/morganstanley cpp restructuredtext markdown nix bourne-shell python yaml cmake yacc lex make vim-script diff dockerfile true 1506 0 27 1 false United States http://lists.llvm.org/pipermail/llvm-dev/2017-June/114307.htmlreference https://github.com/Morgan-Stanley/hobbes 0 0 hobbes.readthedocs.io basis-universal-format Basis Codec 2019 12 binaryDataFormat 0 1.16.4 877 0 12 22953 false 0 https://github.com/binomialLLC/basis_universal binaryDataFormat 2019 2024 2019 55 257 2625 117 false 2019 2025 850 48 290 251 445177 Basis Universal GPU Texture and Texture Video Compression Reference Codec Basis Universal GPU Texture and Texture Video Compression Reference Codec BinomialLLC Basis Universal GPU Texture and Texture Video Compression Reference Codec basis cpp javascript markdown html bourne-shell xml cmake c json opencl python yaml true 3445 0 25 false 1 true Unknown https://github.com/binomialLLC/basis_universal 0 0 flatbuffers FlatBuffers 2014 13 idl https://google.github.io/flatbuffers/ 0 24.3.25 878 0 31 22953 true 2 everparse3d flexbuffers https://github.com/google/flatbuffers idl false 2014 2025 3316 737 1860 23 304491 Google typescript rust java python javascript cpp csharp swift kotlin markdown go lua php nim bourne-shell json dart yaml dockerfile starlark cmake xml gradle toml bazel protobuf html diff css ruby make true 739 0 45 false 24 true fbs https://github.com/antlr/grammars-v4/tree/master/flatbuffers https://github.com/google/flatbuffers 0 0 surrealdb SurrealDB 2016 Tobie Morgan Hitchcock 11 queryLanguage https://surrealdb.com/ 0 879 1 11 22951 true 0 https://github.com/surrealdb/surrealdb queryLanguage 2021 2024 156 922 28116 679 false 2016 2025 4199 152 1551 33 303275 SurrealDB is an end-to-end cloud-native database designed for modern applications, including web, mobile, serverless, Jamstack, backend, and traditional applications. With SurrealDB, you can simplify your database and API infrastructure, reduce development time, and build secure, performant apps quickly and cost-effectively. SurrealDB is an end-to-end cloud-native database designed for modern applications, including web, mobile, serverless, Jamstack, backend, and traditional applications. With SurrealDB, you can simplify your database and API infrastructure, reduce development time, and build secure, performant apps quickly and cost-effectively. SurrealDB is an end-to-end cloud-native database designed for modern applications, including web, mobile, serverless, Jamstack, backend, and traditional applications. With SurrealDB, you can simplify your database and API infrastructure, reduce development time, and build secure, performant apps quickly and cost-effectively. rust svg yaml markdown toml nix bourne-shell make dockerfile d ini true 31036 0 22 1 false "UPDATE person SET waist = ""34"", height = 201, score = 0.3 + 0.3 + 0.3 + 0.1 ;" https://github.com/surrealdb/surrealdb 0 0 kdl KDL 2020 13 pl https://kdl.dev https://github.com/kdl-org/kdl/blob/main/SPEC.md 0 880 1 6 22950 true 0 https://github.com/kdl-org/kdl pl 2020 2025 27 65 1231 24 false 2020 2025 359 55 596 2 4637 https://kdl.dev/play/ KDL is a small, pleasant document language with XML-like node semantics that looks like you're invoking a bunch of CLI commands! It's meant to be used both as a serialization format and a configuration language, much like JSON, YAML, or XML. KDL is a small, pleasant document language with XML-like node semantics that looks like you're invoking a bunch of CLI commands! It's meant to be used both as a serialization format and a configuration language, much like JSON, YAML, or XML. KDL is a small, pleasant document language with XML-like node semantics that looks like you're invoking a bunch of CLI commands! It's meant to be used both as a serialization format and a configuration language, much like JSON, YAML, or XML. markdown svg yaml python json xml true 1483 0 20 sdlang false "package { name my-pkg version ""1.2.3"" dependencies { // Nodes can have standalone values as well as // key/value pairs. lodash ""^3.2.1"" optional=#true alias=underscore } scripts { // ""Raw"" and dedented multi-line strings are supported. message """""" hello world """""" build #"""""" echo ""foo"" node -c ""console.log('hello, world!');"" echo ""foo"" > some-file.txt """"""# } // `\` breaks up a single node across multiple lines. the-matrix 1 2 3 \ 4 5 6 \ 7 8 9 // ""Slashdash"" comments operate at the node level, // with just `/-`. /-this-is-commented { this entire node { is gone } } }" https://github.com/kdl-org/kdl 0 0 google-cloud Google Cloud Platform 2011 12 cloud https://cloud.google.com/ 0 881 0 22949 false 0 cloud false 82693 157 2011 java python go ruby aws azure Google Cloud Platform, offered by Google, is a suite of cloud computing services that runs on the same infrastructure that Google uses internally for its end-user products, such as Google Search and YouTube. Alongside a set of management tools, it provides a series of modular cloud services including computing, data storage, data analytics and machine learning.. Registration requires a credit card or bank account details. 2014 665 669 195 42411494 Google false 3346 0 12 text United States https://www.meetup.com/topics/google-cloud-platform https://en.wikipedia.org/wiki/Google_Cloud_Platform 0 0 cloud.google.com redcode Redcode 1984 15 pl 0 882 1 22949 true 0 pl 104 109 36 0 text none programming false esoteric.py 1984 assembly-language "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." 2003 111 52 377 274362 BBN cw cw 575 0 15 text https://github.com/antlr/grammars-v4/tree/master/redcode United States Redcode 0000: ADD.AB # 4, $ 3 0001: MOV.F $ 2, @ 2 0002: JMP.B $ -2, $ 0 0003: DAT.F # 0, # 0 true true true https://en.wikipedia.org/wiki/Core_War 0 0 Redcode Redcode eclipse-command-language Eclipse Command Language 2008 23 pl 0 883 1 22949 true 0 pl 24 24 0 0 prolog prolog source.prolog.eclipse programming false 63 2012 2018 1 10 ecl Eclipse Foundation ecl 200 0 171 text ecl Canada https://www.eclipse.org/rcptt/documentation/userguide/ecl/ :- lib(ic). /** * Question 1.11 * vabs(?Val, ?AbsVal) */ vabs(Val, AbsVal):- AbsVal #> 0, ( Val #= AbsVal ; Val #= -AbsVal ), labeling([Val, AbsVal]). /** * vabsIC(?Val, ?AbsVal) */ vabsIC(Val, AbsVal):- AbsVal #> 0, Val #= AbsVal or Val #= -AbsVal, labeling([Val, AbsVal]). /** * Question 1.12 */ % X #:: -10..10, vabs(X, Y). % X #:: -10..10, vabsIC(X, Y). /** * Question 1.13 * faitListe(?ListVar, ?Taille, +Min, +Max) */ faitListe([], 0, _, _):-!. faitListe([First|Rest], Taille, Min, Max):- First #:: Min..Max, Taille1 #= Taille - 1, faitListe(Rest, Taille1, Min, Max). /** * Question 1.14 * suite(?ListVar) */ suite([Xi, Xi1, Xi2]):- checkRelation(Xi, Xi1, Xi2). suite([Xi, Xi1, Xi2|Rest]):- checkRelation(Xi, Xi1, Xi2), suite([Xi1, Xi2|Rest]). /** * checkRelation(?Xi, ?Xi1, ?Xi2) */ checkRelation(Xi, Xi1, Xi2):- vabs(Xi1, VabsXi1), Xi2 #= VabsXi1 - Xi. /** * Question 1.15 * checkPeriode(+ListVar). */ % TODO Any better solution? checkPeriode(ListVar):- length(ListVar, Length), Length < 10. checkPeriode([X1, X2, X3, X4, X5, X6, X7, X8, X9, X10|Rest]):- X1 =:= X10, checkPeriode([X2, X3, X4, X5, X6, X7, X8, X9, X10|Rest]). % faitListe(ListVar, 18, -9, 9), suite(ListVar), checkPeriode(ListVar). => 99 solutions /** * Tests */ /* vabs(5, 5). => Yes vabs(5, -5). => No vabs(-5, 5). => Yes vabs(X, 5). vabs(X, AbsX). vabsIC(5, 5). => Yes vabsIC(5, -5). => No vabsIC(-5, 5). => Yes vabsIC(X, 5). vabsIC(X, AbsX). faitListe(ListVar, 5, 1, 3). => 243 solutions faitListe([_, _, _, _, _], Taille, 1, 3). => Taille = 5 !!!!!!!!!!!!!!!! faitListe(ListVar, 18, -9, 9), suite(ListVar). => 99 solutions */ __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 % /* */ true true true true true false true 0 0 Ecl https://github.com/alnkpa/sublimeprolog ECLiPSe mdq mdq 2024 Yuval Shavit 13 queryLanguage 0 884 1 7 22946 true 0 https://github.com/yshavit/mdq queryLanguage 2024 2025 8 13 1419 16 false Markdown Query 2024 2025 156 5 71 1 15040 Provide an easy way to zero in on specific parts of a Markdown document. Provide an easy way to zero in on specific parts of a Markdown document. Provide an easy way to zero in on specific parts of a Markdown document. rust toml yaml bash markdown dockerfile bourne-shell true 1464 0 22 markdown jq 1 false cat example.md | mdq '# usage | -' https://github.com/yshavit/mdq 0 0 pie-lang pie-lang 2018 David Christiansen 14 pl lisp http://thelittletyper.com/ 0 885 0 3 22946 true 0 https://github.com/the-little-typer/pie pl 2018 2024 2018 34 57 685 6 false 2018 2021 57 7 31 1 8813 2017 Pie: A Little Language with Dependent Types. Pie is a Racket language, requiring Racket version 6.5 or newer. Pie: A Little Language with Dependent Types. Pie is a Racket language, requiring Racket version 6.5 or newer. https://github.com/the-little-typer Pie: A Little Language with Dependent Types. Pie is a Racket language, requiring Racket version 6.5 or newer. racket yaml markdown true 865 0 17 1 false Denmark https://github.com/the-little-typer/pie 0 0 thelittletyper.com csv CSV 1972 13 dataNotation 130 886 2 22944 true 134 acsv apache-hbase arkscript arquero arrow-format atomspace ballerina berkeleydb blz capybara checked-c chevrotain cir circle-lang cloc codeql coq cperl crush csvpp csvw d3 dat-protocol dexvis dplyr drupal dynamo-visual-language ecsharp edgedb eiffel enso esoteric-reaction eyg f-prime factor fardlang flowchart-fun flutter fstar gap ggplot2 go goal gradle graph-it gura hedy hhvm htmx huwcode idyll impala java jeeves jekyll kgl ko kotlin ktyek kubernetes kumir linux logica luna mastodon mathics matplotlib megaparsec mermaid michelson micropython minidsdb mongodb moya multiaddr multibase multicodec ncl nestedtext netlogo nextflow nim nimskull nodejs nushell observable-framework observable-plot obsidian-lang ohayo olc open-nn openverse pact pandas partiql php pipelines plang postgresql powershell praat-script prql pyret-lang pyret pytorch r3 rakudo ramen rascal red rmarkdown rosie roslyn-compiler ruby rye scallop scikit-learn scroll scroll setlx smallbasic spatial statsplorer swi-prolog tao3d tensorflow tornado typecobol vega visdown xgboost-model xgboost xtext yang dataNotation 9 0 text none data false comma-separated values 1972 tsv ascii unicode utf-8 fortran html xml excel-app unix emacs-editor awk "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." 2004 56 1438 1207 501906 csv csv true 300 0 15 csv text https://github.com/antlr/grammars-v4/tree/master/csv Year,Make,Model,Length 1997,Ford,E350,2.34 2000,Mercury,Cougar,2.38 Year;Make;Model;Length 1997;Ford;E350;2,34 2000;Mercury;Cougar;2,38 https://en.wikipedia.org/wiki/Comma-separated_values 0 0 CSV rant rant 2014 12 pl http://berkin.me/rant 0 v3.0.0 887 0 9 22941 true 0 https://github.com/TheBerkin/Rant pl 2014 2024 2014 81 106 2964 9 false 2014 2020 991 15 363 5 154221 https://github.com/TheBerkin/rant3/pulls csharp markdown html javascript xml yaml css svg json true 3299 0 21 false 3 true United States https://github.com/TheBerkin/Rant 0 0 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 jasmin Jasmin 1997 22 pl http://jasmin.sourceforge.net/ 0 888 3 22940 true 0 pl 194 204 74 0 java source.jasmin programming false j/Jasmin.j 12 2014 2014 8 3 jvm.py 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. 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. https://jasmin.sourceforge.net/ 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. j j j 201 0 24 text United States ".class public Jasmin .super java/lang/Object .method public static main([Ljava/lang/String;)V .limit stack 2 getstatic java/lang/System/out Ljava/io/PrintStream; ldc ""Hello World"" invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V return .end method " .class public op2 .super java/lang/Object ; ; standard initializer (calls java.lang.Object's initializer) ; .method public ()V aload_0 invokenonvirtual java/lang/Object/()V return .end method .method public static main([Ljava/lang/String;)V .limit locals 1 .limit stack 5 BeginGlobal: .line 2 getstatic java/lang/System/out Ljava/io/PrintStream; ldc 0x1 ldc 0x0 iand invokevirtual java/io/PrintStream/println(Z)V .line 3 getstatic java/lang/System/out Ljava/io/PrintStream; ldc 0x1 ldc 0x0 ior invokevirtual java/io/PrintStream/println(Z)V EndGlobal: return .end method Jasmin https://riju.codes/jasmin ".class public Main .super java/lang/Object .method public ()V aload_0 invokenonvirtual java/lang/Object/()V return .end method .method public static main([Ljava/lang/String;)V .limit stack 2 getstatic java/lang/System/out Ljava/io/PrintStream; ldc ""Hello, world!"" invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V return .end method " Jasmin ; """" true true false true 0 0 jasmin.sourceforge.net Jasmin https://github.com/atmarksharp/jasmin-sublime Jasmin cranelift-ir Cranelift 2016 Jakob Olesen 12 ir https://cranelift.readthedocs.io/en/latest/ir.html 0 v0.59.0 889 0 1 22937 true 0 https://github.com/CraneStation/cranelift ir 2016 2024 2016 93 203 2482 0 false 2016 2020 3172 139 1 11 4 https://github.com/CraneStation/ markdown true 3232 0 13 1 false 0 true Various https://github.com/CraneStation/cranelift 0 0 floscript FloScript 2013 Samuel Smith 19 pl 0 v2.0.2 890 0 2 22936 true 0 https://github.com/ioflo/ioflo pl 2013 2024 2013 19 34 153 0 false floscript.py 2013 2024 1233 14 221 9 53599 ProSapien LLC flo python markdown true 270 0 21 1 false 2 true United States FloScript https://github.com/ioflo/ioflo true true true true true true true 0 0 koto Koto 2020 Ian Hobson 14 pl https://koto.dev 0 891 1 9 22933 true 0 https://github.com/koto-lang/koto pl 2020 2025 15 34 723 7 false 2020 2025 2527 15 246 7 64387 https://koto.dev/play-0.15 A lightweight scripting language for Rust applications. A lightweight scripting language for Rust applications. A lightweight scripting language for Rust applications. rust markdown toml yaml javascript json css html svg true 842 0 23 1 false https://koto.dev/docs/next # Fizz buzz in Koto # https://en.wikipedia.org/wiki/Fizz_buzz fizz_buzz = |n| match n % 3, n % 5 0, 0 then 'Fizz Buzz' 0, _ then 'Fizz' _, 0 then 'Buzz' else '{n}' for i in 1..=25 print fizz_buzz i https://discord.gg/JeV8RuK4CT https://github.com/koto-lang/koto 0 0 jison-lex Jison Lex 2013 Zachary Carter 17 pl 0 0.3.4 892 1 4 22933 true 0 https://github.com/zaach/jison-lex pl 0 0 Lex text source.jisonlex programming 2013 2023 2013 7 32 57 20 false 131 2014 2018 2 9 2013 2014 33 6 8 1 1899 https://github.com/zaach/jison-lex/issues jisonlex javascript lex json markdown true 360 0 23 1 false 0 true text United States and The Netherlands and Germany " %% \n+ {yy.freshLine = true;} \s+ {yy.freshLine = false;} ""y{""[^}]*""}"" {yytext = yytext.substr(2, yyleng - 3); return 'ACTION';} [a-zA-Z_][a-zA-Z0-9_-]* {return 'NAME';} '""'([^""]|'\""')*'""' {return 'STRING_LIT';} ""'""([^']|""\'"")*""'"" {return 'STRING_LIT';} ""|"" {return '|';} ""[""(""\]""|[^\]])*""]"" {return 'ANY_GROUP_REGEX';} ""("" {return '(';} "")"" {return ')';} ""+"" {return '+';} ""*"" {return '*';} ""?"" {return '?';} ""^"" {return '^';} ""/"" {return '/';} ""\\""[a-zA-Z0] {return 'ESCAPE_CHAR';} ""$"" {return '$';} ""<>"" {return '$';} ""."" {return '.';} ""%%"" {return '%%';} ""{""\d+("",""\s?\d+|"","")?""}"" {return 'RANGE_REGEX';} /""{"" %{if (yy.freshLine) { this.input('{'); return '{'; } else { this.unput('y'); }%} ""}"" %{return '}';%} ""%{""(.|\n)*?""}%"" {yytext = yytext.substr(2, yyleng - 4); return 'ACTION';} . {/* ignore bad characters */} <> {return 'EOF';}" https://github.com/zaach/jison-lex true false true 0 0 https://github.com/cdibbs/language-jison Jison Lex ldpl ldpl 2019 Martín del Río 19 pl https://www.ldpl-lang.org 0 3.0.5 893 1 8 22930 true 0 https://github.com/Lartu/ldpl pl 2019 2024 2019 13 24 156 13 false 2019 2024 993 38 76 14 14497 https://github.com/Lartu/ldpl/issues markdown cpp yaml bourne-shell php make cmake dockerfile true 268 0 28 1 false 3 true Unknown "# Hello There Example data: name is number procedure: display ""Hello there, what's your name?"" accept name display ""你好, "" name ""!"" crlf" https://github.com/Lartu/ldpl # true true false 0 0 ldpl-lang.org 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 oberon-2 Oberon-2 1991 Niklaus Wirth and Hanspeter Mössenböck 20 pl 0 894 2 22928 1647 true 1 component-pascal pl false o/Oberon 2.obn 1991 oberon modula-2 pascal go object-oberon smalltalk python java algol yacc javascript powerpc "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." 2004 29 64 449019 Eidgenössische Technische Hochschule Zürich 165 0 24 oberon 2 http://www.rosettacode.org/wiki/Category:Oberon-2 Switzerland https://dl.acm.org/doi/pdf/10.1145/157352.157355 "MODULE HelloWorld; IMPORT Out; BEGIN Out.String( ""Hello World"" ); Out.Ln; END HelloWorld." "Module = MODULE ident "";"" [ImportList] DeclSeq [BEGIN StatementSeq] END ident ""."". ImportList = IMPORT [ident "":=""] ident {"","" [ident "":=""] ident} "";"". DeclSeq = { CONST {ConstDecl "";"" } | TYPE {TypeDecl "";""} | VAR {VarDecl "";""}} {ProcDecl "";"" | ForwardDecl "";""}. ConstDecl = IdentDef ""="" ConstExpr. TypeDecl = IdentDef ""="" Type. VarDecl = IdentList "":"" Type. ProcDecl = PROCEDURE [Receiver] IdentDef [FormalPars] "";"" DeclSeq [BEGIN StatementSeq] END ident. ForwardDecl = PROCEDURE ""^"" [Receiver] IdentDef [FormalPars]. FormalPars = ""("" [FPSection {"";"" FPSection}] "")"" ["":"" Qualident]. FPSection = [VAR] ident {"","" ident} "":"" Type. Receiver = ""("" [VAR] ident "":"" ident "")"". Type = Qualident | ARRAY [ConstExpr {"","" ConstExpr}] OF Type | RECORD [""(""Qualident"")""] FieldList {"";"" FieldList} END | POINTER TO Type | PROCEDURE [FormalPars]. FieldList = [IdentList "":"" Type]. StatementSeq = Statement {"";"" Statement}. Statement = [ Designator "":="" Expr | Designator [""("" [ExprList] "")""] | IF Expr THEN StatementSeq {ELSIF Expr THEN StatementSeq} [ELSE StatementSeq] END | CASE Expr OF Case {""|"" Case} [ELSE StatementSeq] END | WHILE Expr DO StatementSeq END | REPEAT StatementSeq UNTIL Expr | FOR ident "":="" Expr TO Expr [BY ConstExpr] DO StatementSeq END | LOOP StatementSeq END | WITH Guard DO StatementSeq {""|"" Guard DO StatementSeq} [ELSE StatementSeq] END | EXIT | RETURN [Expr] ]. Case = [CaseLabels {"","" CaseLabels} "":"" StatementSeq]. CaseLabels = ConstExpr ["".."" ConstExpr]. Guard = Qualident "":"" Qualident. ConstExpr = Expr. Expr = SimpleExpr [Relation SimpleExpr]. SimpleExpr = [""+"" | ""-""] Term {AddOp Term}. Term = Factor {MulOp Factor}. Factor = Designator [""("" [ExprList] "")""] | number | character | string | NIL | Set | ""("" Expr "")"" | "" ~ "" Factor. Set = ""{"" [Element {"","" Element}] ""}"". Element = Expr ["".."" Expr]. Relation = ""="" | ""#"" | ""<"" | ""<="" | "">"" | "">="" | IN | IS. AddOp = ""+"" | ""-"" | OR. MulOp = ""*"" | ""/"" | DIV | MOD | ""&"". Designator = Qualident {""."" ident | ""["" ExprList ""]"" | "" ^ "" | ""("" Qualident "")""}. ExprList = Expr {"","" Expr}. IdentList = IdentDef {"","" IdentDef}. Qualident = [ident "".""] ident. IdentDef = ident ["" * "" | "" - ""]." Oberon 2 Out.String """" true true false true https://en.wikipedia.org/wiki/Oberon-2 0 0 https://hopl.info/showlanguage.prx?exp=1647 vale-assembly Vale 2017 Chris Hawblitzel 17 assembly 0 v0.3.20 895 1 14 22925 true 0 https://github.com/project-everest/vale assembly 2017 2024 2017 31 21 261 19 false Verified Assembly Language for Everest 2017 2024 1906 31 303 65 276482 Vale is a tool for constructing formally verified high-performance assembly language code, with an emphasis on cryptographic code. It uses existing verification frameworks, such as Dafny and F*, for formal verification. It supports multiple architectures, such as x86, x64, and ARM, and multiple platforms, such as Windows, Mac, and Linux. Additional architectures and platforms can be supported with no changes to the Vale tool. Vale is a tool for constructing formally verified high-performance assembly language code, with an emphasis on cryptographic code. It uses existing verification frameworks, such as Dafny and F*, for formal verification. It supports multiple architectures, such as x86, x64, and ARM, and multiple platforms, such as Windows, Mac, and Linux. Additional architectures and platforms can be supported with no changes to the Vale tool. Vale is a tool for constructing formally verified high-performance assembly language code, with an emphasis on cryptographic code. It uses existing verification frameworks, such as Dafny and F*, for formal verification. It supports multiple architectures, such as x86, x64, and ARM, and multiple platforms, such as Windows, Mac, and Linux. Additional architectures and platforms can be supported with no changes to the Vale tool. restructuredtext f-sharp xml python bourne-shell markdown csharp dockerfile c bash powershell json ocaml make true 356 0 33 fstar 1 false 0 true procedure ReadA(ghost a:seq(uint32),inline b:bool) reads r0; mem; modifies r1; requires length(a) >= 3; a[0] <= 100; a[1] <= 100; forall i :: 0 <= i < length(a) ==> InMem(r0 + 4 * i, mem) && mem[r0 + 4 * i] == a[i]; ensures b ==> r1 == a[0] + 1; !b ==> r1 == a[1] + 1; { inline if (b) { LDR(r1, r0, 0); //load memory [r0+0] into r1 AddOne(r1); } else { LDR(r1, r0, 4); //load memory [r0+4] into r1 AddOne(r1); } } procedure{:recursive} AddNToR7(inline n:nat) modifies r7; requires r7 + n <= 0xffffffff; ensures r7 == old(r7) + n; { inline if (n > 0) { AddOne(r7); AddNToR7(n - 1); } https://github.com/project-everest/vale // true true false 0 0 opengl OpenGL 1992 11 library 3d https://www.opengl.org 0 896 0 22924 true 1 phigs library false 1997 1991 opencl c javascript webgl ios java android isbn qt linux glsl metal 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. 2001 1054 1120 2131 22497 Khronos Group 5291 0 11 text https://twitter.com/opengl https://en.wikipedia.org/wiki/OpenGL 10 0 opengl.org 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 virgil Virgil 2006 Ben L. Titzer 13 pl 0 897 2 18 22921 true 0 https://github.com/titzer/virgil pl 2015 2024 2012 21 41 1182 35 false v/Virgil.v3 2012 2025 3007 42 24486 68 634835 v3 bash markdown c json assembly-language java typescript bourne-shell javascript make vim-script wasm cpp html yaml lisp toml python true 1348 0 32 1 false https://news.ycombinator.com/item?id=31954053 "def main() { System.puts(""Hello World!\n""); }" " def main() { System.puts(""Hello World\n""); }" Virgil https://github.com/titzer/virgil System.puts true 0 0 bro Bro 1994 16 pl https://www.bro.org/ 0 898 0 22921 true 0 pl 122 149 1383 0 false 32 2014 2016 4 Big Red One 2002 1972 2007 41 97 513 8846268 Bro's domain-specific scripting language enables site-specific monitoring policies. Bro's domain-specific scripting language enables site-specific monitoring policies. Lawrence Berkeley National Lab Bro's domain-specific scripting language enables site-specific monitoring policies. bro 426 0 17 zeek text United States https://en.wikipedia.org/wiki/Bro 0 0 bro.org Bro https://github.com/bro/bro-sublime Bro hyperscript Hyperscript 2012 Dominic Tarr 12 template 0 2.0.2 899 1 5 22917 true 0 https://github.com/hyperhype/hyperscript template 2013 2024 2012 48 110 2622 43 false 2012 2019 157 23 10 1 1291 https://github.com/hyperhype html javascript yaml markdown json true 2976 0 17 1 false 2 true United States "var h = require('hyperscript') h('div#page', h('div#header', h('h1.classy', 'h', { style: {'background-color': '#22f'} })), h('div#menu', { style: {'background-color': '#2f2'} }, h('ul', h('li', 'one'), h('li', 'two'), h('li', 'three'))), h('h2', 'content title', { style: {'background-color': '#f22'} }), h('p', ""so it's just like a templating engine,\n"", ""but easy to use inline with javascript\n""), h('p', ""the intention is for this to be used to create\n"", ""reusable, interactive html widgets. ""))" https://github.com/hyperhype/hyperscript 0 0 oden oden 2016 Oskar Wickström 14 pl https://oden-lang.github.io 0 0.3.5 900 0 12 22917 true 0 https://github.com/oden-lang/oden pl 2015 2024 2015 44 19 726 15 false 2015 2017 582 6 507 33 458169 https://github.com/oden-lang haskell html markdown css javascript bourne-shell yaml svg go tex make dockerfile true 791 0 26 1 false 0 true Sweden https://web.archive.org/web/20160603002614/https://oden-lang.org https://github.com/oden-lang/oden 0 0 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 bluespec Bluespec 2000 17 pl 0 901 1 22916 true 0 pl 32 51 275 0 verilog source.bsv programming false 12 2013 2015 2 2 2000 haskell systemverilog 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. 2006 25 11 33 5931665 Bluespec, Inc bsv 345 0 21 text United States "package TbTL; import TL::*; interface Lamp; method Bool changed; method Action show_offs; method Action show_ons; method Action reset; endinterface module mkLamp#(String name, Bool lamp)(Lamp); Reg#(Bool) prev <- mkReg(False); method changed = (prev != lamp); method Action show_offs; if (prev && !lamp) $write (name + "" off, ""); endmethod method Action show_ons; if (!prev && lamp) $write (name + "" on, ""); endmethod method Action reset; prev <= lamp; endmethod endmodule (* synthesize *) module mkTest(); let dut <- sysTL; Reg#(Bit#(16)) ctr <- mkReg(0); Reg#(Bool) carN <- mkReg(False); Reg#(Bool) carS <- mkReg(False); Reg#(Bool) carE <- mkReg(False); Reg#(Bool) carW <- mkReg(False); Lamp lamps[12]; lamps[0] <- mkLamp(""0: NS red "", dut.lampRedNS); lamps[1] <- mkLamp(""1: NS amber"", dut.lampAmberNS); lamps[2] <- mkLamp(""2: NS green"", dut.lampGreenNS); lamps[3] <- mkLamp(""3: E red "", dut.lampRedE); lamps[4] <- mkLamp(""4: E amber"", dut.lampAmberE); lamps[5] <- mkLamp(""5: E green"", dut.lampGreenE); lamps[6] <- mkLamp(""6: W red "", dut.lampRedW); lamps[7] <- mkLamp(""7: W amber"", dut.lampAmberW); lamps[8] <- mkLamp(""8: W green"", dut.lampGreenW); lamps[9] <- mkLamp(""9: Ped red "", dut.lampRedPed); lamps[10] <- mkLamp(""10: Ped amber"", dut.lampAmberPed); lamps[11] <- mkLamp(""11: Ped green"", dut.lampGreenPed); rule start (ctr == 0); $dumpvars; endrule rule detect_cars; dut.set_car_state_N(carN); dut.set_car_state_S(carS); dut.set_car_state_E(carE); dut.set_car_state_W(carW); endrule rule go; ctr <= ctr + 1; if (ctr == 5000) carN <= True; if (ctr == 6500) carN <= False; if (ctr == 12_000) dut.ped_button_push; endrule rule stop (ctr > 32768); $display(""TESTS FINISHED""); $finish(0); endrule function do_offs(l) = l.show_offs; function do_ons(l) = l.show_ons; function do_reset(l) = l.reset; function do_it(f); action for (Integer i=0; i<12; i=i+1) f(lamps[i]); endaction endfunction function any_changes(); Bool b = False; for (Integer i=0; i<12; i=i+1) b = b || lamps[i].changed; return b; endfunction rule show (any_changes()); do_it(do_offs); do_it(do_ons); do_it(do_reset); $display(""(at time %d)"", $time); endrule endmodule endpackage " (* *) True False true true true false https://en.wikipedia.org/wiki/Bluespec 0 0 Bluespec https://github.com/thotypous/sublime-bsv Bluespec gren Gren 2012 evancz 15 pl https://gren-lang.org/ 0 0.3.0 902 1 3 22914 true 0 https://github.com/gren-lang/compiler pl 2021 2024 2012 13 20 334 66 false 2012 2025 6733 138 173 13 47157 A programming language for simple and correct applications A programming language for simple and correct applications https://github.com/gren-lang A programming language for simple and correct applications gren haskell markdown yaml true 534 0 19 1 false 0 true Unknown "module Main exposing (main) import Html exposing (Html) main : Html a main = Html.text ""Hello, world!"" " https://github.com/gren-lang/compiler 0 0 game-maker-language Game Maker Language 1999 22 pl 3d 0 903 2 22913 true 0 pl 394 430 278 0 c_cpp clike text/x-c++src source.c++ programming false 359 2005 2018 11 23 "The language historically tries to accommodate different programming backgrounds and styles - BASIC/Lua style ""and"" / ""or"" keywords can be used interchangeably with C-style ""&&"" / ""||"" operators; parentheses around conditions in if-statements and loops can be omitted; semicolons are largely optional[26] (insertion happens at the end of statement; compile error is raised in case of ambiguity). The language's default mode of operation on native platforms is via a stack machine; it can also be source-to-source compiled to C++ via LLVM for higher performance.[27] On HTML5, GML is source-to-source compiled to JavaScript with optimizations and minification applied in non-debug builds." "The language historically tries to accommodate different programming backgrounds and styles - BASIC/Lua style ""and"" / ""or"" keywords can be used interchangeably with C-style ""&&"" / ""||"" operators; parentheses around conditions in if-statements and loops can be omitted; semicolons are largely optional[26] (insertion happens at the end of statement; compile error is raised in case of ambiguity). The language's default mode of operation on native platforms is via a stack machine; it can also be source-to-source compiled to C++ via LLVM for higher performance.[27] On HTML5, GML is source-to-source compiled to JavaScript with optimizations and minification applied in non-debug builds." YoYo Games Ltd "The language historically tries to accommodate different programming backgrounds and styles - BASIC/Lua style ""and"" / ""or"" keywords can be used interchangeably with C-style ""&&"" / ""||"" operators; parentheses around conditions in if-statements and loops can be omitted; semicolons are largely optional[26] (insertion happens at the end of statement; compile error is raised in case of ambiguity). The language's default mode of operation on native platforms is via a stack machine; it can also be source-to-source compiled to C++ via LLVM for higher performance.[27] On HTML5, GML is source-to-source compiled to JavaScript with optimizations and minification applied in non-debug builds." gml 200 0 26 text Scotland, United Kingdom Game Maker Language https://docs.yoyogames.com/source/dadiospice/002_reference/001_gml%20language%20overview/index.html "// Hello World in GML (Game Maker Language) draw_text(10,10,""Hello World"") screen_refresh() keyboard_wait()" "/*************************************************** Builds and sends the actual piwik tracking request Copyright (c) 2015 John Hatch Licenced under the MIT licence: http://opensource.org/licenses/MIT ***************************************************/ // Source - https://github.com/johnhatch14/GMS-Extensions/blob/master/PiwikAnalyticsForGMS/GMS_PiwikAnalytics.gmx/scripts/_piwikSendBasicReq.gml //Build argument map var args = ds_map_create(); //----- // Populate GET arguments to Piwik HTTP API // See full HTTP API reference at http://developer.piwik.org/api-reference/tracking-api //----- //Required args ds_map_add(args, ""idsite"", string(_Piwik_idsite)); ds_map_add(args, ""rec"", ""1""); ds_map_add(args, ""url"", _piwikUrlEncode(_Piwik_baseurl + ""/"" + room_get_name(room))); ds_map_add(args, ""apiv"", ""1""); ds_map_add(args, ""_id"", _piwikUrlEncode(_Piwik_id)); ds_map_add(args, ""rand"", _piwikUrlEncode( string(round(random(999999999)+game_id)) )); //ds_map_add(args, ""new_visit"", ""0""); //Pass local time to API var ctz = date_get_timezone(); date_set_timezone(timezone_local); var now = date_current_datetime(); ds_map_add(args, ""h"", _piwikUrlEncode(string(date_get_hour(now)))); ds_map_add(args, ""m"", _piwikUrlEncode(string(date_get_minute(now)))); ds_map_add(args, ""s"", _piwikUrlEncode(string(date_get_second(now)))); date_set_timezone(ctz); // Add any other arguments passed to script in the form ""param=value"" to the http arg map //----- var arg_keyval; for (var i=0; i Res { match ResTyp::Ok((42, 42)) { ResTyp::Ok(res) => res, } } #[derive(Clone)] pub struct MyTupleType(u16, u8); pub fn test_tuple_destructuring() { let tuple = MyTupleType(1u16, 2u8).clone(); let MyTupleType(_a, _b) = tuple; } https://github.com/hacspec/hacspec 0 0 hacspec.org nimskull Nimskull 2021 Andreas Rumpf 13 pl https://nim-works.github.io/nimskull/index.html 0 906 0 18 22904 true 0 https://github.com/nim-works/nimskull pl 2021 2024 2008 5 38 267 86 false 2008 2025 21664 892 3297 112 542440 https://github.com/nim-works nim markdown restructuredtext yaml html c json python bourne-shell assembly-language csv css sql ini javascript bash xml cmake true 1275 0 32 nim 1 false Various https://news.ycombinator.com/item?id=32021299 https://github.com/nim-works/nimskull 0 0 xodio xodio 2015 Victor Nakoryakov 13 visual https://xod.io/ 0 v0.38.0 907 0 15 22901 true 0 https://github.com/xodio/xod visual 2015 2024 2016 45 119 884 101 false xodio.png 2016 2021 5359 22 2501 53 334098 2015 javascript cpp jsx reason scss markdown json svg bourne-shell yaml asciidoc dockerfile html c make true 1265 0 28 1 false 0 true true https://github.com/xodio/xod 0 0 xod.io links-programming-language Links 2006 15 pl http://www.links-lang.org 0 5.1.1 908 0 17 22900 true 0 https://github.com/links-lang/links pl 2014 2024 2006 18 42 320 162 false 2006 2024 4644 50 995 29 153905 -1 https://github.com/links-lang ocaml sql restructuredtext javascript css bash json bourne-shell markdown python make tex html julia yaml lisp perl true 513 0 32 false 5 true United Kingdom and France https://github.com/links-lang/links https://en.wikipedia.org/wiki/Links_(programming_language) 0 5 links-lang.org 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 partiql partiql 2019 James Siri 14 queryLanguage https://partiql.org/ 0 v2.1.4 909 0 11 22898 true 0 https://github.com/partiql/partiql-lang-kotlin queryLanguage 2019 2024 2019 23 60 538 287 false 2019 2025 2861 42 1310 20 173974 2019 Amazon Web Services kotlin sql markdown gradle csv yaml java asciidoc bourne-shell xml html true 762 0 25 1 false 2 true United States https://aws.amazon.com/blogs/opensource/announcing-partiql-one-query-language-for-all-your-data/ https://github.com/partiql/partiql-lang-kotlin 0 0 partiql.org tiscript TIScript 2007 Andrew Fedoniouk 12 pl https://sciter.com/developers/for-web-programmers/tiscript-vs-javascript/ 0 910 0 20 22893 true 0 https://github.com/c-smile/sciter-sdk pl 2015 2024 80 224 2104 53 false 2015 2023 549 14 2525 4436 Terra Informatica Software html css xml json c cpp svg cmake objective-c bourne-shell php objective-cpp markdown yaml pascal lua make idl javascript python true 2792 0 58 1 false Canada catch class const else false finally for function get if in instanceof namespace new null property return set super this throw true try typeof undefined var https://github.com/c-smile/sciter-sdk 0 0 noisecraft noisecraft 2021 Maxime Chevalier-Boisvert 13 pl https://noisecraft.app/ 0 0.0.1 911 0 8 22891 true 0 https://github.com/maximecb/noisecraft/ pl 2021 2024 18 61 1044 10 false 2021 2023 544 15 74 1 17054 https://github.com/maximecb/noisecraft/issues javascript html bourne-shell json yaml css markdown dockerfile true 1244 0 21 1 false 0 true true Canada https://github.com/maximecb/noisecraft/ 0 0 crmsh crmsh 2008 Dejan Muhamedagic 15 pl http://crmsh.github.io/ 0 5.0.0-pre 912 0 18 22890 true 0 https://github.com/ClusterLabs/crmsh pl 2014 2024 2008 31 95 127 69 false dsls.py 2008 2025 7390 90 468 30 93338 crmsh is a cluster management shell for the Pacemaker High Availability stack. crmsh is a cluster management shell for the Pacemaker High Availability stack. https://github.com/ClusterLabs/ crmsh is a cluster management shell for the Pacemaker High Availability stack. crmsh pcmk python yaml asciidoc gherkin xml expect bourne-shell markdown css bash make awk vim-script ini svg m4 dockerfile json true 504 0 33 1 false 5 true Various Crmsh https://github.com/ClusterLabs/crmsh 0 0 crmsh.github.io bitbake BitBake 2004 17 pl https://yoctoproject.org/tools-resources/projects/bitbake 0 913 1 22890 true 0 pl 667 1040 3285 0 text none programming false 2004 python linux subversion 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. 2008 61 46 63 17006433 Yocto Project bb true 326 0 18 text Various "require qt5-git.inc require ${PN}.inc do_install_append() { # for modules which are still using syncqt and call qtPrepareTool(QMAKE_SYNCQT, syncqt) # e.g. qt3d, qtwayland ln -sf syncqt.pl ${D}${OE_QMAKE_PATH_QT_BINS}/syncqt } QT_MODULE_BRANCH = ""release"" # v5.2.1 + 168 commits SRCREV = ""08cbbde61778276ccdda73d89fd64d02c623779f"" " # true true false https://en.wikipedia.org/wiki/BitBake 0 0 BitBake BitBake flix Flix 2016 Magnus Madsen 12 pl https://flix.dev/ 0 v0.47.0 914 0 10 22885 true 0 https://github.com/flix/flix pl 2015 2024 24 149 2107 593 false 2014 2025 10797 89 1172 125 155226 https://github.com/flix scala java markdown yaml toml css bourne-shell gradle javascript svg true 2645 0 22 1 false 0 true Denmark https://github.com/flix/flix 0 0 dedukti dedukti 2009 17 pl https://deducteam.github.io 0 v2.6.0 915 1 9 22884 true 0 https://github.com/Deducteam/Dedukti pl 2017 2024 2009 17 22 193 44 false 2009 2024 2783 63 577 11 1366727 https://github.com/Deducteam ocaml bourne-shell markdown make lisp xml yaml vim-script python true 324 0 28 false 2 true France Nat: Type. zero: Nat. succ: Nat -> Nat. def plus: Nat -> Nat -> Nat. [ n ] plus zero n --> n [ n ] plus n zero --> n [ n, m ] plus (succ n) m --> succ (plus n m) [ n, m ] plus n (succ m) --> succ (plus n m). https://github.com/Deducteam/Dedukti (; ;) true true false 0 0 deducteam.github.io s-plus S-PLUS 1988 16 pl 0 916 1 22883 true 0 pl false 1988 unix linux s excel-app spss solaris eclipse-editor r 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. 2006 74 133 81 3830007 TIBCO Software Inc false 390 0 17 text United States "# Hello World for S-Plus cat(""Hello world\n"") " # true true false https://en.wikipedia.org/wiki/S-PLUS 0 0 S-PLUS twine Twine 2013 Chris Klimas 11 application https://twinery.org/ https://github.com/iftechfoundation/twine-specs 0 917 0 9 22882 false 4 bitsy decker harlowe snowman https://github.com/klembot/twinejs application 2018 2024 49 291 1883 228 false 2013 2025 3108 77 917 22 81257 Twine, a tool for telling interactive, nonlinear stories. Twine, a tool for telling interactive, nonlinear stories. Twine, a tool for telling interactive, nonlinear stories. typescript markdown css json javascript svg yaml html toml true 2835 0 20 1 false https://github.com/klembot/twinejs 0 0 setl SETL 1969 Jacob T. Schwartz 23 pl http://setl.org/setl/ 0 918 2 22879 1268 true 0 pl false 1969 algol-60 abc ada python 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. 2004 34 51 101 916963 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. 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. Courant Institute of Mathematical Sciences 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. 191 0 25 1 text http://www.rosettacode.org/wiki/Category:SETL United States https://riju.codes/setl "print(""Hello, world!""); " procedure factorial(n); -- calculates the factorial n! return if n = 1 then 1 else n * factorial(n - 1) end if; end factorial; -- print true true true false https://en.wikipedia.org/wiki/SETL 7 11 https://hopl.info/showlanguage.prx?exp=1268 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 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 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 cirru Cirru 2012 tí yè 20 dataNotation http://text.cirru.org/ 0 919 2 22878 true 0 dataNotation 266 288 346 0 cirru source.cirru programming false 31 2012 2015 9 3 webmisc.py https://editor.calcit-lang.org/ Cirru Project helps people code in syntax tree. It offers a tree editor and a text syntax. Cirru Project helps people code in syntax tree. It offers a tree editor and a text syntax. https://github.com/Cirru Cirru Project helps people code in syntax tree. It offers a tree editor and a text syntax. cirru cirru 201 0 20 1 text China https://github.com/Cirru/cirru-parser/wiki/About-Cirru set a add number 1 number 2 require ./stdio.cr Cirru https://twitter.com/cirrulang true 0 0 text.cirru.org Cirru https://github.com/Cirru/sublime-cirru Cirru smt SMT 2003 20 pl http://smtlib.cs.uiowa.edu/language.shtml 0 920 2 22878 true 0 pl 130 149 582 0 boolector cvc4 mathsat5 opensmt smtinterpol smt-rat stp verit yices2 z3 text source.smt programming false 31 2015 2015 4 3 Satisfiability Modulo Theories Common input and output languages for SMT solvers. Common input and output languages for SMT solvers. University of Iowa Common input and output languages for SMT solvers. smt2 smt 201 0 21 text https://github.com/antlr/grammars-v4/tree/master/smtlibv2 United States ; Getting assertions (set-option :produce-assertions true) (set-logic QF_UF) (declare-const p Bool) (declare-const q Bool) (push 1) (assert (or p q)) (push 1) (assert (not q)) (get-assertions) ; ((or p q) ; (not q) ; ) (pop 1) (get-assertions) ; ((or p q)) (pop 1) (get-assertions) ; () (exit) "(set-logic QF_LIA) (set-info :source | SMT-COMP'06 organizers |) (set-info :smt-lib-version 2.0) (set-info :category ""check"") (set-info :status unsat) (set-info :notes |This benchmark is designed to check if the DP supports bignumbers.|) (declare-fun x1 () Int) (declare-fun x2 () Int) (declare-fun x3 () Int) (declare-fun x4 () Int) (declare-fun x5 () Int) (declare-fun x6 () Int) (assert (and (or (>= x1 1000) (>= x1 1002)) (or (>= x2 (* 1230 x1)) (>= x2 (* 1003 x1))) (or (>= x3 (* 1310 x2)) (>= x3 (* 1999 x2))) (or (>= x4 (* 4000 x3)) (>= x4 (* 8000 x3))) (or (<= x5 (* (- 4000) x4)) (<= x5 (* (- 8000) x4))) (or (>= x6 (* (- 3) x5)) (>= x6 (* (- 2) x5))) (< x6 0))) (check-sat) (exit)" ; true true false 0 7 SMT https://github.com/SRI-CSL/SMT.tmbundle.git SMT 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 reactjs ReactJS 2013 Jordan Walke 10 framework https://react.dev/ 0 921 0 15 22876 false 1 scroll https://github.com/facebook/react framework 2013 2024 6637 46047 225732 811 false 2013 2025 27132 1966 6036 5596 905391 javascript markdown typescript json css html yaml bourne-shell jsx svg cpp coffeescript python toml make true 365861 0 25 1 false https://github.com/facebook/react https://en.wikipedia.org/wiki/React_(JavaScript_library) 0 0 glisp Glisp 2020 Baku Hashiomoto 13 visual lisp https://glisp.app 0 922 1 7 22876 true 0 https://github.com/baku89/glisp visual 2020 2024 28 29 1101 14 false glisp.png 2020 2021 3820 8 218 31 36251 Glisp is a Lisp-based design tool that combines generative approaches with traditional design methods, empowering artists to discover new forms of expression. Glisp is a Lisp-based design tool that combines generative approaches with traditional design methods, empowering artists to discover new forms of expression. Glisp is a Lisp-based design tool that combines generative approaches with traditional design methods, empowering artists to discover new forms of expression. typescript markdown javascript stylus html json yaml true 1198 0 20 1 false Japan "(style (fill ""blue"") (circle [6 -152.1659] 140.0047))" https://github.com/baku89/glisp 0 0 mathjson MathJSON 2019 Arno Gourdol 15 textMarkup https://cortexjs.io/math-json/ 0 923 3 9 22875 true 0 https://github.com/cortex-js/compute-engine textMarkup 2019 2024 10 40 346 35 false 2019 2025 1153 17 296 16 114529 https://cortexjs.io/compute-engine/demo/ MathJSON: a lightweight data interchange format for mathematical notation. MathJSON: a lightweight data interchange format for mathematical notation. MathJSON: a lightweight data interchange format for mathematical notation. typescript markdown json javascript bourne-shell html css bash yaml true 485 0 27 latex katex tex 1 false "[ ""Equal"", [ ""Add"", [ ""Power"", ""ExponentialE"", [""Multiply"", ""ImaginaryUnit"", ""Pi""] ], 1 ], 0 ]" https://github.com/cortex-js/compute-engine 0 0 si SI 1960 11 notation 0 924 0 22874 true 0 notation false Système international 1948 isq symbol unicode 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. 2001 2882 3469 4748 26764 General Conference on Weights and Measures 14430 0 11 text 3835 United States https://en.wikipedia.org/wiki/International_System_of_Units 0 2 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 edgedb edgedb 2017 11 database https://edgedb.com 0 925 0 13 22872 false 0 https://github.com/edgedb/edgedb database 2017 2024 2008 105 393 12835 776 false 2008 2025 12045 154 1526 73 694188 2014 https://github.com/edgedb python restructuredtext rust cython yaml hcl markdown svg toml javascript make css csv true 14170 0 24 false United States https://github.com/edgedb/edgedb 0 0 edgedb.com hope HOPE 1978 27 pl 0 926 1 22868 810 true 0 pl false 1970 haskell ml snobol Hope is a small functional programming language developed in the 1970s at Edinburgh University. It predates Miranda and Haskell and is contemporaneous with ML (also developed at Edinburgh). Hope was derived from NPL, a simple functional language developed by Rod Burstall and John Darlington in their work on program transformation. NPL was, in turn, derived from Kleene Recursion Equations. NPL and Hope are notable for being the first languages with call-by-pattern evaluation and algebraic data types. (Though SNOBOL is even older, and its 'patterns' may qualify as a hybrid between call-by-pattern and regular expression matching.) Hope is an important language in the development of functional programming. Hope was named for Sir Thomas Hope (c. 1681–1771), a Scottish agricultural reformer, after whom Hope Park Square in Edinburgh, the location of the Department of Artificial Intelligence at the time of the development of Hope, was also named. 2004 25 32 77 933188 https://github.com/dmbaturin/hope/issues 145 0 64 text 1086 http://www.rosettacode.org/wiki/Category:Hope United Kingdom https://github.com/dmbaturin/hope dec fact : num -> num; --- fact 0 <= 1; --- fact n <= n*fact(n-1); "and or not char num div mod dec X # : -> ; --- if then else > <= + ( ) , infix - truval :: nil "" <> == in where data ++ lambda" --- true true true true true true true false true true false true true https://en.wikipedia.org/wiki/Hope_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=810 treesheets TreeSheets 2019 Wouter Van Oortmerssen 11 visual https://strlen.com/treesheets/ 0 v1.0.2 927 0 9 22867 true 2 explorer particles https://github.com/aardappel/treesheets visual 2013 2024 2013 61 188 2514 122 false treesheets.png 2013 2025 868 42 403 8 137084 cpp c svg xml html yaml markdown bourne-shell cmake true 3122 0 20 1 false 1 true https://github.com/aardappel/treesheets 0 0 z-expressions Z 2012 Chris Done 17 pl http://chrisdone.com/z/ 0 928 0 5 22865 true 0 https://github.com/chrisdone/z pl 2012 2024 2012 16 9 278 0 false 2012 2014 25 2 11 1 1361 zz javascript markdown json yaml make true 309 0 24 1 false https://news.ycombinator.com/item?id=20557363 https://github.com/chrisdone/z -- true true true true 0 2 year|title|doi|citations|influentialCitations|authors|paperId\n1991|Z--, an Executable Subset of Z|10.1007/978-1-4471-3203-5_8|32|0|S. Valentine|cb8dcd8e7eebe465483e5f19acb24dbc2591ae57\n2020|Z Formal Specification Language|10.1007/978-1-4471-4534-9_6|8|0|Gerard O'Regan|bb1c68c8991fb5e1a3d3814e46718ffaf07a9f1e mimium mimium 2019 Tomoya Matsuura 17 pl https://mimium.org 0 v0.4.0 929 1 10 22862 true 0 https://github.com/mimium-org/mimium pl 2020 2024 2019 9 9 267 7 false 2019 2024 1168 10 229 2 18656 2020 mimium (MInimal Musical medIUM) a programming language as an infrastructure for sound and music. mimium (MInimal Musical medIUM) a programming language as an infrastructure for sound and music. Kyushu University mimium (MInimal Musical medIUM) a programming language as an infrastructure for sound and music. cpp cmake markdown yaml lex python dockerfile make restructuredtext svg true 306 0 27 1 false 0 true Japan https://dblp.org/rec/conf/icfp/MatsuuraJ21 // A minimal example below generates a sinewave of 440Hz: // minimal.mmm twopi = 3.141595*2 sr = 48000 fn dsp(){ out = sin(now * 440 * twopi / sr) return (out,out) } https://twitter.com/mimium-org https://github.com/mimium-org/mimium 0 0 mimium.org coco Coco 2010 Satoshi Murakami 14 pl https://satyr.github.io/coco/ 0 0.9.2-b 930 0 5 22861 true 0 https://github.com/satyr/coco/ pl 2010 2024 25 48 499 39 false 2009 2014 3401 39 69 13 7852 https://github.com/satyr/ co javascript html markdown json css javascript true 684 0 21 1 false 0 true Japan https://github.com/satyr/coco/ 0 0 plot Plot 2019 John Sundell 12 template 0 0.14.0 931 1 2 22859 true 0 https://github.com/JohnSundell/Plot template 2019 2024 2019 32 138 1972 8 false 2019 2023 111 38 86 1 8682 https://github.com/JohnSundell/Plot/pulls swift markdown true 2425 0 14 1 false 0 true Poland "let html = HTML( .head( .title(""My website""), .stylesheet(""styles.css"") ), .body( .div( .h1(""My website""), .p(""Writing HTML in Swift is pretty great!"") ) ) )" https://github.com/JohnSundell/Plot 0 0 kakoune-editor Kakoune 2011 11 editor http://kakoune.org 0 v2022.10.31 932 0 10 22856 false 0 https://github.com/mawww/kakoune/ editor 2011 2024 113 710 9763 865 false 2011 2025 10851 451 2405 44 65924 https://github.com/mawww/kakoune/issues cpp asciidoc yaml bourne-shell perl make python svg ruby markdown true 12346 0 21 false 2022 false Australia https://github.com/mawww/kakoune/ 0 0 bitsy Bitsy 2016 Adam Le Doux 12 application https://bitsy.org/ 0 933 0 9 22856 false 1 decker https://github.com/le-doux/bitsy application 2016 2024 23 141 822 4 false 2016 2025 1658 18 609 174 4594591 https://make.bitsy.org/ A little engine for little games, worlds, and stories. A little engine for little games, worlds, and stories. A little engine for little games, worlds, and stories. svg javascript markdown css json xml html yaml typescript true 1265 0 22 twine 1 false https://github.com/le-doux/bitsy 0 0 sophia Sophia 2018 Robert Virding 27 contractLanguage https://aeternity.com/aesophia 0 v8.0.1 934 0 6 22855 true 0 https://github.com/aeternity/aesophia contractLanguage 2018 2024 2018 29 19 51 46 false 2018 2024 1123 32 287 9 29476 https://github.com/aeternity erlang markdown yaml reason html python true 142 0 83 solidity 1 false 8 true sophia Liechtenstein 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 https://github.com/aeternity/aesophia // /* */ true false true true true true true true true true true 0 0 xpath XPath 1999 12 queryLanguage 0 935 1 22851 true 0 queryLanguage false 1999 xml css java csharp python javascript xproc xquery json unicode c free-pascal perl php ruby scheme sql mysql postgresql tcl XPath (XML Path Language) is a query language for selecting nodes from an XML document. In addition, XPath may be used to compute values (e.g., strings, numbers, or Boolean values) from the content of an XML document. XPath was defined by the World Wide Web Consortium (W3C). 2008 475 332 228 19086670 W3C https://cheatsheets.zip/xpath 2395 0 12 https://developer.mozilla.org/en-US/docs/Web/XPath text https://github.com/antlr/grammars-v4/tree/master/xpath/xpath1 /Wikimedia/projects/project[@name='Wikipedia']/editions/edition/text() https://en.wikipedia.org/wiki/XPath 4 5 year|publisher|title|authors|isbn13\n2008|Wrox|XSLT 2.0 and XPath 2.0 Programmer's Reference|Kay, Michael|9780470192740\n2003|O'Reilly Media|Learning XSLT: A Hands-On Introduction to XSLT and XPath|Michael James Fitzgerald|9780596003272\n2009|McGraw-Hill Education|XML: A Beginner's Guide: Go Beyond the Basics with Ajax, XHTML, XPath 2.0, XSLT 2.0 and XQuery|Holzner, Steven|9780071606264\n2009|McGraw-Hill Education|XML: A Beginner's Guide: Go Beyond the Basics with Ajax, XHTML, XPath 2.0, XSLT 2.0 and XQuery|Holzner, Steven|9780071606271 year|title|doi|citations|influentialCitations|authors|paperId\n2015|Fuzzy XPath through Fuzzy Logic Programming|10.1007/s00354-015-0201-y|20|1|J. Almendros-Jiménez and Alejandro Luna and G. Moreno|5ec7ce533a3eb6165fce48ac59d4e85355bdd65b\n2011|Integrating XPath with the Functional-Logic Language Toy|10.1007/978-3-642-18378-2_13|9|0|R. Caballero and Y. García-Ruiz and F. Sáenz-Pérez|1612a58914d4cfe461dcdc9fcdfea4e6dd512107\n2007|Evaluation of datalog extended with an XPath predicate|10.1145/1316902.1316905|7|0|Royi Ronen and O. Shmueli|3426d6f341f28de002fc0b93f67c76edfea4727b\n2011|XIVD: Runtime Detection of XPath Injection Vulnerabilities in XML Databases through Aspect Oriented Programming|10.1007/978-3-642-22555-0_21|4|0|V. Shanmughaneethi and Ra. Yagna Pravin and S. Swamynathan|3c616070af9a536db1c9245e647dc707715e5c15\n2014|Distributed Evaluation of XPath Axes Queries over Large XML Documents Stored in MapReduce Clusters|10.1109/DEXA.2014.59|2|0|Adam Senk and M. Valenta and W. Benn|1eae81a4d44f670f594be5b566cd6620c0e5647d dc Dc 1978 20 pl 0 936 3 22851 1957 true 0 pl false d/Dc.dc desk calculator 1971 reverse-polish-notation unix c 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. 2004 36 23 149 562904 Bell Labs dc 200 0 21 https://tio.run/#dc text 1109 http://www.rosettacode.org/wiki/Category:Dc United States [Hello World ]n https://riju.codes/dc [Hello, world!] p "#!/usr/bin/perl my ($g,$e,$m) = map { ""\U$_"" } @ARGV; die ""$0 gen exp mod\n"" unless $m; print `echo $g $e $m | dc -e ' # Hex input and output 16dio # Read m, e and g from stdin on one line ?SmSeSg # Function z: return g * top of stack [lg*]sz # Function Q: remove the top of the stack and return 1 [sb1q]sQ # Function X(e): recursively compute g^e % m # It is the same as Sm^Lm%, but handles arbitrarily large exponents. # Stack at entry: e # Stack at exit: g^e % m # Since e may be very large, this uses the property that g^e % m == # if( e == 0 ) # return 1 # x = (g^(e/2)) ^ 2 # if( e % 2 == 1 ) # x *= g # return x % [ d 0=Q # return 1 if e==0 (otherwise, stack: e) d 2% Sa # Store e%2 in a (stack: e) 2/ # compute e/2 lXx # call X(e/2) d* # compute X(e/2)^2 La1=z # multiply by g if e%2==1 lm % # compute (g^e) % m ] SX le # Load e from the register lXx # compute g^e % m p # Print the result '`;" Dc # true true false https://en.wikipedia.org/wiki/Dc_(computer_program) 0 18 https://hopl.info/showlanguage.prx?exp=1957 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 spin Spin 2006 20 pl 0 937 1 22851 true 0 pl 101 129 38264 0 text source.spin programming false 10 2013 2018 10 3 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. 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. Parallax Inc 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. spin 200 0 23 text 5184 http://www.rosettacode.org/wiki/Category:Spin United States https://learn.parallax.com/educators/teach/spin-programming-multicore-propeller "''**************************************** ''* Debug_Lcd v1.2 * ''* Authors: Jon Williams, Jeff Martin * ''* Copyright (c) 2006 Parallax, Inc. * ''* See end of file for terms of use. * ''**************************************** '' '' Debugging wrapper for Serial_Lcd object '' '' v1.2 - March 26, 2008 - Updated by Jeff Martin to conform to Propeller object initialization standards. '' v1.1 - April 29, 2006 - Updated by Jon Williams for consistency. '' OBJ lcd : ""serial_lcd"" ' driver for Parallax Serial LCD num : ""simple_numbers"" ' number to string conversion PUB init(pin, baud, lines) : okay '' Initializes serial LCD object '' -- returns true if all parameters okay okay := lcd.init(pin, baud, lines) PUB finalize '' Finalizes lcd object -- frees the pin (floats) lcd.finalize PUB putc(txbyte) '' Send a byte to the terminal lcd.putc(txbyte) PUB str(strAddr) '' Print a zero-terminated string lcd.str(strAddr) PUB dec(value) '' Print a signed decimal number lcd.str(num.dec(value)) PUB decf(value, width) '' Prints signed decimal value in space-padded, fixed-width field lcd.str(num.decf(value, width)) PUB decx(value, digits) '' Prints zero-padded, signed-decimal string '' -- if value is negative, field width is digits+1 lcd.str(num.decx(value, digits)) PUB hex(value, digits) '' Print a hexadecimal number lcd.str(num.hex(value, digits)) PUB ihex(value, digits) '' Print an indicated hexadecimal number lcd.str(num.ihex(value, digits)) PUB bin(value, digits) '' Print a binary number lcd.str(num.bin(value, digits)) PUB ibin(value, digits) '' Print an indicated (%) binary number lcd.str(num.ibin(value, digits)) PUB cls '' Clears LCD and moves cursor to home (0, 0) position lcd.cls PUB home '' Moves cursor to 0, 0 lcd.home PUB gotoxy(col, line) '' Moves cursor to col/line lcd.gotoxy(col, line) PUB clrln(line) '' Clears line lcd.clrln(line) PUB cursor(type) '' Selects cursor type '' 0 : cursor off, blink off '' 1 : cursor off, blink on '' 2 : cursor on, blink off '' 3 : cursor on, blink on lcd.cursor(type) PUB display(status) '' Controls display visibility; use display(false) to hide contents without clearing if status lcd.displayOn else lcd.displayOff PUB custom(char, chrDataAddr) '' Installs custom character map '' -- chrDataAddr is address of 8-byte character definition array lcd.custom(char, chrDataAddr) PUB backLight(status) '' Enable (true) or disable (false) LCD backlight '' -- affects only backlit models lcd.backLight(status) {{ ┌──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┐ │ TERMS OF USE: MIT License │ ├──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┤ │Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation │ │files (the ""Software""), to deal in the Software without restriction, including without limitation the rights to use, copy, │ │modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software│ │is furnished to do so, subject to the following conditions: │ │ │ │The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.│ │ │ │THE SOFTWARE IS PROVIDED ""AS IS"", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE │ │WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR │ │COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, │ │ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │ └──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┘ }}" ' true false true true true true 0 0 Propeller Spin https://github.com/bitbased/sublime-spintools Propeller Spin rapira Rapira 1987 Andrey Ershov 24 pl http://freeduke33.github.io/rerap2 0 938 3 3 22849 5224 true 0 https://github.com/freeduke33/rerap2 pl 2015 2024 2015 5 4 31 0 false Russian r/Rapira.rap 2015 2021 21 4 147 1 14711 pop-2 setl algol 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. 2002 19 10 59 146951 rap cpp make markdown true 164 0 29 1 false https://tio.run/#rapira text http://www.rosettacode.org/wiki/Category:Rapira Russia http://ershov.iis.nsk.su/ru/node/772586 "output: ""Hello World""; " https://riju.codes/rapira "вывод: ""Hello, world!"" " proc start() output: 'Hello, world!!!'; end proc Rapira https://github.com/freeduke33/rerap2 output: """" true true https://en.wikipedia.org/wiki/Rapira 0 0 https://hopl.info/showlanguage.prx?exp=5224 scryer Scryer Prolog 2016 Mark Thom 12 pl https://www.scryer.pl/ 0 939 0 10 22848 true 0 https://github.com/mthom/scryer-prolog pl 2016 2024 55 115 1969 290 false 2016 2025 4101 61 346 11 123186 https://play.scryer.pl Scryer Prolog aims to become to ISO Prolog what GHC is to Haskell: an open source industrial strength production environment that is also a testbed for bleeding edge research in logic and constraint programming, which is itself written in a high-level language. Scryer Prolog aims to become to ISO Prolog what GHC is to Haskell: an open source industrial strength production environment that is also a testbed for bleeding edge research in logic and constraint programming, which is itself written in a high-level language. Scryer Prolog aims to become to ISO Prolog what GHC is to Haskell: an open source industrial strength production environment that is also a testbed for bleeding edge research in logic and constraint programming, which is itself written in a high-level language. prolog rust toml json markdown yaml svg lisp dockerfile bourne-shell true 2377 0 23 prolog 1 false https://github.com/mthom/scryer-prolog 0 0 megaparsec Megaparsec 2015 12 library 0 9.6.1 940 0 7 22843 true 1 attoparsec https://github.com/mrkkrp/megaparsec library 2015 2024 15 84 904 17 false 2008 2025 1053 81 73 3 14752 Industrial-strength monadic parser combinator library Industrial-strength monadic parser combinator library https://github.com/mrkkrp/megaparsec/issues Industrial-strength monadic parser combinator library haskell markdown json csv nix yaml xml true 1238 0 20 antlr false 9 true France https://github.com/mrkkrp/megaparsec 0 0 sieve Sieve mail filtering language 2008 15 application 0 941 1 22843 false 0 application 9 9 10 text sieve application/sieve source.sieve programming false sieve.py 2008 sed awk unicode smtp 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. 2005 78 24 78 2684593 University of Washington && Carnegie Mellon sieve siv sieve 460 0 16 text https://github.com/antlr/grammars-v4/tree/master/sieve sieve United States Sieve "# Sieve filter # Declare the extensions used by this script. # require [""fileinto"", ""reject""]; # Messages bigger than 100K will be rejected with an error message # if size :over 100K { reject ""I'm sorry, I do not accept mail over 100kb in size. Please upload larger files to a server and send me a link. Thanks.""; } # Mails from a mailing list will be put into the folder ""mailinglist"" # elsif address :is [""From"", ""To""] ""mailinglist@blafasel.invalid"" { fileinto ""INBOX.mailinglist""; } # Spam Rule: Message does not contain my address in To, CC or Bcc # header, or subject is something with ""money"" or ""Viagra"". # elsif anyof (not address :all :contains [""To"", ""Cc"", ""Bcc""] ""me@blafasel.invalid"", header :matches ""Subject"" [""*money*"",""*Viagra*""]) { fileinto ""INBOX.spam""; } # Keep the rest. # This is not necessary because there is a ""implicit keep"" Rule # else { keep; }" true true https://en.wikipedia.org/wiki/Sieve_(mail_filtering_language) 0 0 Sieve Sieve fact-lang FaCT 2017 Deian Stefan 18 pl 0 942 1 6 22843 true 0 https://github.com/PLSysSec/FaCT pl 2016 2024 2016 14 13 191 1 false FACT 2016 2022 1206 20 86 32 10775 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. 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. University of California San Diego && Stanford University && PI for Security and Privacy && Inria && IMDEA Software Institute 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. ocaml c bourne-shell markdown make dockerfile true 251 0 29 c 1 false text United States and Germany and France and Spain https://ranjitjhala.github.io/static/fact_dsl.pdf void swap_conditional(secret mut uint64[5] a, secret mut uint64[5] b, secret uint64 swapi) { if (swapi == 1) { for (uint32 i from 0 to 5) { secret uint64 x = a[i]; a[i] = b[i]; b[i] = x; } } } https://github.com/PLSysSec/FaCT 0 1 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 retdec RetDec 2017 11 decompiler https://retdec.com/ 0 943 0 10 22839 false 0 https://github.com/avast/retdec decompiler 2017 2024 2017 240 938 7893 427 false 2017 2024 2209 86 3851 33 2390951 2015 Avast Software s.r.o. cpp cmake python bourne-shell markdown json c yaml dockerfile make true 10795 0 21 false Czech Republic https://github.com/avast/retdec 0 0 retdec.com udp UDP 1980 11 protocol 0 944 0 22838 true 0 protocol false User Datagram Protocol 2010 ftp http smtp tls tcp unix isbn In computer networking, the User Datagram Protocol (UDP) is one of the core members of the Internet protocol suite. The protocol was designed by David P. Reed in 1980 and formally defined in RFC 768. With UDP, computer applications can send messages, in this case referred to as datagrams, to other hosts on an Internet Protocol (IP) network. Prior communications are not required in order to set up communication channels or data paths. UDP uses a simple connectionless communication model with a minimum of protocol mechanism. UDP provides checksums for data integrity, and port numbers for addressing different functions at the source and destination of the datagram. It has no handshaking dialogues, and thus exposes the user's program to any unreliability of the underlying network; There is no guarantee of delivery, ordering, or duplicate protection. If error-correction facilities are needed at the network interface level, an application may use the Transmission Control Protocol (TCP) or Stream Control Transmission Protocol (SCTP) which are designed for this purpose. UDP is suitable for purposes where error checking and correction are either not necessary or are performed in the application; UDP avoids the overhead of such processing in the protocol stack. Time-sensitive applications often use UDP because dropping packets is preferable to waiting for packets delayed due to retransmission, which may not be an option in a real-time system. 2001 1768 976 1075 31929 8860 35 11 https://www.ietf.org/rfc/rfc768.txt na https://en.wikipedia.org/wiki/User_Datagram_Protocol 1 5 UDP engineer year|title|doi|citations|influentialCitations|authors|paperId\n2001|The UDP Calculus: Rigorous Semantics for Real Networking|10.1007/3-540-45500-0_27|27|2|A. Serjantov and Peter Sewell and Keith Wansbrough|a34bdaf4c2a0bd805cd8d724a2b547a51828c47f\n2002|Rigour is good for you and feasible: reflections on formal treatments of C and UDP sockets|10.1145/1133373.1133383|14|1|Michael Norrish and Peter Sewell and Keith Wansbrough|0248940caaa70630b46ef32b006b05bdd328a311\n2016|Lightweight UDP Pervasive Protocol in Smart Home Environment Based on Labview|10.1088/1757-899X/190/1/012009|3|0|Wijaya Kurniawan and Mochammad Hannats Hanafi Ichsan and S. Akbar and Issa Arwani|de4bbbdaac82782258612887cb15afed90de5c13\n2018|UDP Pervasive Protocol Integration with IoT for Smart Home Environment using LabVIEW|10.11591/IJECE.V8I6.PP5342-5350|3|0|M. Ichsan and Wijaya Kurniawan and S. Akbar|00d454086ab5554f6ae45cc787ff2156fb2b5ddf\n2016|Development of Client-Server Application by Using UDP Socket Programming for Remotely Monitoring CNC Machine Environment in Fixture Process|10.17529/jre.v12i2.2925|3|0|Darmawan Darmawan and Pharmayeni Pharmayeni|ba267fe896d917f11ec3d3ab4060c36af3ab0ffd title|year|author|goodreadsId|rating|ratings|reviews\nNetwork Programming in Java: Internet protocols (IP, UDP, TCP)||Alan MOUHLI|51271311|0.0|0|0 mech-lang Mech 2018 Corey Montella 18 pl http://mech-lang.org 0 v0.0.5 945 1 8 22833 true 0 https://github.com/mech-lang/mech pl 2018 2024 2018 6 10 201 0 false 2018 2025 6727 16 166 12 58358 http://try.mech-lang.org/ 2018 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. 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. Lehigh University 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. rust markdown toml json yaml html typescript dockerfile true 249 0 26 1 false 0 true United States https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0 "# Breakout ## The Game game setup #system/timer = [resolution: 15 tick: 0 hours: 0 minutes: 0 seconds: 0] #app/main = [root: ""drawing"" direction: _ contains: [#game]] game area #game = [|type class contains parameters| #paddle-control ""canvas"" _ [#elements] [width: 400 height: 400]] controller slider #paddle-control = [type: ""slider"" class: _ contains: _ parameters: [min: 0 max: 300 value: 40]] draw the game area pos = #paddle-control{1,4}{1,3} start = pos end = pos + 100 #elements = [|shape parameters| ""circle"" [cx: #ball.x cy: #ball.y radius: 10 fill: ""#000000""] ""line"" [x1: start y1: 350 x2: end y2: 350 stroke: ""#000000""]] ## The Ball block #ball = [x: 20 y: 20 vx: 1 vy: 3] update ball position ~ #system/timer.tick #ball.x := #ball.x + #ball.vx #ball.y := #ball.y + #ball.vy bounce the ball off the paddle ~ #ball.y pos = #paddle-control{1,4}{1,3} start = pos end = pos + 100 ix = #ball.y > 340 & #ball.x > start & #ball.x < end & #ball.y < 342 #ball.vy{ix} := -#ball.vy bounce the ball off the ceiling ~ #ball.y #ball.vy{#ball.y < 10} := -#ball.vy bounce the ball off the walls ~ #ball.x #ball.vx{#ball.x > 390 | #ball.x < 10} := -#ball.vx reset the ball if it makes it past the paddle ~ #ball.y ix = #ball.y > 390 #ball.x{ix} := 20 #ball.y{ix} := 20" https://twitter.com/MechLang https://github.com/mech-lang/mech 0 0 mech-lang.org beta BETA 1983 Bent Bruun Kristensen and Ole Lehrmann Madsen and Birger Møller-Pedersen and Kristen Nygaard 24 pl http://cs.au.dk/~beta 0 946 3 22832 1032 true 0 pl false b/Beta.bet 2007 simula eiffel "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." 2002 27 28 125 135868 Scandinavian School of object- orientation bet 156 0 29 4 false text 2635 http://www.rosettacode.org/wiki/Category:Beta Norway { *** Hello World in BETA ***} (# do 'Hello World!'->putLine #) ORIGIN '~beta/basiclib/betaenv' -- program: Descriptor -- (* Hello World in BETA *) (# do 'Hello World' -> putLine #) max: (# x, y, z: @integer enter (x, y) do (if x >= y // True then x -> z else y -> z if) exit z #) Beta // ' true true false true https://en.wikipedia.org/wiki/BETA_(programming_language) 6 0 https://hopl.info/showlanguage.prx?exp=1032 BETA 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 hypercard HyperCard 1987 Bill Atkinson 12 pl 0 947 0 22830 true 3 decker lil speedie pl false 1987 hypertalk delphi visual-basic html javascript livecode applescript 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. 2001 191 469 885 13567 Apple false 975 0 12 1 United States true https://en.wikipedia.org/wiki/HyperCard 12 6 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 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 binaryen binaryen 2015 Alon Zakai 11 compiler 0 1.39.1 948 0 12 22827 true 0 https://github.com/WebAssembly/binaryen compiler 2015 2024 2015 174 717 7314 677 false 2015 2025 9060 213 2560 139 1125480 WebAssembly wasm cpp javascript python c cmake yaml markdown bourne-shell json pascal assembly-language true 9679 0 23 1 false 1 true Various https://github.com/WebAssembly/binaryen 0 0 strips Strips 1969 14 pl 0 949 1 22827 2413 true 0 pl false 1971 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. 2005 119 39 1953958 Stanford University 615 0 15 9151 United States https://semanticscholar.org/paper/076ae14bfc68acdbaf2ab24913e152d49540e988 Actions: // move from X to Y _Move(X, Y)_ Preconditions: At(X), Level(low) Postconditions: not At(X), At(Y) // climb up on the box _ClimbUp(Location)_ Preconditions: At(Location), BoxAt(Location), Level(low) Postconditions: Level(high), not Level(low) // climb down from the box _ClimbDown(Location)_ Preconditions: At(Location), BoxAt(Location), Level(high) Postconditions: Level(low), not Level(high) // move monkey and box from X to Y _MoveBox(X, Y)_ Preconditions: At(X), BoxAt(X), Level(low) Postconditions: BoxAt(Y), not BoxAt(X), At(Y), not At(X) // take the bananas _TakeBananas(Location)_ Preconditions: At(Location), BananasAt(Location), Level(high) Postconditions: Have(bananas) // true true false https://en.wikipedia.org/wiki/STRIPS 0 0 https://hopl.info/showlanguage.prx?exp=2413 web-idl WebIDL 2012 15 idl 0 950 1 22827 true 0 idl 117 120 17 0 text webidl text/x-webidl source.webidl programming false 19 2014 2015 2 6 webidl.py 2012 idl-sl javascript Web IDL is an interface description language (IDL) format for describing application programming interfaces (APIs) that are intended to be implemented in web browsers. 2013 45 88 34 38541620 webidl webidl 445 0 17 text https://github.com/antlr/grammars-v4/tree/master/webidl "/* -*- Mode: linguist-disable-strategy-modeline-IDL; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this file, * You can obtain one at http://mozilla.org/MPL/2.0/. * * The origin of this IDL file is * http://www.w3.org/TR/css3-animations/#animation-events- * http://dev.w3.org/csswg/css3-animations/#animation-events- * * Copyright © 2012 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C * liability, trademark and document use rules apply. */ [Constructor(DOMString type, optional AnimationEventInit eventInitDict)] interface AnimationEvent : Event { readonly attribute DOMString animationName; readonly attribute float elapsedTime; readonly attribute DOMString pseudoElement; }; dictionary AnimationEventInit : EventInit { DOMString animationName = """"; float elapsedTime = 0; DOMString pseudoElement = """"; }; " Web IDL /* */ true true false https://en.wikipedia.org/wiki/Web_IDL 0 0 WebIDL https://github.com/andik/IDL-Syntax WebIDL bloom Bloom 2010 Neil Conway 13 pl http://bloom-lang.net/ 0 v0.9.8 951 0 3 22825 true 0 https://github.com/bloom-lang/bud pl 2011 2024 2010 56 60 854 100 false 2010 2020 3176 28 99 8 22622 2010 University of California Berkeley ruby markdown yaml true 1064 0 16 1 false 0 true United States https://github.com/bloom-lang/bud 0 0 bloom-lang.net pizza Pizza 2001 18 pl https://pizzacompiler.sourceforge.net 0 952 2 22823 2376 true 0 pl false p/Pizza.pizza 2001 java "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.""" 2004 44 22 94 509700 https://sourceforge.net/p/pizzacompiler/_list/tickets pizza 241 0 21 java text 4629 United Kingdom "class HelloWorld { public static void main(String[] args) { System.out.println(""Hello World""); } }" public final class Main { public int main(String args[]) { System.out.println( new Lines(new DataInputStream(System.in)) .takeWhile(nonEmpty) .map(fun(String s) -> int { return Integer.parseInt(s); }) .reduceLeft(0, fun(int x, int y) -> int { return x + y; })); while(x == 0) { map.create.newInstance() } } } Pizza System.out.println """" true true https://en.wikipedia.org/wiki/Pizza_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=2376 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 mond Mond 2014 Rohan Singh 15 pl https://web.archive.org/web/20160429013247/https://rohbot.net/mond/ 0 v0.10.0 953 1 10 22820 true 0 https://github.com/Rohansi/Mond pl 2014 2024 16 24 357 11 false 2014 2025 642 11 300 3 44864 A scripting language for C# which can be embedded in Lua-like manner. A scripting language for C# which can be embedded in Lua-like manner. https://github.com/Rohansi/Mond A scripting language for C# which can be embedded in Lua-like manner. csharp json typescript javascript css yaml razor markdown html xml true 442 0 51 1 false 0 true Canada // documentation can be found here: https://github.com/Rohansi/Mond/wiki seq range(start, end) { for (var i = start; i <= end; i++) yield i; } seq where(list, filter) { foreach (var x in list) { if (filter(x)) yield x; } } seq select(list, transform) { foreach (var x in list) yield transform(x); } fun toArray(list) { var array = []; foreach (var value in list) { array.add(value); } return array; } return range(0, 1000) |> where(x -> x % 2 == 0) |> select(x -> x / 2) |> toArray(); 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 https://github.com/Rohansi/Mond 0 0 yawl YAWL 2006 Dean Mao 16 pl http://www.yawlfoundation.org 0 v4.5.1 954 0 10 22819 true 0 https://github.com/yawlfoundation/yawl pl 2015 2024 2006 11 35 87 24 false Yet Another Workflow Language 2006 2025 2479 21 1594 470 499770 2006 2009 xpath xquery YAWL (Yet Another Workflow Language) is a workflow language based on workflow patterns. The language is supported by a software system that includes an execution engine, a graphical editor and a worklist handler. The system is available as Open source software under the LGPL license. Production-level uses of the YAWL system include a deployment by first:utility and first:telecom in the UK to automate front-end service processes, and by the Australian film television and radio school to coordinate film shooting processes. The YAWL system has also been used for teaching in more than 20 universities. 2006 22 22 68 4838131 java xml java-server-pages xsd sql css html javascript markdown bourne-shell true 345 0 26 1 false 4 true text https://github.com/yawlfoundation/yawl https://en.wikipedia.org/wiki/YAWL 1 0 yawlfoundation.org year|publisher|title|authors|isbn13\n2009|Springer|Modern Business Process Automation: YAWL and its Support Environment||9783642031205 unity-engine Unity 2005 11 library 3d https://unity3d.com 0 955 0 22818 true 0 library false 213536 565 2005 2005 csharp linux ia-32 arm boo javascript opengl webgl metal cg hlsl ios android Unity is a cross-platform game engine developed by Unity Technologies, first announced and released in June 2005 at Apple Inc.'s Worldwide Developers Conference as an OS X-exclusive game engine. As of 2018, the engine has been extended to support 27 platforms. The engine can be used to create both three-dimensional and two-dimensional games as well as simulations for its many platforms. Several major versions of Unity have been released since its launch, with the latest stable version being Unity 2018.2.13, released on October 18, 2018. 2006 1803 1258 1892 5462396 false 9036 0 11 text https://twitter.com/unity3d https://www.meetup.com/topics/unity https://en.wikipedia.org/wiki/Unity_(game_engine) 0 0 unity3d.com generate-ninja GN 2015 14 application 0 v0.4.1 956 1 11 22817 false 0 https://github.com/o-lim/generate-ninja application .gn 0 gn python python text/x-python source.gn data 2017 2024 2015 6 13 77 1 false 27 2015 2017 10 2 2013 2019 1782 278 798 71 136707 https://github.com/o-lim/generate-ninja/issues gn gni cpp python markdown json xml bourne-shell vim-script yaml lisp make objective-cpp true 595 0 25 false 0 true text Unknown "# Copyright 2014 The Chromium Authors. All rights reserved. # Use of this source code is governed by a BSD-style license that can be # found in the LICENSE file. import(""//build/toolchain/toolchain.gni"") declare_args() { # Indicates if the build should use the Chrome-specific plugins for enforcing # coding guidelines, etc. Only used when compiling with Clang. clang_use_chrome_plugins = is_clang && !is_nacl && !use_xcode_clang clang_base_path = ""//third_party/llvm-build/Release+Asserts"" } " https://github.com/o-lim/generate-ninja 0 0 https://github.com/devoncarew/language-gn GN smiles-format Smiles 1988 David Weininger 12 textDataFormat chemistry 0 957 1 22815 true 0 textDataFormat false Simplified molecular-input line-entry system 1980 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). 413 17590 28569 United States Environmental Protection Agency smi 2085 0 13 1 https://github.com/antlr/grammars-v4/tree/master/smiles United States CC(=O)NCCC1=CNc2c1cc(OC)cc2 CC(=O)NCCc1c[nH]c2ccc(OC)cc12 https://en.wikipedia.org/wiki/Simplified_molecular-input_line-entry_system 0 0 lamdu Lamdu 2011 Eyal Lotem and Yair Chuchem 12 pl https://lamdu.org 0 v0.8.1 958 0 13 22814 true 0 https://github.com/lamdu/lamdu pl 2011 2024 2011 55 66 1852 21 false 2011 2025 11233 30 459 35 210460 https://github.com/lamdu haskell json markdown nix bourne-shell yaml javascript bash xml dockerfile dhall html lisp true 2082 0 26 2 false 0 true Israel https://github.com/lamdu/lamdu 0 0 hexagony hexagony 2015 Martin Büttner 14 esolang 0 959 1 2 22814 true 0 https://github.com/m-ender/hexagony esolang 2015 2024 2015 15 7 563 1 false 2015 2021 32 6 20 1 1116 https://github.com/m-ender/hexagony/issues ruby markdown true 591 0 16 1 false https://tio.run/#hexagony text Germany https://riju.codes/hexagony H ; e ; l ; d ; * ; r ; o ; w l ; ; o ; * 4 3 3 ; @ . > ; 2 3 < \ 4 ; * / https://github.com/m-ender/hexagony 0 0 unicon Unicon 2008 Clint Jeffery 29 pl http://www.unicon.org/ 0 960 3 22814 true 0 pl false u/Unicon.icn unicon.py 2004 2008 unix uml unicode rebol curl "Unicon is a programming language designed by American computer scientist Clint Jeffery with collaborators including Shamim Mohamed, Jafar Al Gharaibeh, Robert Parlett and others. Unicon descended from Icon and a preprocessor for Icon called IDOL. Compared with Icon, Unicon offers better access to the operating system as well as support for object-oriented programming. Unicon began life as a merger of three popular Icon extensions: an OO preprocessor named Idol, a POSIX filesystem and networking interface, and an ODBC facility. The name is shorthand for ""Unified Extended Dialect of Icon."" Compared with Icon, many of the new features of Unicon are extensions to the I/O and system interface, to complement Icon's core control and data structures. Rather than providing lower-level APIs as-is from C, Unicon implements higher level and easier to use facilities, enabling rapid development of graphic- and network-intensive applications in addition to Icon's core strengths in text and file processing. classes and packages exceptions as a contributed class library - see mailing list loadable child programs monitoring of child programs dynamic loading of C modules (some platforms) multiple inheritance, with novel semantics ODBC database access dbm files can be used as associative arrays posix system interface 3D graphics true concurrency (on platforms supporting Posix threads) When run as a graphical IDE, the Unicon program ui.exe continues to offer links to Icon help. The official Unicon programming book in PDF format is a popular way to learn Unicon. The book includes an introduction to object-oriented development as well as UML. It includes useful chapters on topics such as the use of Unicon for CGI. Recent additions to Unicon include true concurrency. Unicon is not yet Unicode-compliant. There are opportunities posted at a help-wanted page." 2004 19 25 82 902180 icn icn true 116 0 33 icon 1 text http://www.rosettacode.org/wiki/Category:Unicon Unicon "procedure main() w := open(""test UNICON window"", ""g"") write(w, ""Hello, World!"") read(w) close(w) end" "procedure main() write(""Hello World"") end " Unicon "procedure main() w := open(""test UNICON window"", ""g"") write(w, ""Hello, World!"") read(w) close(w) end" Unicon # write """" true true true true true true false true https://en.wikipedia.org/wiki/Unicon_(programming_language) 1 2 unicon.org year|publisher|title|authors|isbn13\n2011||Unicon (programming Language)|Lambert M. Surhone|9786135234947 year|title|doi|citations|influentialCitations|authors|paperId\n2001|Goal-directed object-oriented programming in Unicon|10.1145/372202.372347|3|0|C. Jeffery|09e1945238747b4f1a1327f1f6a2e0638703afc8\n2006|Adding High Level VoIP Facilities to the Unicon Language|10.1109/ITNG.2006.24|2|0|Ziad Al-Sharif and C. Jeffery|150bdbcaf859f03c7e7eb796450d87e38e59ea8e ucl UCL 2013 12 dataNotation 0 0.9.2 961 1 13 22812 true 0 https://github.com/vstakhov/libucl dataNotation 2013 2024 2013 51 138 1603 74 false Universal Configuration Language 2013 2024 1125 57 171 4 38270 json c rescript bourne-shell python make markdown m4 cmake yaml haskell lua cpp true 2075 0 25 false 0 true text "param = value; section { param = value; param1 = value1; flag = true; number = 10k; time = 0.2s; string = ""something""; subsection { host = { host = ""hostname""; port = 900; } host = { host = ""hostname""; port = 901; } } }" https://github.com/vstakhov/libucl 0 0 cycript Cycript 2008 19 pl http://www.cycript.org/ 0 962 1 22809 true 0 pl 49 66 70 0 javascript javascript text/javascript source.js programming false 1133 2013 2018 1 103 2009 SaurikIT, LLC cy 201 0 22 text United States https://git.saurik.com/cycript.git "(function(utils) { // Load C functions declared in utils.loadFuncs var shouldLoadCFuncs = true; // Expose the C functions to cycript's global scope var shouldExposeCFuncs = true; // Expose C constants to cycript's global scope var shouldExposeConsts = true; // Expose functions defined here to cycript's global scope var shouldExposeFuncs = true; // Which functions to expose var funcsToExpose = [""exec"", ""include"", ""sizeof"", ""logify"", ""apply"", ""str2voidPtr"", ""voidPtr2str"", ""double2voidPtr"", ""voidPtr2double"", ""isMemoryReadable"", ""isObject"", ""makeStruct""]; // C functions that utils.loadFuncs loads var CFuncsDeclarations = [ // ""void *calloc(size_t num, size_t size)"", // ""char *strcpy(char *restrict dst, const char *restrict src)"", ""char *strdup(const char *s1)"", ""void* memset(void* dest, int ch, size_t count)"", // ""FILE *fopen(const char *, const char *)"", ""int fclose(FILE *)"", ""size_t fread(void *restrict, size_t, size_t, FILE *restrict)"", ""size_t fwrite(const void *restrict, size_t, size_t, FILE *restrict)"", // ""mach_port_t mach_task_self()"", ""kern_return_t task_for_pid(mach_port_name_t target_tport, int pid, mach_port_name_t *tn)"", ""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)"", ""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)"", ""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)"", ]; /* Replacement for eval that can handle @encode etc. Usage: cy# utils.exec(""@encode(void *(int, char))"") @encode(void*(int,char)) */ utils.exec = function(str) { var mkdir = @encode(int (const char *, int))(dlsym(RTLD_DEFAULT, ""mkdir"")); var tempnam = @encode(char *(const char *, const char *))(dlsym(R" // /* */ true true true false 0 0 cycript.org Cycript https://github.com/atom/language-javascript Cycript hiveql HiveQL 2011 19 queryLanguage https://hive.apache.org 0 963 2 22809 true 0 queryLanguage 135 143 502 sql source.hql programming false 37 2014 2017 1 3 SQL-like query language interface called the Hive query language. While based on SQL, HiveQL does not strictly follow the full SQL-92 standard. Internally, a compiler translates HiveQL statements into a directed acyclic graph of MapReduce, Tez, or Spark jobs, which are submitted to Hadoop for execution. SQL-like query language interface called the Hive query language. While based on SQL, HiveQL does not strictly follow the full SQL-92 standard. Internally, a compiler translates HiveQL statements into a directed acyclic graph of MapReduce, Tez, or Spark jobs, which are submitted to Hadoop for execution. SQL-like query language interface called the Hive query language. While based on SQL, HiveQL does not strictly follow the full SQL-92 standard. Internally, a compiler translates HiveQL statements into a directed acyclic graph of MapReduce, Tez, or Spark jobs, which are submitted to Hadoop for execution. q hql 201 0 20 text https://github.com/antlr/grammars-v4/tree/master/sql/hive/v2 https://en.wikipedia.org/wiki/Apache_Hive#HiveQL 4 CREATE TABLE word_counts AS 5 SELECT word, count(1) AS count FROM 6 (SELECT explode(split(line, '\s')) AS word FROM docs) temp 7 GROUP BY word 8 ORDER BY word; set hive.mapred.mode=nonstrict; set hive.exec.dynamic.partition=true; set hive.exec.dynamic.partition.mode=nonstrict; -- SORT_QUERY_RESULTS create table nzhang_t1 like srcpart; create table nzhang_t2 like srcpart; FROM srcpart INSERT OVERWRITE TABLE nzhang_t1 PARTITION (ds, hr) SELECT key, value, ds, hr WHERE ds = '2008-04-08' AND hr = '11' INSERT OVERWRITE TABLE nzhang_t2 PARTITION (ds, hr) SELECT key, value, ds, hr WHERE ds = '2008-04-08' and hr = '12' GROUP BY key, value, ds, hr; show partitions nzhang_t1; show partitions nzhang_t2; select * from nzhang_t1; select * from nzhang_t2; -- true true false https://github.com/EDS-APHP/HiveQLKernel 0 0 hive.apache.org HiveQL https://github.com/adidonato/language-hql HiveQL spark Apache Spark 2012 Matei Zaharia 13 application 0 964 0 1 22808 false 0 application false Apache Spark is a unified analytics engine for large-scale data processing. It provides high-level APIs in Java, Scala, Python, and R, and an optimized engine that supports general execution graphs. It also supports a rich set of higher-level tools including Spark SQL for SQL and structured data processing, pandas API on Spark for pandas workloads, MLlib for machine learning, GraphX for graph processing, and Structured Streaming for incremental computation and stream processing. Apache Spark is a unified analytics engine for large-scale data processing. It provides high-level APIs in Java, Scala, Python, and R, and an optimized engine that supports general execution graphs. It also supports a rich set of higher-level tools including Spark SQL for SQL and structured data processing, pandas API on Spark for pandas workloads, MLlib for machine learning, GraphX for graph processing, and Structured Streaming for incremental computation and stream processing. University of California Berkeley Apache Spark is a unified analytics engine for large-scale data processing. It provides high-level APIs in Java, Scala, Python, and R, and an optimized engine that supports general execution graphs. It also supports a rich set of higher-level tools including Spark SQL for SQL and structured data processing, pandas API on Spark for pandas workloads, MLlib for machine learning, GraphX for graph processing, and Structured Streaming for incremental computation and stream processing. scala true 1020 0 14 1 false https://spark.apache.org/documentation.html https://spark-packages.org/ United States https://en.wikipedia.org/wiki/Apache_Spark 0 0 monte monte 2014 26 pl 0 965 1 13 22807 true 0 https://github.com/monte-language/monte pl 2014 2024 2008 11 11 78 12 false m/Monte.mt monte.py 2008 2020 1029 22 76 4 14763 Monte is a dynamic programming language inspired by Python and E. Monte is a dynamic programming language inspired by Python and E. https://github.com/monte-language Monte is a dynamic programming language inspired by Python and E. mt mt restructuredtext mathematica python json haskell xml make lisp css yaml markdown nix html true 134 0 41 false text 8540 http://www.rosettacode.org/wiki/Category:Monte United States "traceln(""Hello World"") " Monte Monte https://github.com/monte-language/monte traceln """" true true true true true false true 15 0 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 sqr Structured Query Reporter 1980 16 pl 0 966 1 22801 true 0 pl false Structured Query Reporter 1980 sql c cobol 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. 2005 62 22 89 1862060 Gupta Technologies, LLC 330 0 17 text United States ! Hello World in SQR begin-program print 'Hello, World.' (1,1) end-program ! true true false https://en.wikipedia.org/wiki/SQR 2 0 SQR 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 fat FAT 1977 11 filesystem 0 967 0 22796 false 0 filesystem false File Allocation Table FAT32 FAT16 FAT12 1977 exfat ntfs linux freebsd ext4 ascii x86-assembly rexx java android 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. 2001 1568 1884 3163 53045 Microsoft && IBM && NCR Corporation && Seattle Computer Products && Compaq Computer Corporation && Digital Research && Novell && Caldera 7860 0 18 text 1690 United States https://en.wikipedia.org/wiki/File_Allocation_Table 0 0 json-graph-format json-graph-format 2014 14 jsonFormat http://jsongraphformat.info/ 0 1.0.0 968 1 4 22792 true 0 https://github.com/jsongraph/json-graph-specification jsonFormat 2014 2024 2014 21 36 446 8 false jgf 2014 2021 117 12 22 1 3706 2015 https://github.com/jsongraph json markdown yaml python true 568 0 18 false 1 true United States "{ ""graph"": { ""directed"": false, ""type"": ""graph type"", ""label"": ""graph label"", ""metadata"": { ""user-defined"": ""values"" }, ""nodes"": [ { ""id"": ""0"", ""type"": ""node type"", ""label"": ""node label(0)"", ""metadata"": { ""user-defined"": ""values"" } }, { ""id"": ""1"", ""type"": ""node type"", ""label"": ""node label(1)"", ""metadata"": { ""user-defined"": ""values"" } } ], ""edges"": [ { ""source"": ""0"", ""relation"": ""edge relationship"", ""target"": ""1"", ""directed"": false, ""label"": ""edge label"", ""metadata"": { ""user-defined"": ""values"" } } ] } }" https://github.com/jsongraph/json-graph-specification 0 0 jsongraphformat.info x86-isa X86 1978 11 isa 0 969 0 22790 true 0 isa false 1978 ia-32 mmx arm opencl x86-assembly linux solaris sparc powerpc "x86 is a family of backward-compatible instruction set architectures based on the Intel 8086 CPU and its Intel 8088 variant. The 8086 was introduced in 1978 as a fully 16-bit extension of Intel's 8-bit-based 8080 microprocessor, with memory segmentation as a solution for addressing more memory than can be covered by a plain 16-bit address. The term ""x86"" came into being because the names of several successors to Intel's 8086 processor end in ""86"", including the 80186, 80286, 80386 and 80486 processors. Many additions and extensions have been added to the x86 instruction set over the years, almost consistently with full backward compatibility. The architecture has been implemented in processors from Intel, Cyrix, AMD, VIA and many other companies; there are also open implementations, such as the Zet SoC platform. Nevertheless, of those, only Intel, AMD, and VIA hold x86 architectural licenses, and are producing modern 64-bit designs.The term is not synonymous with IBM PC compatibility, as this implies a multitude of other computer hardware; embedded systems, as well as general-purpose computers, used x86 chips before the PC-compatible market started, some of them before the IBM PC (1981) itself. As of 2018, the majority of personal computers and laptops sold are based on the x86 architecture, while other categories—especially high-volume mobile categories such as smartphones or tablets—are dominated by ARM; at the high end, x86 continues to dominate compute-intensive workstation and cloud computing segments." 2001 1476 2214 2728 34198 Intel && Advanced Micro Devices 7400 0 12 https://docs.kernel.org/x86/index.html na https://github.com/antlr/grammars-v4/tree/master/asm/asm8086 https://en.wikipedia.org/wiki/X86 22 5 year|publisher|title|authors|isbn13\n2010|Pearson|Assembly Language for X86 Processors|Irvine, Kip R.|9780133769401\n2010|Pearson|Assembly Language for X86 Processors|Irvine, Kip R.|9780136022121\n2014|Apress|Modern X86 Assembly Language Programming: 32-bit, 64-bit, SSE, and AVX|Kusswurm, Daniel|9781484200650\n2018|Apress|Modern X86 Assembly Language Programming: Covers x86 64-bit, AVX, AVX2, and AVX-512|Kusswurm, Daniel|9781484240625\n2021|P|The X86 Microprocessors: Architecture and Programming (8086 to Pentium)|Lyla B Das|9788131732465\n2022|BPB Publications|Microprocessor X86 Programming [Feb 28, 2003] Venugopal, K. R. and Kumar, Raj|K.R.Venugopal, Rajkumar|9788170294580\n2011|Pearson Higher Ed|Assembly Language For X86 Processors|Kip R. Irvine|9780133002003\n2018|Apress|Modern X86 Assembly Language Programming: Covers x86 64-bit, AVX, AVX2, and AVX-512|Kusswurm, Daniel|9781484240632\n2014|Apress|Modern X86 Assembly Language Programming: 32-bit, 64-bit, SSE, and AVX|Kusswurm, Daniel|9781484200643\n2021|BPB Publications|Implementing Reverse Engineering: The Real Practice of X86 Internals, Code Calling Conventions, Ransomware Decryption, Application Cracking, Assembly ... Open Source Tools (English Edition)|Narula, Jitender|9789391030377\n2005|Prentice Hall|The Linux Kernel Primer: A Top-Down Approach for x86 and PowerPC Architectures|Rodriguez, Claudia Salzberg|9780131181632\n2016|Independently published|Computer Architecture & Programming of the Intel x86 Family|Stakem, Patrick|9781520263724\n2010T|PEARSON INDIA|X86 Microprocessors : 8086 To Pentium, Multicores, Atom And The 8051 Microcontroller - Architecture, Programming And Interfacing|Lyla B. Das|9789332536821\n2010|LAP Lambert Academic Publishing|X86 Assembly: Application of X86|Ramdianee, Fawzee|9783838335537\n2021|Machinery Industry Press|Modern x86 assembly language programming (2nd edition of the original book)(Chinese Edition)|[ MEI ] DAN NI ER · KA SI WO MU ( Daniel Kusswurm ) , JIANG HONG , YU QING SONG , YU JING YI|9787111686088\n2022|Apress|Modern Parallel Programming with C++ and Assembly Language: X86 SIMD Development using AVX, AVX2, and AVX-512|Kusswurm, Daniel|9781484279175\n20140605|Pearson Education (US)|Assembly Language for x86 Processor|Kip Irvine|9780133769470\n20190307|Pearson Education (US)|Assembly Language for x86 Processors|Kip Irvine|9780135381793\n2018|Springer Science+business Media,|Modern X86 Assembly Language Programming||\n1988|Prrb Publishing|Computer Architecture & Programming Of The Intel X86 Family|Patrick H. Stakem|9780972596657\n2014|Apress, Distributed To The Book Trade Worldwide By Springer Science+business Media New York|Modern X86 Assembly Language Programming: 32-bit, 64-bit, Sse, And Avx|Kusswurm, Daniel (author.)|9781484200650\n2014|Apress, Distributed To The Book Trade Worldwide By Springer Science+business Media New York|Modern X86 Assembly Language Programming: 32-bit, 64-bit, Sse, And Avx|Kusswurm, Daniel (author.)|9781484200650 year|title|doi|citations|influentialCitations|authors|paperId\n2009|Programming model for a heterogeneous x86 platform|10.1145/1542476.1542525|80|4|Bratin Saha and Xiaochen Zhou and Hu Chen and Ying Gao and Shoumeng Yan and M. Rajagopalan and J. Fang and Peinan Zhang and R. Ronen and A. Mendelson|3037617a223f0fc3c63ef91013e3c85227e43672\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\n2013|X86 Assembly Language and C Fundamentals|10.1201/b14582|4|0|Joseph Cavanagh|8f63cd5c20a7bc362172e1dd223a02b99fc61783\n2009|Saksham: Customizable x86 Based Multi-Core Microprocessor Simulator|10.1109/CICSYN.2009.41|3|1|A. Vasudeva and A. Sharma and Ashish Kumar|c10a3448286e755e7ca9b29340b7f5b4c9e86cf8\n2014|Modern X86 Assembly Language Programming|10.1007/978-1-4842-0064-3|3|0|Daniel Kusswurm|17e19a84e0e1298a2bdd36639c1e0fcc569a353a chrysalisp chrysaLisp 2015 Chris Hinsley 12 pl lisp 0 v1.3.9 970 1 10 22789 true 0 https://github.com/vygr/ChrysaLisp pl 2015 2024 2015 75 96 1608 3 false 2015 2025 9025 19 781 180 184147 Tao Group markdown lisp pascal svg powershell bourne-shell cpp c php make true 1916 0 22 1 false 1 true United Kingdom ";imports (import 'sys/lisp.inc) (import 'class/lisp.inc) (import 'gui/lisp.inc) (structure 'event 0 (byte 'win_close 'win_min 'win_max 'win_button)) (ui-tree window (create-window (+ window_flag_close window_flag_min window_flag_max)) nil (ui-element _ (create-flow) ('flow_flags (logior flow_flag_down flow_flag_fillw flow_flag_lasth)) (ui-element display (create-label) ('text ""0"" 'color argb_white 'flow_flags flow_flag_align_hright 'font (create-font ""fonts/OpenSans-Regular.ttf"" 24))) (ui-element _ (create-grid) ('grid_width 4 'grid_height 4 'color toolbar_col 'font (create-font ""fonts/OpenSans-Regular.ttf"" 42)) (each (lambda (text) (component-connect (ui-element _ (create-button) ('text (if (eql text ""C"") ""AC"" text))) event_win_button)) ""789/456*123-0=C+"")))) (gui-add (apply view-change (cat (list window 920 48) (view-pref-size (window-set-title (window-connect-close (window-connect-min (window-connect-max window event_win_max) event_win_min) event_win_close) ""Calculator""))))) (defun do_lastop () (cond ((eql lastop ""+"") (setq accum (+ accum num))) ((eql lastop ""-"") (setq accum (- accum num))) ((eql lastop ""*"") (setq accum (* accum num))) ((eql lastop ""/"") (if (/= num 0) (setq accum (/ accum num))))) accum) (defq id t accum 0 value 0 num 0 lastop nil) (while id (cond ((>= (setq id (get-long (defq msg (mail-read (task-mailbox))) ev_msg_target_id)) event_win_button) (defq op (get (view-find-id window (get-long msg ev_msg_action_source_id)) 'text)) (cond ((eql op ""AC"") (setq accum 0 value 0 num 0 lastop nil)) ((find op ""=+-/*"") (if lastop (setq value (do_lastop)) (setq value num accum num)) (setq lastop op num 0)) (t (cond ((= num 0) (unless (eql op ""0"")) (setq num (to-num op))) (t (setq num (to-num (cat (str num) op))))) (setq value num))) (set display 'text (str value)) (view-dirty (view-layout display))) ((= id event_win_close) ;close button (setq id nil)) ((= id event_win_min) ;min button (bind '(x y _ _) (view-get-bounds window)) (bind '(w h) (view-pref-size window)) (view-change-dirty window x y w h)) ((= id event_win_max) ;max button (bind '(x y _ _) (view-get-bounds window)) (view-change-dirty window x y 512 512)) (t (view-event window msg)))) (view-hide window)" https://github.com/vygr/ChrysaLisp 0 0 swi-prolog SWI Prolog 1987 12 pl http://www.swi-prolog.org/ 0 971 0 17 22786 true 0 https://github.com/SWI-Prolog/swipl-devel pl 2014 2024 49 168 933 126 false 1992 2025 33909 180 1912 106 465895 2001 1987 c prolog java rdf unix linux lisp emacs-editor "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)." 2005 54 33 154 1719280 prolog c cmake markdown bourne-shell bash tex html yaml csv json javascript perl make m4 xml python true 1909 0 29 false text https://github.com/SWI-Prolog/swipl-devel https://github.com/madmax2012/SWI-Prolog-Kernel https://en.wikipedia.org/wiki/SWI-Prolog 0 0 swi-prolog.org mbox EML 1974 13 textDataFormat 0 972 3 22786 true 0 textDataFormat 0 false 133 2016 2018 1 2 email.py 2005 rfc unix mime "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." 2002 151 63 205 67367 Internet Engineering Task Force eml mbox eml 975 0 13 text United States https://datatracker.ietf.org/doc/html/rfc822 From MAILER-DAEMON Fri Jul 8 12:08:34 2011 From: Author To: Recipient Subject: Sample message 1 This is the body. >From (should be escaped). There are 3 lines. From MAILER-DAEMON Fri Jul 8 12:08:34 2011 From: Author To: Recipient Subject: Sample message 2 This is the second body. "Return-Path: To: Mario Zaizar Subject: Testing Mario Zaizar' MIME E-mail composing and sending PHP class: HTML message From: nobody Reply-To: nobody Sender: nobody@example.org X-Mailer: http://www.phpclasses.org/mimemessage $Revision: 1.63 $ (mail) MIME-Version: 1.0 Content-Type: multipart/mixed; boundary=""652b8c4dcb00cdcdda1e16af36781caf"" Message-ID: <20050430192829.0489.nobody@example.org> Date: Sat, 30 Apr 2005 19:28:29 -0300 --69c1683a3ee16ef7cf16edd700694a2f Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable This is an HTML message. Please use an HTML capable mail program to read this message. --69c1683a3ee16ef7cf16edd700694a2f Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Testing Mario Zaizar' MIME E-mail composing and sending PHP class: H= TML message --69c1683a3ee16ef7cf16edd700694a2f-- --6a82fb459dcaacd40ab3404529e808dc Content-Type: image/gif; name=""logo.gif"" Content-Transfer-Encoding: base64 Content-Disposition: inline; filename=""logo.gif"" Content-ID: R0lGODlhlgAjAPMJAAAAAAAA/y8vLz8/P19fX19f339/f4+Pj4+Pz7+/v/////////////////// /////yH5BAEAAAkALAAAAACWACMAQwT+MMlJq7046827/2AoHYChGAChAkBylgKgKClFyEl6xDMg qLFBj3C5uXKplVAxIOxkA8BhdFCpDlMK1urMTrZWbAV8tVS5YsxtxmZHBVOSCcW9zaXyNhslVcto RBp5NQYxLAYGLi8oSwoJBlE+BiSNj5E/PDQsmy4pAJWQLAKJY5+hXhZ2dDYldFWtNSFPiXssXnZR k5+1pjpBiDMJUXG/Jo7DI4eKfMSmxsJ9GAUB1NXW19jZ2tvc3d7f4OHi2AgZN5vom1kk6F7s6u/p m3Ab7AOIiCxOyZuBIv8AOeTJIaYQjiR/kKTr5GQNE3pYSjCJ9mUXClRUsLxaZGciC0X+OlpoOuQo ZKdNJnIoKfnxRUQh6FLG0iLxIoYnJd0JEKISJyAQDodp3EUDC48oDnUY7HFI3wEDRjzycQJVZCQT Ol7NK+G0qgtkAcOKHUu2rNmzYTVqRMt2bB49bHompSchqg6HcGeANSMxr8sEa2y2HexnSEUTuWri SSbkYh7BgGVAnhB1b2REibESYaRoBgqIMYx59tFM9AvQffVG49P5NMZkMlHKhJPJb0knmSKZ6kSX JtbeF3Am7ocok6c7cM7pU5xcXiJJETUz16qPrzEfaFgZpvzn7h86YV5r/1mxXeAUMVyEIpnVUGpN RlG2ka9b3lP3pm2l6u7P+l/YLj3+RlEHbz1C0kRxSITQaAcilVBMEzmkkEQO8oSOBNg9SN+AX6hV z1pjgJiAhwCRsY8ZIp6xj1ruqCgeGeKNGEZwLnIwzTg45qjjjjz2GEA5hAUp5JBEFmnkkSCoWEcZ X8yohZNK1pFGPQS4hx0qNSLJlk9wCQORYu5QiMd7bUzGVyNlRiOHSlpuKdGEItHQ3HZ18beRRyws YSY/waDTiHf/tWlWUBAJiMJ1/Z0XXU7N0FnREpKM4NChCgbyRDq9XYpOplaKopN9NMkDnBbG+UMC QwLWIeaiglES6AjGARcPHCWoVAiatcTnGTABZoLPaPG1phccPv366mEvWEFSLnj+2QaonECwcJt/ e1Zw3lJvVMmftBdVNQS3UngLCA85YHIQOy6JO9N4eZW7KJwtOUZmGwOMWqejwVW6RQzaikRHX3yI osKhDAq8wmnKSmdMwNidSOof9ZG2DoV0RfTVmLFtGmNk+CoZna0HQnPHS3AhRbIeDpqmR09E0bsu soeaw994z+rwQVInvqLenBftYjLOVphLFHhV9qsnez8AEUbQRgO737AxChjmyANxuEFHSGi7hFCV 4jxLst2N8sRJYU+SHiAKjlmCgz2IffbLI5aaQR71hnkxq1ZfHSfKata6YDCJDMAQwY7wOgzhjxgj VFQnKB5uX4mr9qJ79pann+VcfcSzsSCd2mw5scqRRvlQ6TgcUelYhu75iPE4JejrsJOFQAG01277 7bjnrvvuvPfu++/ABy887hfc6OPxyCevPDdAVoDA89BHL/301Fdv/fXYZ6/99tx3Pz0FEQAAOw== --6a82fb459dcaacd40ab3404529e808dc " E-mail From MAILER-DAEMON Fri Jul 8 12:08:34 2011 From: Author To: Recipient Subject: Sample message 1 This is the body. >From (should be escaped). There are 3 lines. From MAILER-DAEMON Fri Jul 8 12:08:34 2011 From: Author To: Recipient Subject: Sample message 2 This is the second body. https://en.wikipedia.org/wiki/Mbox 0 0 https://github.com/mariozaizar/language-eml EML blade Blade 2011 15 template https://laravel.com/docs/5.7/blade 2 973 2 22785 true 2 ace cloc template 324 372 41201 0 text text.html.php.blade markup false 245 2014 2018 2 13 Laravel blade bladephp 201 0 17 blade blade.php text 5556 United States " App Name - @yield('title') @section('sidebar') This is the master sidebar. @show
@yield('content')
" @yield('title', 'We love GitHub') @stack('scripts') @stack('styles') @include('partials.nav') @yield('content')
@foreach($foo as $bar)
{{ $bar }}
@endforeach
{!! $raw_content !!} 1 0 Blade https://github.com/jawee/language-blade year|publisher|title|authors|isbn13\n2022|Titan Comics|Blade Runner: Origins Vol. 3: Burning (Blade Runner, 3)|Perkins, K and Brown, Mellow|9781787736429 Blade slice Slice 2011 19 pl 0 974 2 22782 true 0 pl 13 20 40 text source.slice programming false 14 2018 2018 1 5 ZeroC, Inc ice 200 0 23 ice text United States https://zeroc.com/products/ice // YellowPages.ice module YellowPages { class PersonDetails { string phoneNumber; optional(1) string address; } interface PhoneBook { PersonDetails find(string name); } } "#pragma once #ifndef SOME_TEST [[""java:package:linguist""]] #endif module Linguist { enum MyEnum { One, Two, Three } struct MyStruct { // An int int a; /* string */ string b; MyEnum e; } exception MyException { string e; } dictionary MyDict; sequence MyEnumSeq; class BaseClass { int value = -1; } class MyClass extends BaseClass { MyDict info; optional(1) string op; } interface MyInterface { void operationA(out bool valid); idempotent void operationB(int a); MyEnumseq getEnum(); [""cpp:const"", ""cpp:noexcept""] string getName(); } }" // /* */ true true true false 0 0 Slice https://github.com/zeroc-ice/vscode-slice Slice storyscript storyscript 2017 15 pl https://storyscript.com 0 975 1 22778 true 0 https://github.com/storyscript/welcome pl 2017 2019 2017 14 33 303 169 true 2010 Storyscript is a language, editor, database, infra and community all-in-one. Create holistic apps, tools and workflows blazing fast that power your business. Storyscript is a language, editor, database, infra and community all-in-one. Create holistic apps, tools and workflows blazing fast that power your business. Storyscript is a language, editor, database, infra and community all-in-one. Create holistic apps, tools and workflows blazing fast that power your business. true 404 0 16 "### Storyscript is a language, editor, database, infra and community all-in-one. Create holistic apps, tools and workflows blazing fast that power your business. ### # Pull data from a microservice output = service action key:value output = team/service action key:value # Discover and create services in the Storyscript Hub # Call a function output = function_name(key:value) # A Storyscript function # or another programming language # Call type methods output = variable.mutation(key:value) # Event streaming microservice when service action event key:value as output ... # run this block for every event # Types string = ""Hello"" integer = 1 number = 1.3 bool = true list = [""a"", ""b"", ""c""] map = {""apple"": ""red"", ""banana"": ""yellow""} regexp = /^foobar/ empty = null time = 1d35m # Destructuring { apple, banana } = map # apple = ""red"", banana = ""yellow"" # Conditions if one > 1 # ... else if one == 1 # ... else # ... # Loops foreach list as item # ... while true # ... # Functions function name input:int returns int # ... return input name(input:1) # >>> 1" https://twitter.com/storyscript_ https://github.com/storyscript/welcome # true true false 0 0 storyscript.com json-lambda JSON lambda 2017 Chris Done 14 queryLanguage 0 v0.0.5 976 1 3 22775 true 0 https://github.com/chrisdone/jl queryLanguage 2017 2024 2017 9 20 475 5 false jl 2017 2022 113 7 22 1 3041 "jl (""JSON lambda"") is a tiny functional language for querying and manipulating JSON." "jl (""JSON lambda"") is a tiny functional language for querying and manipulating JSON." https://chrisdone.com/ "jl (""JSON lambda"") is a tiny functional language for querying and manipulating JSON." haskell yaml markdown true 543 0 17 1 false 0 true England and Canada map (\o -> { sha: o.sha, ps: map _.sha o.parents }) | filter (\o -> length o.ps > 1) https://github.com/chrisdone/jl 0 0 jsoniq JSONiq 2011 17 queryLanguage http://www.jsoniq.org/ 0 977 3 22775 true 0 queryLanguage 386 423 153 0 jsoniq javascript application/json source.jsoniq programming false j/JSONiq 108 2015 2016 2 2 2011 xquery sql json xml isbn 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. 2013 6 11 14 40213347 https://groups.google.com/g/zorba-io-user jq 251 0 19 json text Unknown """Hello World"" " "(: Query for returning one database entry :) import module namespace req = ""http://www.28msec.com/modules/http-request""; import module namespace catalog = ""http://guide.com/catalog""; variable $id := (req:param-values(""id""), ""London"")[1]; variable $part := (req:param-values(""part""), ""main"")[1]; catalog:get-data-by-key($id, $part) " "for $p in collection(""persons"") return {$p(""firstName"")} {$p(""lastName"")} {$p(""age"")} " JSONiq """" true https://en.wikipedia.org/wiki/JSONiq 0 0 jsoniq.org JSONiq https://github.com/wcandillon/language-jsoniq JSONiq kona kona 2010 12 pl 0 978 1 7 22773 true 0 https://github.com/kevinlawler/kona pl 2010 2024 2010 57 138 1356 65 false 2010 2023 1562 49 86 3 15502 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. 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. https://github.com/kevinlawler/kona/issues 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. c bourne-shell make lisp markdown awk yaml true 1820 0 19 false United States http://www.hakank.org/k/ factorial:{*/1+!:x} fib1:{(x(|+\)\1 1)[;1]} fib2:{x{x,+/-2#x}/!2} fib_rec:{:[x<2;1;_f[x-1]+_f[x-2]]} maxsubsum:{|/0(0|+)\x} primes_to_n_sieve:{2_&{:[x@y;x&@[1,-1_ z#(1_ y#1),0;y;:;1];x]}/[x#1;2_!__ceil_sqrt x;x]} primes_to_n_sieve2:{:[x<4;,2;r,1_&~|/x#'~!:'r: _f[_ _ceil _sqrt x]]} https://github.com/kevinlawler/kona 0 0 sibilant Sibilant 2010 Jacob Rothstein 14 pl lisp https://sibilant.org/ 0 0.5.6 979 0 7 22773 true 0 https://github.com/jbr/sibilant pl 2010 2024 19 47 384 25 false 2010 2020 641 15 90 6 47731 https://github.com/jbr/sibilant/issues sibilant javascript markdown yaml json html scss css true 542 0 33 1 false 0 true United States assign def do each if lambda pipe set this var when https://github.com/jbr/sibilant 0 0 jolie Jolie 2006 Claudio Guidi and Fabrizio Montesi 16 pl http://jolie-lang.org/ 0 980 1 22773 true 0 pl 15 16 129 0 jolie text source.jolie programming false 35 2015 2017 5 6 Java Orchestration Language Interpreter Engine 2008 2006 java linux bpel xml c javascript 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. 2013 18 7 35 39210326 University of Bologna ol iol 311 0 17 2 text Italy "include ""common.iol"" include ""ui/swing_ui.iol"" include ""console.iol"" outputPort Exam { Location: Location_Exam Protocol: sodep Interfaces: ExamInterface } main { question.studentName = ""John""; question.examName = ""SPLG""; question.question = ""Random question""; makeQuestion@Exam( question )( answer ); showYesNoQuestionDialog@SwingUI( ""Do you want to accept answer "" + answer + "" ?"" )( decision ); message.studentName = ""John""; message.examName = ""SPLG""; if ( decision == 0 ) { pass@Exam( message ) } else { fail@Exam( message ) } } " https://twitter.com/jolielang https://en.wikipedia.org/wiki/Jolie_(programming_language) 0 0 jolie-lang.org Jolie https://github.com/fmontesi/language-jolie Jolie dokuwiki DokuWiki 2004 12 wikiMarkup https://www.dokuwiki.org/ 0 981 2 22771 true 1 txt2tags wikiMarkup false 2005 2004 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. 203 112 806169 https://github.com/splitbrain 1036 0 12 United States and Germany DokuWiki supports **bold**, //italic//, __underlined__ and ''monospaced'' texts. Of course you can **__//''combine''//__** all these. https://riju.codes/dokuwiki Hello, world! https://twitter.com/dokuwiki https://en.wikipedia.org/wiki/DokuWiki 0 0 dokuwiki.org quicklisp-pm quicklisp-pm 2010 Zach Beane 14 packageManager https://www.quicklisp.org/beta/ 0 982 0 2 22768 false 0 https://github.com/quicklisp/quicklisp-client packageManager 2010 2024 2010 27 73 291 76 false 1500 common-lisp 2010 2024 341 25 31 2 19651 https://github.com/quicklisp/quicklisp-client/issues lisp make true 537 0 16 1 false United States https://twitter.com/quicklisp https://github.com/quicklisp/quicklisp-client 0 0 zz zz 2019 Arvid E. Picciani 12 pl 0 983 1 7 22766 true 0 https://github.com/aep/zz pl 2019 2024 2019 40 52 1600 32 false drunk octopus 2019 2021 366 18 482 3 41332 toml rust bourne-shell markdown yaml html c true 1775 0 20 1 false "using ::{printf} export fn main() -> int { let r = Random{ num: 42, }; printf(""your lucky number: %u\n"", r.gen()); return 0; } struct Random { u32 num; } fn gen(Random *self) -> u32 { return self->num; }" https://github.com/aep/zz printf true 0 0 nymph Nymph 2017 Brandon Barber 18 pl 0 984 1 4 22764 true 0 https://github.com/maelswarm/nymph pl 2017 2024 2017 8 6 181 0 false 2017 2023 241 8 16 3 2232 https://github.com/maelswarm/nymph/issues n c make nemerle markdown true 208 0 25 1 false United States "#include #include class Mammal { + int population = 0; // Class Variable (+) - int height = 0, weight = 100; // Object Variable (-) + Mammal *init(int height, int weight) { // Class Method (+) Constructor this->height = height; this->weight = weight; Mammal->population++; return this; } - void print() { // Object Method (-) printf(""print instance properties...\n""); } }" https://github.com/maelswarm/nymph // printf true true true false 0 0 ibis Ibis 2015 Wes McKinney 11 library https://ibis-project.org/ 0 9.0.0 985 0 20 22762 true 0 https://github.com/ibis-project/ibis library 2015 2024 83 568 4671 274 false 2014 2025 9495 246 2375 146 273744 the portable Python dataframe library the portable Python dataframe library the portable Python dataframe library sql python json yaml javascript markdown bourne-shell toml svg nix visual-basic css lua dockerfile cpp scss xml r cmake ini true 6623 0 31 1 false 9 true https://github.com/ibis-project/ibis 0 0 mathcad Mathcad 1986 13 pl cad mathematics https://www.ptc.com/en/products/mathcad/ 0 986 0 22762 2215 true 0 pl false 1986 si mathematica maple 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. 2005 181 226 345 1730437 Mathsoft Engineering && Education, Inc && PTC Inc false 926 0 15 text United States https://en.wikipedia.org/wiki/Mathcad 7 0 https://hopl.info/showlanguage.prx?exp=2215 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 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 f-script F-Script 2009 Philippe Mougin 15 pl https://github.com/pmougin/F-Script 0 987 0 2 22760 5441 true 0 https://github.com/pmougin/f-script pl 2009 2024 2009 9 59 118 2 false 2009 2013 13 2 442 2 88968 2009 x86-isa smalltalk apl 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. 2004 14 43 56 899874 https://github.com/pmougin objective-c xml true 389 0 17 1 false text United States https://github.com/pmougin/f-script https://en.wikipedia.org/wiki/F-Script_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=5441 asymptote Asymptote 2004 Andy Hammerlindl and John C. Bowman and Tom Prince 18 application 0 988 2 22760 false 0 application 23 25 asy c_cpp clike text/x-kotlin source.c++ programming false graphics.py 2004 unix latex postscript pdf svg tex python 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). 2005 37 54 136 3469522 University of Alberta asy asy true 205 0 21 3 asy text http://www.rosettacode.org/wiki/Category:Asymptote Canada Asymptote https://riju.codes/asymptote "write(""Hello, world!""); " "import graph; import settings; outformat=""pdf""; size(300,300); // Function. real[] x1 = {-1.5,0}; real[] y1 = {0,0}; real[] x2 = {0,1.5}; real[] y2 = {1,1}; draw(graph(x1,y1),red+2); draw(graph(x2,y2),red+2); draw((0,0)--(0,1),red+1.5+linetype(""4 4"")); fill( circle((0,1),0.035), red); filldraw( circle((0,0),0.03), white, red+1.5); // Axes. xaxis( Label(""$x$""), Ticks(new real[]{-1,-0.5,0.5,1}), Arrow); yaxis( Label(""$y$""), Ticks(new real[]{0.5,1}), Arrow, ymin=-0.18, ymax=1.25); // Origin. labelx(""$O$"",0,SW);" true https://en.wikipedia.org/wiki/Asymptote_(vector_graphics_language) 2 0 Asymptote Asymptote 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 fpp Functional PHP Preprocessor 2018 Sascha-Oliver Prolic 15 pl https://github.com/prolic/fpp 0 v0.1.0 989 0 4 22758 true 0 https://github.com/prolic/fpp pl 2018 2024 16 26 285 5 false fpp 2018 2021 614 23 68 2 7137 https://www.sasaprolic.com/ fpp php markdown yaml json true 388 0 32 1 false 0 true Paraguay namespace use data bool string float int enum uuid guid event command https://github.com/prolic/fpp 0 0 son son 2017 Ian Grant Jeffries 15 textMarkup 0 990 0 4 22754 true 0 https://github.com/seagreen/Son textMarkup 2017 2024 2017 12 7 358 9 false 2017 2019 22 1 44 1 3021 A minimal subset of JSON for machine-to-machine communication A minimal subset of JSON for machine-to-machine communication https://github.com/seagreen/Son/issues A minimal subset of JSON for machine-to-machine communication svg haskell markdown yaml true 381 0 19 1 false text 1417 United States https://www.reddit.com/r/haskell/comments/5zdq5y/rfc_son_subset_of_json_for_machinetomachine/ https://github.com/seagreen/Son 0 0 parenscript Parenscript 2009 Manuel Odendahl and Edward Marco Baringer 15 pl lisp https://common-lisp.net/project/parenscript/ 0 991 0 2 22752 true 0 https://github.com/vsedach/Parenscript pl 2013 2024 2005 24 33 244 1 false 2005 2018 885 35 37 5 14367 https://gitlab.common-lisp.net/parenscript/parenscript/-/issues lisp html javascript true 380 0 19 2 false text United States and Italy https://github.com/vsedach/Parenscript https://gitlab.common-lisp.net/parenscript/parenscript 0 0 loomscript LoomScript 2013 18 pl http://loomsdk.com/ 0 992 1 22750 true 0 pl 4 7 16 0 text source.loomscript programming false 11 2013 2014 2 2 2013 https://theengine.co/ ls 201 0 21 text United States "package { import loom.Application; import loom2d.display.StageScaleMode; import loom2d.ui.SimpleLabel; /** The HelloWorld app renders a label with its name on it, and traces 'hello' to the log. */ public class HelloWorld extends Application { override public function run():void { stage.scaleMode = StageScaleMode.LETTERBOX; centeredMessage(simpleLabel, this.getFullTypeName()); trace(""hello""); } // a convenience getter that generates a label and adds it to the stage private function get simpleLabel():SimpleLabel { return stage.addChild(new SimpleLabel(""assets/Curse-hd.fnt"")) as SimpleLabel; } // a utility to set the label's text and then center it on the stage private function centeredMessage(label:SimpleLabel, msg:String):void { label.text = msg; label.center(); label.x = stage.stageWidth / 2; label.y = (stage.stageHeight / 2) - (label.height / 2); } } }" // /* */ true true true false 0 0 loomsdk.com LoomScript https://github.com/ambethia/Sublime-Loom LoomScript baysick baysick 2009 Michael Fogus 15 esolang http://blog.fogus.me/2009/03/26/baysick-a-scala-dsl-implementing-basic/ 0 993 1 2 22748 true 0 https://github.com/fogus/baysick esolang 2009 2024 2009 16 41 246 5 false 2009 2019 126 6 8 1 116 Cognitect scala markdown true 377 0 18 1 false United States "object SquareRoot extends Baysick { def main(args:Array[String]) = { 10 PRINT ""Enter a number"" 20 INPUT 'n 30 PRINT ""Square root of "" % ""'n is "" % SQRT('n) 40 END RUN } }" https://twitter.com/fogus https://github.com/fogus/baysick PRINT true 0 0 cuneiform cuneiform 2015 16 pl http://www.cuneiform-lang.org 0 3.0.5 994 1 5 22748 true 0 https://github.com/joergen7/cuneiform/ pl 2014 2024 17 16 230 8 false c/Cuneiform.cfl 2014 2025 562 11 11 3 758 2015 BiobankCloud cfl erlang yaml markdown dockerfile bash true 291 0 22 false 3 true European Union "def greet() -> in Bash *{ out=""Hello World"" }* ( greet()|out ); " Cuneiform https://github.com/joergen7/cuneiform/ """" true 0 0 cuneiform-lang.org 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 cell Cell 2017 25 pl http://cell-lang.net/ 0 995 2 1 22748 true 0 https://github.com/cell-lang/compiler pl 2017 2024 10 2 113 1 false 2017 2021 576 2 130 2 46816 2017 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. 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. https://github.com/cell-lang 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. markdown true 123 0 29 false text 695 Various reactive Thermostat { input: temperature: Float; output: on: Bool; state: // When the system is initialized, on is true if // and only if the current temperature exceeds 28°C on: Bool = temperature > 28.0; rules: // Switching on the air conditioner when // the temperature exceeds 28°C on = true when temperature > 28.0; // Switching it off when it falls below 24°C on = false when temperature < 24.0; } https://twitter.com/cell_lang https://github.com/cell-lang/compiler // true false true true true false 9 0 cell-lang.net 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 jayfor jayfor 2014 Felix Angell 13 pl https://ark-lang.github.io/ 0 996 0 6 22744 true 0 https://github.com/freefouran/jayfor pl 2014 2024 2014 40 47 676 45 false 2014 2019 3483 48 233 16 4998 https://github.com/ark-lang toml go markdown make yaml bourne-shell true 867 0 19 1 false Denmark and New Zealand and United Kingdom https://github.com/freefouran/jayfor 0 0 ark-lang.github.io 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 freemarker FreeMarker 2000 15 template 0 997 2 22741 true 0 template 3002 3564 5703 0 ftl ftl text.html.ftl programming false 25 2011 2015 2 7 FreeMarker2 2000 java html java-server-pages apache-velocity thymeleaf 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. 2005 31 6 123 1866752 https://freemarker.apache.org/mailing-lists.html ftl true 375 0 16 ftl text freemarker2 Various "<#ftl strip_text=true /> <#macro page title> ${title} <@metaTags /> <#nested /> <@footer /> <#--- Default meta tags --> <#macro metaTags> <#compress> <#macro footer> This page is using FreeMarker v${.version} " Hello Joe! You have the following messages: Tim: Please don't forget to bring the conference papers! Cindy: Can you give me a visit this afternoon? Richard: Don't forget the papers this time! https://en.wikipedia.org/wiki/Apache_FreeMarker 0 0 FreeMarker https://github.com/freemarker/FreeMarker.tmbundle FreeMarker quint Quint 2021 13 pl https://quint-lang.org/ 0 998 1 19 22740 true 0 https://github.com/informalsystems/quint pl 2021 2024 23 30 732 221 false 2021 2025 3786 40 564 66 131093 A modern and executable specification language. A modern and executable specification language. A modern and executable specification language. qnt typescript json markdown svg bourne-shell xml javascript make yaml nix java lisp tex python jsx html css protobuf vim-script true 864 0 34 tla false https://quint-lang.org/docs "/// A state variable to store the balance of each account var balances: str -> int pure val ADDRESSES = Set(""alice"", ""bob"", ""charlie"") action withdraw(account, amount) = { // Decrement balance of account by amount // Whoops, we forgot to check for enough balance balances' = balances.setBy(account, curr => curr - amount) } // ... /// Invariant: Account balances should never be negative val no_negatives = ADDRESSES.forall(addr => balances.get(addr) >= 0 )" https://github.com/informalsystems/quint 0 0 minid MiniD 2006 Jarrett Billingsley 24 pl http://www.dsource.org/projects/minid 0 999 2 22735 true 1 croc pl 0 0 text none programming false d.py 2006 d lua squirrel python io c 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. 2007 13 8 39 10965409 http://www.dsource.org/projects/minid minid 86 0 27 croc croc 1 text United States "module matrix local SIZE = 30 function mkmatrix(rows, cols) { local count = 1 local m = array.new(rows) for(i: 0 .. rows) { m[i] = array.new(cols) for(j: 0 .. cols) { ++count m[i][j] = count } } return m } function mmult(rows, cols, m1, m2, m3) { for(i: 0 .. rows) { for(j: 0 .. cols) { local val = 0 for(k: 0 .. cols) val += m1[i][k] * m2[k][j] m3[i][j] = val } } return m3 } function main(N) { local n = 1 if(isString(N)) n = toInt(N) local m1 = mkmatrix(SIZE, SIZE) local m2 = mkmatrix(SIZE, SIZE) local mm = mkmatrix(SIZE, SIZE) for(i: 0 .. n) mmult(SIZE, SIZE, m1, m2, mm) writefln(mm[0][0], "" "", mm[2][3], "" "", mm[3][2], "" "", mm[4][4]) }" MiniD "function first(x: array|string) = x[0] writeln(first([1, 2, 3])) // prints 1 writeln(first(""hello"")) // prints h writeln(first(45)) // error, invalid parameter type 'int'" // true true true true true true true false https://web.archive.org/web/20190311032913/https://en.wikipedia.org/wiki/MiniD 0 0 MiniD sather Sather 1990 Steve Omohundro 24 pl https://www.gnu.org/software/sather/ 0 1000 3 22735 1659 true 0 pl false s/Sather.sa 1990 eiffel clu common-lisp scheme cool rust c 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. 2001 21 31 96 28763 University of California Berkeley && University of Waikato && GNU project sa 126 0 28 1 false text http://www.rosettacode.org/wiki/Category:Sather United States and New Zealand "-- Hello World in Sather class HELLO is main is #OUT + ""Hello World!\n"" end end " "class MAIN is main is loop #OUT + ""Hello World\n"" end end end " upto!(once m:INT):SAME is i: INT := self; -- initialise i to the value of self, -- that is the integer of which this method is called loop if i>m then quit; -- leave the loop when i goes beyond m end; yield i; -- else use i as return value and stay in the loop i := i + 1; -- and increment end; end; Sather -- #OUT true true true false https://en.wikipedia.org/wiki/Sather 1 3 https://hopl.info/showlanguage.prx?exp=1659 Sather 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 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 attoparsec attoparsec 2010 13 library http://hackage.haskell.org/package/attoparsec 0 0.14.4 1001 0 6 22733 true 0 https://github.com/haskell/attoparsec library 2010 2024 20 93 513 27 false 2006 2024 901 57 88 2 9307 attoparsec is a fast Haskell parser combinator library, aimed particularly at dealing efficiently with network protocols and complicated text/binary file formats. attoparsec is a fast Haskell parser combinator library, aimed particularly at dealing efficiently with network protocols and complicated text/binary file formats. https://github.com/bos/attoparsec/issues attoparsec is a fast Haskell parser combinator library, aimed particularly at dealing efficiently with network protocols and complicated text/binary file formats. haskell json markdown make yaml c true 851 0 20 megaparsec false 0 true Republic of Ireland https://github.com/haskell/attoparsec 0 0 nial Nial 1981 Mike Jenkins 19 pl arrayLang 0 1002 2 22733 1242 true 1 u pl false n/Nial.ndf Nested Interactive Array Language 1981 "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." 2001 21 30 125 21571 Queen's University ndf 125 0 21 1 https://tio.run/#nial text http://www.rosettacode.org/wiki/Category:Nial Canada write 'Hello World'; bye quicksort is fork [ >= [1 first,tally], pass, link [ quicksort sublist [ < [pass, first], pass ], sublist [ match [pass,first],pass ], quicksort sublist [ > [pass,first], pass ] ] ] Nial write ' true true https://en.wikipedia.org/wiki/Nial 1 0 https://hopl.info/showlanguage.prx?exp=1242 year|publisher|title|authors|isbn13\n|National Library Of Canada|A Basis For Effective Logic Programming In Nial|Blevis, Eli B.|9780315304048 sixten Sixten 2014 Olle Fredriksson 13 pl 0 1003 1 5 22731 true 0 https://github.com/ollef/sixten pl 2017 2024 2014 49 26 757 37 false 2014 2020 1118 10 418 3 19782 Sixten is an experimental functional programming language where all data is unboxed by default. Functional programming with fewer indirections! Sixten is an experimental functional programming language where all data is unboxed by default. Functional programming with fewer indirections! https://github.com/ollef/sixten/issues Sixten is an experimental functional programming language where all data is unboxed by default. Functional programming with fewer indirections! haskell markdown vim-script yaml llvmir true 846 0 18 1 false Norway https://ollef.github.io/blog/posts/query-based-compilers.html type Equals a b where Refl : Equals a a https://github.com/ollef/sixten 0 0 reflex-framework reflex-framework 2015 12 framework https://reflex-frp.org/ 0 v0.6.4 1004 0 8 22729 false 0 https://github.com/reflex-frp/reflex framework 2014 2024 2015 62 143 1061 88 false 2015 2025 1595 97 90 3 15470 https://github.com/reflex-frp haskell nix markdown yaml json c bash xml true 1589 0 20 false 0 true United States https://github.com/reflex-frp/reflex 0 0 reflex-frp.org f F 1996 16 pl arrayLang 0 1005 2 22728 3460 true 0 pl false f/F.f95 f-sharp fstar fortran 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. 2004 52 18 59 1283488 The Fortran Company f95 280 0 18 text 213 http://www.rosettacode.org/wiki/Category:F United States "program hello print *, ""Hello World"" end program hello " program main ! Insert code here end program main F print """" true true https://en.wikipedia.org/wiki/F_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=3460 component-pascal COMPONENT PASCAL 1997 18 pl 0 1006 1 22723 1209 true 0 pl 128 132 13387 0 pascal pascal text/x-pascal source.pascal programming false 37 2005 2016 2 4 oberon.py www.oberon.ch cp cps cp cps 200 0 21 oberon-2 text Switzerland Component Pascal "MODULE ObxFact; (** project = ""BlackBox"" organization = ""www.oberon.ch"" contributors = ""Oberon microsystems"" version = ""System/Rsrc/About"" copyright = ""System/Rsrc/About"" license = ""Docu/BB-License"" changes = """" issues = """" **) IMPORT Stores, Models, TextModels, TextControllers, Integers; PROCEDURE Read(r: TextModels.Reader; VAR x: Integers.Integer); VAR i, len, beg: INTEGER; ch: CHAR; buf: POINTER TO ARRAY OF CHAR; BEGIN r.ReadChar(ch); WHILE ~r.eot & (ch <= "" "") DO r.ReadChar(ch) END; ASSERT(~r.eot & (((ch >= ""0"") & (ch <= ""9"")) OR (ch = ""-""))); beg := r.Pos() - 1; len := 0; REPEAT INC(len); r.ReadChar(ch) UNTIL r.eot OR (ch < ""0"") OR (ch > ""9""); NEW(buf, len + 1); i := 0; r.SetPos(beg); REPEAT r.ReadChar(buf[i]); INC(i) UNTIL i = len; buf[i] := 0X; Integers.ConvertFromString(buf^, x) END Read; PROCEDURE Write(w: TextModels.Writer; x: Integers.Integer); VAR i: INTEGER; BEGIN IF Integers.Sign(x) < 0 THEN w.WriteChar(""-"") END; i := Integers.Digits10Of(x); IF i # 0 THEN REPEAT DEC(i); w.WriteChar(Integers.ThisDigit10(x, i)) UNTIL i = 0 ELSE w.WriteChar(""0"") END END Write; PROCEDURE Compute*; VAR beg, end, i, n: INTEGER; ch: CHAR; s: Stores.Operation; r: TextModels.Reader; w: TextModels.Writer; attr: TextModels.Attributes; c: TextControllers.Controller; x: Integers.Integer; BEGIN c := TextControllers.Focus(); IF (c # NIL) & c.HasSelection() THEN c.GetSelection(beg, end); r := c.text.NewReader(NIL); r.SetPos(beg); r.ReadChar(ch); WHILE ~r.eot & (beg < end) & (ch <= "" "") DO r.ReadChar(ch); INC(beg) END; IF ~r.eot & (beg < end) THEN r.ReadPrev; Read(r, x); end := r.Pos(); r.ReadPrev; attr :=r.attr; IF (Integers.Sign(x) > 0) & (Integers.Compare(x, Integers.Long(MAX(LONGINT))) <= 0) THEN n := SHORT(Integers.Short(x)); i := 2; x := Integers.Long(1); WHILE i <= n DO x := Integers.Product(x, Integers.Long(i)); INC(i) END; Models.BeginScript(c.text, ""computation"", s); c.text.Delete(beg, end); w := c.text.NewWriter(NIL); w.SetPos(beg); w.SetAttr(attr); Write(w, x); Models.EndScript(c.text, s) END END END END Compute; END ObxFact." Component Pascal (* *) true true false 0 0 https://hopl.info/showlanguage.prx?exp=1209 Component Pascal https://github.com/textmate/pascal.tmbundle Component Pascal tcsh tcsh 1983 18 pl 0 1007 2 22723 2560 true 0 pl 0 0 Shell tcsh csh sh shell text/x-sh source.shell programming false t/TCSH.tcsh 243 2013 2018 31 shell.py tcsh csh tcsh tcsh csh 200 0 20 https://tio.run/#tcsh text United States "#!/bin/tcsh echo ""Hello World"" " Tcsh https://riju.codes/tcsh "echo ""Hello, world!"" " TCSH echo """" true true 3 0 https://hopl.info/showlanguage.prx?exp=2560 https://github.com/atom/language-shellscript 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 Tcsh clang Clang 2007 Chris Lattner 13 compiler https://clang.llvm.org/ 0 1008 0 1 22722 true 0 compiler false cpp true 813 0 17 c cpp objective-c 1 false https://clang.llvm.org/docs/ United States https://reddit.com/r/Clang https://en.wikipedia.org/wiki/Clang 0 0 lotusscript LotusScript 1996 20 pl 0 1009 1 22720 3547 true 0 pl false l/LotusScript.lss visual-basic 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. 2003 29 99 50 239268 Lotus Development Corporation lss 165 0 22 text http://www.rosettacode.org/wiki/Category:LotusScript United States "Sub Initialize Print ""Hello World"" End Sub " LotusScript Print """" true true false true https://en.wikipedia.org/wiki/LotusScript 6 0 https://hopl.info/showlanguage.prx?exp=3547 LotusScript 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 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 mlscript MLscript 2020 Luyu Cheng and Lionel Parreaux 16 pl https://hkust-taco.github.io/mlscript 0 1010 1 11 22718 true 0 https://github.com/hkust-taco/mlscript/ pl 2021 2024 6 25 170 30 false 2020 2024 2314 26 826 18 124383 https://hkust-taco.github.io/mlscript/ A step towards rethinking pattern matching to make it more powerful and natural to use. A step towards rethinking pattern matching to make it more powerful and natural to use. https://dl.acm.org/doi/pdf/10.1145/3689746 HKUST A step towards rethinking pattern matching to make it more powerful and natural to use. scala standard-ml typescript markdown json html javascript css nix yaml make true 273 0 34 ml ocaml haskell standard-ml scala rust 2 false China "type List[A] = Cons[A] | Nil class Cons[out A](head: A, tail: List[A]) { fun map: (A -> 'B) -> List['B] map(f) = Cons of f(head), tail.map(f) } module Nil { fun map(f) = Nil } fun (::) cons(x, xs) = Cons(x, xs) fun show(xs) = let rec go(xs) = if xs is Cons(h, Nil) then String(h) Cons(h, t) then join(String(h), "", "", go(t)) Nil then """" join(""["", go(xs), ""]"") let xs = 1 :: 2 :: 3 :: Nil show(xs) show(xs.map of x => succ(x)) " https://github.com/hkust-taco/mlscript/ 0 0 javacc JavaCC 1996 13 grammarLanguage https://javacc.org/ 0 1011 0 22716 true 0 grammarLanguage false 2012 1996 java yacc lex beanshell lucene-query-syntax antlr coco-r "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." 2003 47 43 103 402257 Sun Microsystems true 784 5 13 text https://github.com/antlr/grammars-v4/tree/master/javacc United States https://en.wikipedia.org/wiki/JavaCC 0 0 javacc.org javacc lingo Lingo 1988 17 pl 0 1012 2 22716 1640 true 0 pl false l/Lingo.lg4 1988 smalltalk hypertalk javascript actionscript 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. 2004 40 30 218 493076 MacroMind lg4 220 0 18 text http://www.rosettacode.org/wiki/Category:Lingo United States "Hello World in Lingo (Macromedia Director) on startmovie alert ""Hello World"" end " "on startmovie alert ""Hello World"" end " Lingo """" true false true https://en.wikipedia.org/wiki/Lingo_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=1640 Lingo qore Qore 2006 David Nichols 19 pl http://qore.org/ 0 1013 1 15 22712 true 0 https://github.com/qorelanguage/qore pl 2015 2024 2006 16 10 58 239 false q/Qore.q 2006 2025 14145 51 2146 62 679296 2008 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. 6 9 33850384 https://github.com/qorelanguage q qm qtest q cpp cmake bourne-shell make m4 yaml vim-script svg assembly-language xml html markdown json lisp css true 191 0 39 1 false Czech Republic "#!/usr/bin/env qore %exec-class HelloWorld class HelloWorld { constructor() { background $.say(""Hello World""); } private say($arg) { printf(""%s\n"", $arg); } }" Qore https://github.com/qorelanguage/qore printf """" true true https://en.wikipedia.org/wiki/Qore_(programming_language) 0 0 qore.org root-lib ROOT 1994 15 library https://root.cern.ch/ 0 1014 1 1 22710 true 0 library false 2018 linux solaris ia-32 postscript svg latex python matlab matplotlib scipy numpy perl-data-language perl r igor-pro 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 2004 67 63 407 1048909 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. 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. CERN 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. cpp true 356 0 16 false text Switzerland "#include ""Riostream.h"" void basic() { // read file $ROOTSYS/tutorials/tree/basic.dat // this file has 3 columns of float data TString dir = gROOT->GetTutorialDir(); dir.Append(""/tree/""); dir.ReplaceAll(""/./"",""/""); ifstream in; in.open(Form(""%sbasic.dat"",dir.Data())); Float_t x,y,z; Int_t nlines = 0; auto f = TFile::Open(""basic.root"",""RECREATE""); TH1F h1(""h1"",""x distribution"",100,-4,4); TNtuple ntuple(""ntuple"",""data from ascii file"",""x:y:z""); while (1) { in >> x >> y >> z; if (!in.good()) break; if (nlines < 5) printf(""x=%8f, y=%8f, z=%8f\n"",x,y,z); h1.Fill(x); ntuple.Fill(x,y,z); nlines++; } printf("" found %d points\n"",nlines); in.close(); f->Write(); }" https://github.com/root-mirror/root/tree/master/bindings/pyroot/JupyROOT https://en.wikipedia.org/wiki/ROOT 0 0 root.cern.ch roff ROFF 1971 Joe Ossanna and Ken Thompson 15 textMarkup 0 1015 2 22709 2453 true 1 nroff textMarkup 10595 12001 eqnrc mmn mmt troffrc troffrc-end 36672 true 0 groff or man or manpage or man page or man-page or mdoc or nroff or troff text troff text/troff text.roff markup false 351 2016 2018 8 3 Bell Labs 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 220 0 17 troff 2 text United States .TH FOO 1 .SH NAME foo \- bar .SH SYNOPSIS .B foo .I bar .SH DESCRIPTION Foo bar .BR baz quux. .PP .B Foo bar baz. https://riju.codes/roff .PP Hello, world! https://en.wikipedia.org/wiki/Roff_(software) 0 0 https://hopl.info/showlanguage.prx?exp=2453 Roff https://github.com/Alhadis/language-roff Roff rouge Rouge 2012 Arlen Cuss 16 pl 0 1016 0 3 22705 true 0 https://github.com/vic/rouge pl 11 12 78 0 clojure clojure text/x-clojure source.clojure programming 2012 2022 2012 3 18 10 0 false 149 2013 2018 36 2012 2012 173 2 40 1 4540 https://web.archive.org/web/20120730121447/http://len.me rg ruby markdown bourne-shell true 267 0 19 1 false text 8822 Australia https://github.com/vic/rouge 0 0 Rouge https://github.com/atom/language-clojure Rouge asterisk Asterisk 1999 12 application https://wiki.asterisk.org/wiki/display/AST/Dialplan 0 1017 1 22704 false 0 application false 1999 c linux freebsd solaris "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." 2004 287 160 1053 946004 Sangoma Technologies Corporation true 1506 0 12 text asterisk United States ;; Hello world in Asterisk exten => s,1,NoOp(Hello World) https://en.wikipedia.org/wiki/Asterisk_(PBX) 0 0 unified-parallel-c UPC 2003 13 pl http://upc.lbl.gov/ 0 1018 0 22704 6133 true 2 chapel chapel pl 16668 0 C c_cpp clike text/x-csrc source.c programming false 359 2005 2018 23 2003 c split-c cilk chapel x10 Unified Parallel C (UPC) is an extension of the C programming language designed for high-performance computing on large-scale parallel machines, including those with a common global address space (SMP and NUMA) and those with distributed memory (e.g. clusters). The programmer is presented with a single shared, partitioned address space, where variables may be directly read and written by any processor, but each variable is physically associated with a single processor. UPC uses a single program, multiple data (SPMD) model of computation in which the amount of parallelism is fixed at program startup time, typically with a single thread of execution per processor. In order to express parallelism, UPC extends ISO C 99 with the following constructs: An explicitly parallel execution model A shared address space Synchronization primitives and a memory consistency model Explicit communication primitives, e.g. upc_memput Memory management primitivesThe UPC language evolved from experiences with three other earlier languages that proposed parallel extensions to ISO C 99: AC, Split-C, and Parallel C preprocessor (PCP). UPC is not a superset of these three languages, but rather an attempt to distill the best characteristics of each. UPC combines the programmability advantages of the shared memory programming paradigm and the control over data layout and performance of the message passing programming paradigm. 2004 38 157 77 1057616 UPC Consortium upc 411 0 13 text https://en.wikipedia.org/wiki/Unified_Parallel_C 1 0 https://hopl.info/showlanguage.prx?exp=6133 upc.lbl.gov https://github.com/textmate/c.tmbundle year|publisher|title|authors|isbn13\n2005-06-24|Wiley|UPC|Tarek El-Ghazawi and William Carlson and Thomas Sterling and Katherine Yelick|9780471478379 Unified Parallel C gentee gentee 2018 Alexey Krivonogov 19 pl http://gentee.org/ 0 v1.22.0 1019 1 5 22704 true 0 https://github.com/gentee/gentee pl 2018 2024 2018 4 16 132 2 false 2018 2025 278 3 163 1 7182 2001 Script programming language for automation. It uses VM and compiler written in Go (Golang). Script programming language for automation. It uses VM and compiler written in Go (Golang). https://github.com/gentee Script programming language for automation. It uses VM and compiler written in Go (Golang). go vim-script markdown make yaml true 185 0 25 1 false 1 true Russia "#!/usr/local/bin/gentee # stdin = 1024\n384\n0 // Copyright 2019 Alexey Krivonogov. All rights reserved. // Use of this source code is governed by a MIT license // that can be found in the LICENSE file. func gcd( int left right ) int { if right == 0 : return left return gcd( right, left % right ) } run { str input int left right Println(""This program finds the greatest common divisor by the Euclidean Algorithm."") while true { left = int( ReadString( ""Enter the first number ( enter 0 to exit ): "")) if left == 0 : break right = int( ReadString( ""Enter the second number: "")) Println(""GCD = \{ gcd( left, right )}"") } }" https://github.com/gentee/gentee // true true false 0 0 gentee.org hocon Hocon 2011 16 dataNotation https://github.com/lightbend/config/blob/master/HOCON.md 0 1020 1 22703 true 0 dataNotation false Human-Optimized Config Object Notation json java-properties puppet yaml HOCON, or Human-Optimized Config Object Notation is a format for human-readable data, and a superset of JSON and .properties. It is primarily used in conjunction with the Play framework, and is developed by Lightbend. It is also supported as a configuration format for .NET projects via Akka.NET and Puppet. 2015 49 10 17 46353833 https://github.com/lightbend 266 0 18 json text United States "// one array a : [ 1, 2, 3, 4 ] // two arrays that are concatenated a : [ 1, 2 ] [ 3, 4 ] // a later definition referring to an earlier // (see ""self-referential substitutions"" below) a : [ 1, 2 ] a : ${a} [ 3, 4 ]" // true true false https://en.wikipedia.org/wiki/HOCON 0 0 berkeleydb Berkeley DB 1991 Keith Bostic and Margo Seltzer 13 library 0 1021 0 13 22701 true 0 https://github.com/berkeleydb/libdb library false 2011 2012 19 2 1278 84 507725 1994 "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." 150 190 4706 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. 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. Sleepycat Software 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. tcl c bourne-shell cpp m4 html awk dtrace d perl make assembly-language csv true 772 0 27 2 false United States http://static.usenix.org/event/usenix99/full_papers/olson/olson.pdf https://github.com/berkeleydb/libdb https://en.wikipedia.org/wiki/Berkeley_DB 0 0 rc Rc 1989 Tom Duff 15 pl 0 1022 2 22701 true 0 pl false 1989 bourne-shell c algol bash "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 ""$@""." 2003 65 77 173 171918 Bell Labs 345 0 16 1 4637 United States https://riju.codes/rc echo Hello, world! a |[2] b # pipe only standard error of a to b — in Bourne shell as a 3>&2 2>&1 >&3 | b a <>b # opens b as a's standard input and standard output a <{b} <{c} # becomes a {standard output of b} {standard output of c} # true true false https://en.wikipedia.org/wiki/Rc 0 2 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 general-algebraic-modeling-system GAMS 1963 14 pl 0 1023 2 22700 true 0 pl 43 49 810 0 text none programming false gams 1963 algebraic-modeling-language The General Algebraic Modeling System (GAMS) is a high-level modeling system for mathematical optimization. GAMS is designed for modeling and solving linear, nonlinear, and mixed-integer optimization problems. The system is tailored for complex, large-scale modeling applications and allows the user to build large maintainable models that can be adapted to new situations. The system is available for use on various computer platforms. Models are portable from one platform to another. GAMS was the first algebraic modeling language (AML) and is formally similar to commonly used fourth-generation programming languages. GAMS contains an integrated development environment (IDE) and is connected to a group of third-party optimization solvers. Among these solvers are BARON, COIN-OR solvers, CONOPT, CPLEX, DICOPT, Gurobi, MOSEK, SNOPT, SULUM, and XPRESS. GAMS allows the users to implement a sort of hybrid algorithm combining different solvers. Models are described in concise, human-readable algebraic statements. GAMS is among the most popular input formats for the NEOS Server. Although initially designed for applications related to economics and management science, it has a community of users from various backgrounds of engineering and science. 2005 89 91 416 1438314 GAMS Development Corporation gms false 465 0 14 text United States *Basic example of transport model from GAMS model library $Title A Transportation Problem (TRNSPORT,SEQ=1) $Ontext This problem finds a least cost shipping schedule that meets requirements at markets and supplies at factories. Dantzig, G B, Chapter 3.3. In Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963. This formulation is described in detail in: Rosenthal, R E, Chapter 2: A GAMS Tutorial. In GAMS: A User's Guide. The Scientific Press, Redwood City, California, 1988. The line numbers will not match those in the book because of these comments. $Offtext Sets i canning plants / seattle, san-diego / j markets / new-york, chicago, topeka / ; Parameters a(i) capacity of plant i in cases / seattle 350 san-diego 600 / b(j) demand at market j in cases / new-york 325 chicago 300 topeka 275 / ; Table d(i,j) distance in thousands of miles new-york chicago topeka seattle 2.5 1.7 1.8 san-diego 2.5 1.8 1.4 ; Scalar f freight in dollars per case per thousand miles /90/ ; Parameter c(i,j) transport cost in thousands of dollars per case ; c(i,j) = f * d(i,j) / 1000 ; Variables x(i,j) shipment quantities in cases z total transportation costs in thousands of dollars ; Positive Variable x ; Equations cost define objective function supply(i) observe supply limit at plant i demand(j) satisfy demand at market j ; cost .. z =e= sum((i,j), c(i,j)*x(i,j)) ; supply(i) .. sum(j, x(i,j)) =l= a(i) ; demand(j) .. sum(i, x(i,j)) =g= b(j) ; Model transport /all/ ; Solve transport using lp minimizing z ; Display x.l, x.m ; $ontext #user model library stuff Main topic Basic GAMS Featured item 1 Trnsport model Featured item 2 Featured item 3 Featured item 4 Description Basic example of transport model from GAMS model library $offtext Sets i canning plants / seattle, san-diego / j markets / new-york, Chicago, topeka / ; Parameters a(i) capacity of plant i in cases / seattle 350 san-diego 600 / b(j) demand at market j in cases / new-york 325 Chicago 300 topeka 275 / ; Table d(i,j) distance in thousands of miles new-york Chicago topeka seattle 2.5 1.7 1.8 san-diego 2.5 1.8 1.4 ; Scalar f freight in dollars per case per thousand miles /90/ ; Parameter c(i,j) transport cost in thousands of dollars per case ; c(i,j) = f * d(i,j) / 1000 ; Variables x(i,j) shipment quantities in cases z total transportation costs in thousands of dollars ; Positive Variable x ; Equations cost define objective function supply(i) observe supply limit at plant i demand(j) satisfy demand at market j ; cost .. z =e= sum((i,j), c(i,j)*x(i,j)) ; supply(i) .. sum(j, x(i,j)) =l= a(i) ; demand(j) .. sum(i, x(i,j)) =g= b(j) ; Model transport /all/ ; Solve transport using lp minimizing z ; Display x.l, x.m ; https://en.wikipedia.org/wiki/General_Algebraic_Modeling_System 4 0 GAMS year|publisher|title|authors|isbn13\n2010|Wiley-Blackwell|Practical Financial Optimization: A Library of GAMS Models|Nielson, Soren S and Consiglio, Andrea|9781405133715\n20171204|Springer Nature|Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology|Neculai Andrei|9783319583563\n|Springer International Publishing :|Continuous Nonlinear Optimization For Engineering Applications In Gams Technology|Andrei, Neculai (author.)|9783319583563\n2013|Springer|Nonlinear Optimization Applications Using The Gams Technology (springer Optimization And Its Applications)|Neculai Andrei|9781461467960 GAMS haxelibs-pm Haxe Library Manager 2013 14 packageManager https://lib.haxe.org/ 0 4.1.0 1024 0 13 22700 false 0 https://github.com/HaxeFoundation/haxelib packageManager 2013 2024 26 75 170 119 false 1303 haxe 2006 2025 1565 68 316 5 30772 Haxe Foundation haxe json hcl html markdown sql bourne-shell yaml css svg xml cmake toml true 465 0 27 false 4 true Unknown https://github.com/HaxeFoundation/haxelib 0 0 lib.haxe.org never never 2018 14 pl https://never-lang.readthedocs.io 0 v2.3.9 1025 1 12 22697 true 0 https://github.com/never-lang/never pl 2018 2024 2018 19 8 431 2 false 2018 2024 604 7 786 4 60589 https://github.com/never-lang c yaml cmake markdown yacc lex xml html python make javascript bourne-shell true 464 0 26 false 2 true Spain func main() -> float { 100.0 * 1.8 + 32.0 } https://github.com/never-lang/never 1 0 never-lang.readthedocs.io year|publisher|title|authors|isbn13\n2005|Sams Publishing|Java After Hours: 10 Projects You'll Never Do at Work|Holzner, Steven|9780672327476 bbc-basic BBC BASIC 1981 Sophie Wilson 15 pl 0 1026 2 22689 true 0 pl false b/BBC BASIC.bbc basic.py 1981 basic bcpl acorn-atom comal arm assembly-language c 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. 2002 63 213 308 56273 BBC Micro bbc false 335 0 17 1 United Kingdom "PRINT ""Hello World"" " BBC Basic "IF INSTR(REPORT$,""VI"") THEN PRINT ""BASIC64"" ELSE PRINT ""BASIC""" BBC BASIC PRINT """" true true https://en.wikipedia.org/wiki/BBC_BASIC 0 0 mirc MIRC scripting language 1995 Khaled Mardam-Bey 16 pl http://mirc.com/ 0 1027 2 22684 true 0 pl false m/Mirc.mrc 1997 1995 ini "The mIRC scripting language, often unofficially abbreviated to ""mSL"", is the scripting language embedded in mIRC, an IRC client for Windows." 2003 37 69 313 310996 https://www.mirc.com mrc false 256 0 17 1 text mirc Great Britain echo -a Hello World ;Placed in a remote script ;When a user types Hello! in a channel, ;you answer back: Hello, [nickname]! on *:TEXT:Hello!:#:{ msg $chan Hello, $nick $+ ! } ;When a user types Hello! in a private message, ;you answer back: Hello, [nickname]! on *:TEXT:Hello!:?: { msg $nick Hello, $nick $+ ! } ;Here is a script which automatically gives voice to a user ;who joins a particular channel (The Bot or user should have HOP) on *:JOIN:#?: { mode $chan +v $nick } ;A bad word script on *:Text:die*:#: { .mode $chan +b $nick | kick $chan $nick Dont say that again } Mirc echo true https://en.wikipedia.org/wiki/MIRC_scripting_language 0 0 mirc.com claro Claro 2021 Jason Steving 19 pl https://docs.clarolang.com/ 0 v0.1.509 1028 0 16 22684 true 0 https://github.com/JasonSteving99/claro-lang pl 2020 2024 2020 4 10 138 11 false 2020 2024 673 7 1202 9 42311 2020 https://github.com/JasonSteving99 bazel java markdown starlark typescript json javascript css protobuf html yaml bourne-shell diff vim-script toml dockerfile true 177 0 37 1 false 0 true United States https://github.com/JasonSteving99/claro-lang # print true true true false 0 0 clarolang.com xlwings-editor xlwings-editor 2013 Felix Zumstein 11 library https://www.xlwings.org/ 0 0.31.3 1029 0 17 22683 true 0 https://github.com/xlwings/xlwings library 2014 2024 2013 122 490 2908 349 false 2013 2025 2840 71 366 55 100136 2013 python restructuredtext yaml visual-basic typescript html json javascript markdown cpp xml toml svg rust make handlebars ini true 4451 0 28 1 false 0 true https://github.com/xlwings/xlwings 0 0 xlwings.org grace Grace 2010 17 pl https://web.cecs.pdx.edu/~grace/ https://web.cecs.pdx.edu/~grace/doc/lang-spec/ 0 1030 2 22682 true 0 pl 12 15 27 0 text source.grace programming false 40 2011 2017 2 2 2010 The purpose of Grace is to allow novices to discover programming in the simplest possible way. Other famous languages such as Java or Python are widely used by professionals, but may be hard to assimilate for a beginner in programming. That is what the object-oriented Grace language is made for. The purpose of Grace is to allow novices to discover programming in the simplest possible way. Other famous languages such as Java or Python are widely used by professionals, but may be hard to assimilate for a beginner in programming. That is what the object-oriented Grace language is made for. Portland State University The purpose of Grace is to allow novices to discover programming in the simplest possible way. Other famous languages such as Java or Python are widely used by professionals, but may be hard to assimilate for a beginner in programming. That is what the object-oriented Grace language is made for. grace 201 0 17 text 4043 United States https://web.cecs.pdx.edu/~grace/doc/ "class cat { def name = ""Felix"" method getName { return name } }" "method ack (m : Number, n : Number) -> Number { print ""ack {m} {n}"" if (m < = 0) then {n + 1} elseif {n <= 0} then {ack((m -1), 1)} else {ack(m -1, ack(m, n-1))} }" 0 0 gracelang.org Grace https://github.com/zmthy/grace-tmbundle Grace godot-game-engine Godot 2014 12 library https://godotengine.org/ 0 1031 0 22681 true 0 library false 2008 2014 c linux freebsd ios android csharp python lua squirrel wasm webgl Godot is a 2D and 3D cross-platform compatible game engine released as open source software under the MIT license. It was initially developed for several companies in Latin America before its public release. The development environment runs on Windows, macOS, Linux, BSD and Haiku (both 32 and 64-bit) and can create games targeting PC, console, mobile and web platforms. 2014 276 198 250 42097999 https://github.com/godotengine true 1401 0 12 text Various https://twitter.com/godotengine https://en.wikipedia.org/wiki/Godot_(game_engine) 0 0 godotengine.org ston STON 2012 Sven Van Caekenberghe 14 application 0 1032 1 5 22678 false 0 https://github.com/svenvc/ston application 0 0 Smalltalk text source.smalltalk data 2012 2023 2012 16 32 135 2 false 22 2011 2017 7 5 2012 2024 163 15 734 1 5569 https://github.com/svenvc/ston/issues ston smalltalk json markdown yaml xml true 447 0 19 1 false text Belgium [1, 2, 3] https://github.com/svenvc/ston 0 0 https://github.com/tomas-stefano/smalltalk-tmbundle STON ratfor RATFOR 1976 18 pl http://sepwww.stanford.edu/doku.php?id=sep:software:ratfor 0 1033 3 22677 692 true 1 efl pl false r/RatFor.ratfor 1976 fortran c unix ratfiv 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. 2003 21 35 71 390257 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. 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. Stanford University 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. ratfor 126 0 20 text United States print *, 'Hello World' end https://riju.codes/ratfor PRINT *, 'Hello, world!' END IF (A .GT. B) THEN MAX = A ELSE MAX = B ENDIF RatFor print ' true true https://en.wikipedia.org/wiki/Ratfor 0 0 https://hopl.info/showlanguage.prx?exp=692 hakaru hakaru 2014 14 pl http://hakaru-dev.github.io/ 0 1034 1 13 22673 true 0 https://github.com/hakaru-dev/hakaru pl 2014 2024 2014 27 30 309 42 false 2014 2022 6842 43 639 15 Hakaru is a simply-typed probabilistic programming language, designed for easy specification of probabilistic models and inference algorithms. This type of language is useful for the development of machine learning algorithms and stochastic modeling. Hakaru is a simply-typed probabilistic programming language, designed for easy specification of probabilistic models and inference algorithms. This type of language is useful for the development of machine learning algorithms and stochastic modeling. Indiana University && McMaster University Hakaru is a simply-typed probabilistic programming language, designed for easy specification of probabilistic models and inference algorithms. This type of language is useful for the development of machine learning algorithms and stochastic modeling. haskell markdown xml yaml bourne-shell tex vim-script perl make python css lisp javascript true 444 0 28 false United States https://www.reddit.com/r/ProgrammingLanguages/comments/hejono/hakaru_a_simplytyped_probabilistic_programming/ def pulls(strength real): normal(strength, 1) def winner(a real, b real): a_pull <~ pulls(a) b_pull <~ pulls(b) return (a_pull > b_pull) alice <~ normal(0,1) bob <~ normal(0,1) carol <~ normal(0,1) match1 <~ winner(alice, bob) match2 <~ winner(bob, carol) match3 <~ winner(alice, carol) https://github.com/hakaru-dev/hakaru 0 0 hakaru-dev.github.io datafun datafun 2015 Michael Arntzenius 14 pl http://www.rntz.net/datafun/ 0 1035 0 13 22662 true 0 https://github.com/rntz/datafun pl 2015 2024 2015 42 15 384 2 false 2015 2022 2219 5 393 3 59231 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. 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. University of Birmingham 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. tex ocaml agda racket make markdown haskell bash bourne-shell python rust json toml true 436 0 27 1 false United Kingdom and Canada http://www.rntz.net/files/datafun.pdf https://github.com/rntz/datafun 0 0 nadesiko Nadesiko 2008 kujirahand 15 pl https://nadesi.com/ 0 3.6.5 1036 1 12 22662 true 0 https://github.com/kujirahand/nadesiko3 pl 2017 2024 7 19 231 248 false 2017 2025 3282 27 364 10 48635 https://kujirahand.com nako nako3 javascript html markdown json css yaml bourne-shell jsx php python bash dockerfile javascript true 317 0 30 1 false 3 true Japan # 取り込みテスト ●(AとBの)加算処理とは A+Bを戻す。ここまで。 https://github.com/kujirahand/nadesiko3 0 0 pep8 Pep8 2009 16 assembly 0 1037 2 5 22661 true 0 https://github.com/StanWarford/pep8 assembly 32 33 165 0 text source.pep8 programming 2015 2024 2009 8 4 23 0 false 3 2015 2017 7 1 2009 2019 490 8 265 24 38098 Pepperdine University pep cpp qt html xml javascript true 244 0 21 false text United States http://computersystemsbook.com/4th-edition/pep8/ " BR main num: .EQUATE 0 main: SUBSP 2,i DECI num,s if: LDA num,s ANDA 0x0001,i BRNE else STRO even_msg,d BR endIf else: STRO odd_msg,d endIf: ADDSP 2,i STOP odd_msg: .ASCII ""The number is: Odd\x00"" even_msg: .ASCII ""The number is: Even\x00"" .END" _start: LDA 0,i LDX 0,i LDA 20, i ADDA 51, i CPA 0,i BRLT s3 BR s4 s1: LDBYTEA s3, x NOTA STBYTEA s3, x ADDX 1,i CPX 12, i BRNE s1 s2: STOP s4: LDA 31, d LDX 50, d RET0 STOP s3: CPX -27746, d ANDX -8241, i SUBA -12337, sxf LDX -12289, sx .END https://github.com/StanWarford/pep8 0 0 Pep8 https://github.com/R4PaSs/Sublime-Pep8 Pep8 opencv OpenCV 2000 10 library https://opencv.org/ 0 1038 0 40 22659 true 0 https://github.com/opencv/opencv library 2012 2024 2657 55684 77208 2598 false 2010 2025 35968 2408 7602 541 3329234 OpenCV is a library of programming functions mainly for real-time computer vision. Originally developed by Intel, it was later supported by Willow Garage, then Itseez. The library is cross-platform and licensed as free and open-source software under Apache License 2. OpenCV is a library of programming functions mainly for real-time computer vision. Originally developed by Intel, it was later supported by Willow Garage, then Itseez. The library is cross-platform and licensed as free and open-source software under Apache License 2. OpenCV is a library of programming functions mainly for real-time computer vision. Originally developed by Intel, it was later supported by Willow Garage, then Itseez. The library is cross-platform and licensed as free and open-source software under Apache License 2. cpp c python markdown cmake java xml opencl html assembly-language objective-cpp javascript cuda swift json diff yaml xaml bourne-shell csharp protobuf glsl tex scala svg css bash gradle kotlin clojure prolog pascal perl objective-c hlsl powershell ini dockerfile idl make true 246690 0 50 false https://github.com/opencv/opencv https://en.wikipedia.org/wiki/OpenCV 0 0 ezhil Ezhil 2007 Muthu Annamalai 23 pl http://ezhillang.org 0 1039 3 22658 true 0 pl false ezhil.py 2021 2007 linux logo basic python 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. 2013 19 7 53 39845825 Google n n true 116 0 26 1 text http://www.rosettacode.org/wiki/Category:Ezhil United States "# Hello world in Ezhil பதிப்பி ""வணக்கம்!"" பதிப்பி ""உலகே வணக்கம்"" பதிப்பி ""******* நன்றி!. *******"" exit()" Ezhil https://riju.codes/ezhil "பதிப்பி ""வணக்கம், உலகமே!"" " https://twitter.com/ezhillang "நிரல்பாகம் yin(radius, color1, color2) #turtle_width(3) turtle_color(""black"") turtle_fill(True) turtle_circle(radius/2., 180) turtle_circle(radius, 180) turtle_left(180) turtle_circle( -1*radius/2.0 , 180 ) turtle_color(color1) turtle_fill(True) turtle_color(color2) turtle_left(90) turtle_up() turtle_forward(radius*0.375) turtle_right(90) turtle_down() turtle_circle(radius*0.125) turtle_left(90) turtle_fill(False) turtle_up() turtle_backward(radius*0.375) turtle_down() turtle_left(90) முடி நிரல்பாகம் main() #turtle_reset() yin(200, ""white"", ""black"") yin(200, ""black"", ""white"") turtle_ht() pause( ""Done! Hit enter to quit"", 5) முடி main()" # True False true true true false https://en.wikipedia.org/wiki/Ezhil_(programming_language) 0 0 ezhillang.org 1c-enterprise 1C Enterprise Script 2002 17 pl 0 1040 2 22655 true 0 pl 250 274 38669 0 text source.bsl programming false #/1C Enterprise 261 2015 2018 6 3 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 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 1C Company 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 bsl os 200 0 19 text Russia https://1c-dn.com/library/tutorials/practical_developer_guide_for_1c_enterprise_8_3/ "Message(""Hello World""); " "Каталог = ОбъединитьПути(ТекущийКаталог(), ""libs\oscript-library\src""); Загрузчик_Оригинал_ИмяФайла = ОбъединитьПути(Каталог, ""package-loader.os""); Файлы = НайтиФайлы(Каталог, , Ложь); Для Каждого ВыбФайл Из Файлы Цикл Если ВыбФайл.ЭтоФайл() Тогда Продолжить; КонецЕсли; Загрузчик_ИмяФайла = ОбъединитьПути(ВыбФайл.ПолноеИмя, ""package-loader.os""); Загрузчик_Файл = Новый Файл(Загрузчик_ИмяФайла); Если Загрузчик_Файл.Существует() Тогда Продолжить; КонецЕсли; КопироватьФайл(Загрузчик_Оригинал_ИмяФайла, Загрузчик_ИмяФайла); КонецЦикла;" 1C Enterprise Message """" true true 0 0 1C Enterprise https://github.com/xDrivenDevelopment/atom-language-1c-bsl.git 1C Enterprise cartocss CartoCSS 2010 17 pl 0 1041 1 22655 true 0 pl 289 341 477 0 Carto text source.css.mss programming false 19 2014 2015 1 2 Mapbox mss 200 0 20 text United States https://blog.mapbox.com/the-end-of-cartocss-da2d7427cf1 @marina-text: #576ddf; // also swimming_pool @wetland-text: darken(#017fff, 10%); /* Also for marsh */ @mud-text: darken(#aea397, 20%); @shop-icon: #ac39ac; @transportation-icon: #0092da; @transportation-text: #0066ff; @airtransport: #8461C4; @landcover-font-size: 10; @landcover-font-size-big: 12; @landcover-font-size-bigger: 15; @landcover-wrap-width-size: 25; @landcover-wrap-width-size-big: 35; @landcover-wrap-width-size-bigger: 45; @landcover-face-name: @oblique-fonts; @standard-wrap-width: 30; .points { [feature = 'tourism_alpine_hut'][zoom >= 13] { point-file: url('symbols/alpinehut.p.16.png'); point-placement: interior; } [feature = 'amenity_shelter'][zoom >= 16] { point-file: url('symbols/shelter2.p.16.png'); point-placement: interior; } [feature = 'amenity_atm'][zoom >= 17] { point-file: url('symbols/atm2.p.16.png'); point-placement: interior; } [feature = 'amenity_bank'][zoom >= 17] { point-file: url('symbols/bank2.p.16.png'); point-placement: interior; } [feature = 'amenity_bar'][zoom >= 17] { point-file: url('symbols/bar.p.20.png'); point-placement: interior; } [feature = 'amenity_bicycle_rental'][zoom >= 17] { point-file: url('symbols/rental_bicycle.p.20.png'); point-placement: interior; } [feature = 'highway_bus_stop'] { [zoom >= 16] { marker-file: url('symbols/square.svg'); marker-fill: @transportation-icon; marker-placement: interior; marker-width: 6; } [zoom >= 17] { marker-file: url('symbols/bus_stop.p.12.png'); marker-width: 12; } } [feature = 'amenity_bus_station'][zoom >= 16] { point-file: url('symbols/bus_station.n.16.png'); point-placement: interior; } [feature = 'highway_traffic_signals'][zoom >= 17] { marker-file: url('symbols/traffic_light.svg'); marker-fill: #0a0a0a; marker-placement: interior; } [feature = 'amenity_cafe'][zoom >= 17] { point-file: url('symbols/cafe.p.1 // /* */ true true true false 0 0 CartoCSS https://github.com/yohanboniface/carto-atom CartoCSS cpl CPL 1963 Christopher Strachey 15 pl 0 1042 1 22654 181 true 0 pl false Combined Programming Language 1963 algol-60 bcpl pop-2 b c 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. 2001 58 31 157 828614 University of Cambridge && University of London 310 0 17 1 text United Kingdom Max(Items, ValueFunction) = value of § (Best, BestVal) = (NIL, -∞) while Items do § (Item, Val) = (Head(Items), ValueFunction(Head(Items))) if Val > BestVal then (Best, BestVal) := (Item, Val) Items := Rest(Items) §⃒ result is Best §⃒ := true https://en.wikipedia.org/wiki/CPL_(programming_language) 1 2 https://hopl.info/showlanguage.prx?exp=181 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 title|year|author|goodreadsId|rating|ratings|reviews\nCpl (Programming Language)||Jesse Russell|54888258|0.0|0|0 bee bee 2019 Elucian Moise 12 pl https://sagecode.net/bee-lang/ 0 1043 0 6 22653 true 0 https://github.com/sage-code/bee pl 2019 2023 2019 2 0 0 0 false 2019 2024 676 5 94 3 10806 Sage-Code svg html xml javascript markdown yaml true 1280 0 18 1 false United States https://reddit.com/r/bee_lang https://github.com/sage-code/bee 0 0 vsxu VSXu 2004 13 visual http://vsxu.com 0 v0.6.3 1044 0 19 22649 true 0 https://github.com/vovoid/vsxu visual 2011 2024 2010 45 59 367 58 false 2010 2019 1579 42 2705 156 797440 2003 2004 linux puredata opengl "VSXu (VSX Ultra) is an OpenGL-based (hardware-accelerated), modular programming environment with its main purpose to visualize music/audio data and create 3D effects in real-time. Available for Windows and GNU/Linux. It is currently released as free software under terms of the GNU General Public License v2 and maintained by Vovoid Media Technologies AB. VSXu is built on a modular plug-in-based architecture so anyone can extend it and or make visualization presets (""visuals"" or ""states"")." 2009 12 8 68 21802981 cpp html cmake c bourne-shell xml glsl make m4 css markdown svg go python javascript yacc perl lex yaml true 668 0 32 false 0 true text https://github.com/vovoid/vsxu https://en.wikipedia.org/wiki/VSXu 0 0 vsxu.com umka Umka 2020 Vasiliy Tereshkov 11 pl 3 v1.5.1 1045 0 2 22648 true 3 cloc linux umka https://github.com/vtereshkov/umka-lang pl 2020 2024 2020 20 53 1010 34 false 2020 2025 943 20 171 36 28356 Umka is a statically typed embeddable scripting language. Umka is a statically typed embeddable scripting language. Umka is a statically typed embeddable scripting language. c umka true 1190 0 14 1 true 1 true um https://github.com/vtereshkov/umka-lang 0 0 solid-network Solid 2016 Tim Berners-Lee 13 network protocol https://solidproject.org/ 0 1046 0 4 22643 false 0 https://github.com/solid/specification network 2019 2024 51 42 476 189 false 2019 2025 1368 33 232 4 56397 Solid is an open standard for structuring data, digital identities, and applications on the Web. Solid is an open standard for structuring data, digital identities, and applications on the Web. Solid is an open standard for structuring data, digital identities, and applications on the Web. markdown html svg css true 657 0 17 1 false United States https://x.com/project_solid https://github.com/solid/specification https://en.wikipedia.org/wiki/Solid_(web_decentralization_project) 0 0 sublime-editor Sublime Text 2008 Jon Skinner 11 editor http://www.sublimetext.com 0 1047 0 22641 false 0 editor false 2007 2008 python linux textmate-editor regex wordpress emacs-editor vim visual-studio-code-editor 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. 2011 534 198 331 32794687 false 3691 0 11 1 na https://packagecontrol.io/ https://en.wikipedia.org/wiki/Sublime_Text 0 0 sublimetext.com cfengine CFEngine 1993 15 application https://cfengine.com 0 1048 2 22640 false 0 application false c/CFEngine.cf 2001 1993 linux solaris puppet 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. 2004 56 34 273 1109117 Oslo University cf true 301 0 15 text Norway "#!/var/cfengine/bin/cf-agent --no-lock body common control { bundlesequence => { ""hello_world"" }; } bundle agent hello_world { reports: any:: ""Hello World!""; }" "body common control { bundlesequence => { ""run"" }; } bundle agent run { reports: cfengine:: ""Hello World""; } " https://twitter.com/cfengine CFEngine https://en.wikipedia.org/wiki/CFEngine 1 0 cfengine.com 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 psyche-c psyche-c 2016 Leandro T. C. Melo 13 compiler 0 1049 0 9 22638 true 0 https://github.com/ltcmelo/psychec compiler 2016 2024 2016 17 39 526 10 false 2016 2025 640 9 446 13 101731 Psyche-c is a compiler for incomplete C code. It features a Hindley/Milner-inspired type inference engine for C. Psyche-c is a compiler for incomplete C code. It features a Hindley/Milner-inspired type inference engine for C. https://github.com/ltcmelo/psychec/issues Psyche-c is a compiler for incomplete C code. It features a Hindley/Milner-inspired type inference engine for C. cpp c python cmake markdown yaml haskell bourne-shell pascal true 653 0 22 1 false na Brazil https://github.com/ltcmelo/psychec 0 0 gorillascript GorillaScript 2013 Cameron Knight 14 pl https://ckknight.github.io/gorillascript 0 1050 0 1 22634 true 0 https://github.com/ckknight/gorillascript pl 2013 2024 22 34 300 51 false 2013 2013 728 5 95 17 165341 https://github.com/ckknight/gorillascript/issues gs javascript javascript true 409 0 60 1 false United States assert and bitand bitlshift bitnot bitor bitrshift biturshift bitxor by const delete else false haskey if in instanceof instanceofsome is isnt is-array! is-object! max min new not null or ownskey ownsor post-dec! post-inc! return then til to true typeof! throw? throw var xor https://github.com/ckknight/gorillascript 0 0 eex EEX 2012 14 template https://hexdocs.pm/eex/EEx.html 2 1051 2 22633 true 2 ace elixir template 34 0 HTML eex or heex or leex text htmlmixed text/html text.html.elixir markup false 278 2011 2018 1 47 EEx stands for Embedded Elixir. It allows you to embed Elixir code inside a string in a robust way. EEx stands for Embedded Elixir. It allows you to embed Elixir code inside a string in a robust way. Elixir Team EEx stands for Embedded Elixir. It allows you to embed Elixir code inside a string in a robust way. eex htmlheex htmlleex 201 0 15 eex text Various https://github.com/elixir-lang/elixir/commits/master/lib/eex/lib/eex.ex <%= if true do %> It is obviously true <% else %> This will never appear <% end %> "
Listing Books
<%= for book <- @books do %> <%# comment %> <% end %>

Title Summary
<%= 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?""] %>
<%= link ""New book"", to: book_path(@conn, :new) %>" 0 0 https://github.com/elixir-lang/elixir-tmbundle HTML+EEX scallop Scallop 2024 Ziyang Li 14 pl https://www.scallop-lang.org 0 1052 1 11 22632 true 0 https://github.com/scallop-lang/scallop pl 2022 2025 15 18 346 26 false 2022 2024 53 4 1209 8 106310 Neurosymbolic Programming with Scallop. Based on Datalog. Neurosymbolic Programming with Scallop. Based on Datalog. University of Pennsylvania Neurosymbolic Programming with Scallop. Based on Datalog. rust python markdown toml csv make json javascript yaml html xml true 406 0 26 datalog 1 false https://www.scallop-lang.org/doc/index.html rel path(x, y) = dash(x, y) rel path(x, y) = path(x, z), dash(z, y) rel is_connected() = dot(x), dot(y), path(x, y), x != y https://github.com/scallop-lang/scallop 0 0 pointless pointless 2020 Avery N. Nortonsmith 19 pl https://ptls.dev/ 0 v0.1.0 1053 1 4 22631 true 0 https://github.com/pointless-lang/pointless pl 2020 2024 2020 6 9 122 6 false pointless.py 2020 2020 108 6 81 15 53323 https://github.com/pointless-lang ptls dart markdown make yaml true 157 0 23 1 false 0 true https://tio.run/#https://ptls.dev/online United States https://news.ycombinator.com/item?id=22838255 "import ""chart.ptls"" as chart output = iterate(collatzStep, 175) |> takeWhile(greaterThan(1)) |> chart.scale(8) |> println collatzStep(n) = if n % 2 == 0 then n / 2 else n * 3 + 1" Pointless https://github.com/pointless-lang/pointless true true 0 0 ptls.dev juvix juvix 2017 Christopher Goes 13 pl https://juvix.org 0 v0.6.1 1054 0 14 22629 true 0 https://github.com/cryptiumlabs/juvix pl 2017 2024 2017 27 54 446 109 false 2021 2025 1990 18 3193 13 179027 2017 https://github.com/anoma/ haskell c json yaml markdown ocaml bourne-shell css make javascript dockerfile python xml svg true 628 0 27 1 false 0 true Various https://github.com/cryptiumlabs/juvix 0 0 juvix.org mastodon Mastodon 2016 Eugen Rochko 10 protocol microblogging https://joinmastodon.org 0 1055 0 21 22626 true 0 https://github.com/mastodon/mastodon protocol 2016 2024 708 6825 46477 4095 false 2016 2025 19910 1111 8829 285 669801 svg ruby yaml haml jsx javascript typescript json erb scss markdown sql html csv xml dockerfile bash css json5 bourne-shell diff true 68085 0 31 1 false https://github.com/mastodon/mastodon https://en.wikipedia.org/wiki/Mastodon_(social_network) 0 0 turbo-pascal Turbo Pascal 1983 Anders Hejlsberg 12 compiler 0 1056 1 22626 1372 true 0 compiler false 1983 x86-isa pascal assembly-language ucsd-pascal turbo-assembler microsoft-macro-assembler java modula-2 object-pascal free-pascal c visual-studio-editor delphi Turbo Pascal is a software development system that includes a compiler and an integrated development environment (IDE) for the Pascal programming language running on CP/M, CP/M-86, and MS-DOS, developed by Borland under Philippe Kahn's leadership. For versions 6 and 7 (last), both a lower-priced Turbo Pascal and more expensive Borland Pascal were produced; Borland Pascal was more oriented towards professional software development, with more libraries and standard library source code. The name Borland Pascal is also used more generically for Borland's dialect of the Pascal programming language, significantly different from Standard Pascal. Borland has released three old versions of Turbo Pascal free of charge because of their historical interest: the original Turbo Pascal (now known as 1.0), and versions 3.02 and 5.5 for DOS. 2002 240 237 852 38273 Borland 1220 0 12 1 na United States program WriteName; var i : Integer; {variable to be used for looping} Name : String; {declares the variable Name as a string} begin Write('Please tell me your name: '); ReadLn(Name); {ReadLn returns the string entered by the user} for i := 1 to 100 do begin WriteLn('Hello ', Name) end; readln; end. true true https://en.wikipedia.org/wiki/Turbo_Pascal 0 0 https://hopl.info/showlanguage.prx?exp=1372 michelson michelson 2017 Grégoire Henry 15 pl https://www.michelson-lang.com 0 1057 0 35 22626 true 0 https://gitlab.com/tezos/tezos pl false 2016 2025 76581 289 27179 762 8146275 2017 Dynamic Ledger Solutions Inc ocaml rust json wasm markdown restructuredtext bourne-shell javascript toml solidity assembly-language python c yaml make svg sql perl dockerfile hcl cpp diff graphql nix csv xml css html bash swift lisp tex typescript awk protobuf true 290 0 50 1 false https://gitlab.com/tezos/michelson-reference United States https://opentezos.com/michelson/ https://gitlab.com/tezos/tezos 0 0 michelson-lang.com 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 cat cat 2016 Christopher Diggins 15 pl 0 2.0.0 1058 3 11 22619 true 0 https://github.com/cdiggins/cat-language pl 2016 2024 2016 12 12 246 4 false c/cat.cat 2016 2018 14 2 428 2 107695 Cat is a higher-order stack-oriented language. Cat is a higher-order stack-oriented language. Cat is a higher-order stack-oriented language. cat cat javascript glsl csharp json markdown typescript css html xml svg yaml true 285 0 26 1 false 2 true Canada https://web.archive.org/web/20150205061802/http://cat-language.com/tutorial.html "1 1 + eq 2 [""As I expected!""] [""I need to be repaired!""] if" Hello World https://riju.codes/cat 72 101 108 108 111 44 32 119 111 114 108 100 33 10 cat https://github.com/cdiggins/cat-language https://github.com/cdiggins/cat-language 0 0 xs XS 2002 15 pl 0 1059 1 22619 true 0 pl 1767 1945 532 0 c_cpp clike text/x-csrc source.c programming false 359 2005 2018 1 23 2002 perl c pod "XS is a Perl foreign function interface through which a program can call a C or C++ subroutine. XS or xsub is an abbreviation of ""eXternal Subroutine"", where external refers to programming languages external to Perl. XS also refers to a glue language for specifying calling interfaces supporting such interfaces (see below)." 2005 13 9 52 1557123 xs 285 0 17 text http://www.rosettacode.org/wiki/Category:XS "/* * This software is copyright (C) by Nick Wellnhofer . * * This is free software; you can redistribute it and/or modify it under * the same terms as the Perl 5 programming language system itself. * * Terms of the Perl programming language system itself * * a) the GNU General Public License as published by the Free * Software Foundation; either version 1, or (at your option) any * later version, or * b) the ""Artistic License"" */ /* * Notes on memory management * * - A pointer to the Perl SV representing a node is stored in the * user data slot of `struct cmark_node`, so there's a 1:1 mapping * between Perl and C objects. * - Every node SV keeps a reference to the parent SV. This is done * indirectly by looking up the parent SV and increasing its refcount. * - This makes sure that a document isn't freed if the last reference * from Perl to the root node is dropped, as references to child nodes * might still exist. * - As a consequence, as long as a node is referenced from Perl, all its * ancestor nodes will also be associated with a Perl object. */ #define PERL_NO_GET_CONTEXT #include ""EXTERN.h"" #include ""perl.h"" #include ""XSUB.h"" #include #include #if CMARK_VERSION < 0x001000 #error libcmark 0.16.0 is required. #endif /* Fix prefixes of render functions. */ #define cmark_node_render_html cmark_render_html #define cmark_node_render_xml cmark_render_xml #define cmark_node_render_man cmark_render_man static SV* S_create_or_incref_node_sv(pTHX_ cmark_node *node) { SV *new_obj = NULL; while (node) { SV *obj; HV *stash; /* Look for existing object. */ obj = (SV*)cmark_node_get_user_data(node); if (obj) { /* Incref if found. */ SvREFCNT_inc_simple_void_NN(obj); if (!new_obj) { new_obj = obj; } break; } /* Create a new SV. */ o" /* */ true true false https://en.wikipedia.org/wiki/XS_(Perl) 0 0 XS https://github.com/textmate/c.tmbundle XS effekt Effekt 2020 Jonathan Immanuel Brachthäuser 14 pl https://effekt-lang.org/ 0 1060 1 1 22617 true 0 https://github.com/effekt-lang/effekt pl 2020 2024 9 14 310 123 false 2020 2025 4426 39 1057 22 33143 https://effekt-lang.org/quickstart.html A language with lexical effect handlers and lightweight effect polymorphism. A language with lexical effect handlers and lightweight effect polymorphism. Universität Tübingen A language with lexical effect handlers and lightweight effect polymorphism. effekt scala true 393 0 16 1 false def eager[R] { p: R / { Flip, Fail, Error } } = try { Success(p()) } with Flip { () => resume(true) match { case Failure(msg) => resume(false) case Success(res) => Success(res) case ParseError(msg) => ParseError(msg) } } with Fail { (msg) => Failure(msg) } with Error { (msg) => ParseError(msg) } https://github.com/effekt-lang/effekt 0 0 refal Refal 1968 Valentin Turchin 24 pl http://www.refal.net 0 1061 2 22614 595 true 0 pl false 1999 1966 prolog lisp "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." 2007 16 17 78 14926151 http://pespmc1.vub.ac.be/TURCHIN.html 101 0 27 1 text https://github.com/antlr/grammars-v4/tree/master/refal http://www.rosettacode.org/wiki/Category:Refal United States * Hello world in Refal $ENTRY Go { = ;} Hello { = ; } Squeeze { '__'e.1 = ; s.A e.1 = s.A ; = ; }; Refal * > " "« 0 @ Start with zero on the stack 1 10 @ Loop from 1 to 10 FOR I @ ""I"" is the local variable I + @ Add ""I"" to the running total NEXT @ Repeat... »" """" true https://en.wikipedia.org/wiki/RPL_(programming_language) 3 0 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 title|year|author|goodreadsId|rating|ratings|reviews\nAn Introduction to Hp48 System Rpl & Assembly Language Programming|1995|James Donnelly|20605176|0.0|0|0 rubygems-pm RubyGems 2018 Nick Quaranto 13 packageManager https://rubygems.org 0 1064 0 22609 false 0 packageManager false 30861856790 154445 ruby 2004 2018 "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." 114 149 2866386 https://github.com/rubygems 591 0 13 1 United States https://en.wikipedia.org/wiki/RubyGems 0 0 rubygems.org video video 2016 Leif Andersen 18 pl https://lang.video/ 0 v0.2.2 1065 0 4 22609 true 0 https://github.com/videolang/video pl 2017 2024 2016 12 12 126 18 false 2016 2019 932 6 88 3 19956 Video is a language for making movies. It combines the power of a traditional video editor with the capabilities of a full programming language. Video integrates with the Racket ecosystem and extensions for DrRacket to transform it into a non-linear video editor. Video is a language for making movies. It combines the power of a traditional video editor with the capabilities of a full programming language. Video integrates with the Racket ecosystem and extensions for DrRacket to transform it into a non-linear video editor. https://lang.video/community.html Video is a language for making movies. It combines the power of a traditional video editor with the capabilities of a full programming language. Video integrates with the Racket ecosystem and extensions for DrRacket to transform it into a non-linear video editor. .rkt racket markdown yaml bourne-shell true 170 0 23 1 false 0 true https://docs.racket-lang.org/video@video/index.html United States https://twitter.com/videolang https://github.com/videolang/video 0 0 lang.video hare Hare 2020 21 pl https://harelang.org/ 0 0.24.0 1066 2 6 22609 true 0 https://git.sr.ht/~sircmpwn/hare pl false h/Hare.ha 2021 2025 4311 119 963 7 8722 2020 Hare is a systems programming language designed to be simple, stable, and robust. Hare uses a static type system, manual memory management, and a minimal runtime. It is well-suited to writing operating systems, system tools, compilers, networking software, and other low-level, high performance tasks. Hare is a systems programming language designed to be simple, stable, and robust. Hare uses a static type system, manual memory management, and a minimal runtime. It is well-suited to writing operating systems, system tools, compilers, networking software, and other low-level, high performance tasks. https://harelang.org/community/ Hare is a systems programming language designed to be simple, stable, and robust. Hare uses a static type system, manual memory management, and a minimal runtime. It is well-suited to writing operating systems, system tools, compilers, networking software, and other low-level, high performance tasks. ha assembly-language make bourne-shell scheme markdown yaml true 120 0 30 false 0 true ha Various "use fmt; export fn main() void = { const greetings = [ ""Hello, world!"", ""¡Hola Mundo!"", ""Γειά σου Κόσμε!"", ""Привет, мир!"", ""こんにちは世界！"", ]; for (let i = 0z; i < len(greetings); i += 1) { fmt::println(greetings[i])!; }; };" "use fmt; export fn main() void = { fmt::println(""Hello World"")!; }; " Hare https://git.sr.ht/~sircmpwn/hare fmt::println """" true true 0 0 harelang.org passerine Passerine 2021 Isaac Cayton (slightknack) 12 pl https://www.passerine.io/ 0 v0.9.3 1067 0 4 22608 true 0 https://github.com/vrtbl/passerine pl 2020 2024 2020 25 38 1036 20 false 2020 2024 536 17 127 2 9133 https://github.com/vrtbl rust toml markdown svg true 1169 0 16 1 false 0 true United States https://github.com/vrtbl/passerine 0 0 tao-lang Tao 2020 Joshua Barretto 12 pl https://tao.jsbarretto.com/ 0 1068 1 7 22607 true 0 https://github.com/zesterer/tao pl 2020 2024 2020 13 23 1086 10 false 2020 2023 463 8 133 2 20382 A statically-typed functional language with polymorphism, typeclasses, sum types, pattern-matching, first-class functions, currying, good diagnostics, and much more! A statically-typed functional language with polymorphism, typeclasses, sum types, pattern-matching, first-class functions, currying, good diagnostics, and much more! A statically-typed functional language with polymorphism, typeclasses, sum types, pattern-matching, first-class functions, currying, good diagnostics, and much more! rust toml markdown svg scss html bourne-shell true 1165 0 19 1 false fn factorial = | 0 => 1 \ y ~ x + 1 => y * factorial(x) https://github.com/zesterer/tao 2 0 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 ohayo Ohayo 2017 Breck Yunits 19 pl dataFlow dataVis https://ohayo.breckyunits.com/ 0 20.1.0 1069 1 8 22605 true 0 https://github.com/breck7/ohayo pl 2017 2024 2017 9 5 132 56 false 2017 2024 202 4 384 14 635677 https://ohayo.breckyunits.com/ 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. 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. Breck's Lab 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. javascript json csv svg markdown css typescript html true true 153 0 28 r 1 false 20 true United States web.get ohayo/packages/samples/welcome.md parser text hidden markdown.toHtml templates.list challenge.list https://github.com/breck7/ohayo true 0 0 mcp Model Context Protocol 2024 12 protocol https://modelcontextprotocol.io 0 1070 0 1 22602 true 0 https://github.com/modelcontextprotocol/specification protocol 2024 2025 49 102 817 45 false 2024 2025 284 24 92 1 14466 The Model Context Protocol (MCP) is an open protocol that enables seamless integration between LLM applications and external data sources and tools. Whether you're building an AI-powered IDE, enhancing a chat interface, or creating custom AI workflows, MCP provides a standardized way to connect LLMs with the context they need. The Model Context Protocol (MCP) is an open protocol that enables seamless integration between LLM applications and external data sources and tools. Whether you're building an AI-powered IDE, enhancing a chat interface, or creating custom AI workflows, MCP provides a standardized way to connect LLMs with the context they need. Anthropic The Model Context Protocol (MCP) is an open protocol that enables seamless integration between LLM applications and external data sources and tools. Whether you're building an AI-powered IDE, enhancing a chat interface, or creating custom AI workflows, MCP provides a standardized way to connect LLMs with the context they need. typescript true 1149 0 13 false https://www.anthropic.com/news/model-context-protocol https://github.com/modelcontextprotocol/specification https://github.com/modelcontextprotocol/specification 0 0 caramel Caramel 2020 Leandro Ostera 12 pl https://caramel.run/ 0 v0.1.1 1071 0 24 22598 true 0 https://github.com/AbstractMachinesLab/caramel pl 2020 2024 2020 26 25 1050 21 false 2020 2022 688 10 4120 16 1821149 https://abstractmachines.dev ocaml markdown html erlang typescript vim-script yaml lisp make c javascript asciidoc bourne-shell reason css json diff python handlebars xml tex bash toml svg true 1137 0 36 1 false 0 true Sweden https://github.com/AbstractMachinesLab/caramel 0 0 yorick Yorick 1996 David H. Munro 25 pl http://yorick.github.com 0 1072 3 22598 2637 true 0 pl false y/Yorick.i 1996 c fortran perl-data-language Yorick is an interpreted programming language designed for numerics, graph plotting, and steering large scientific simulation codes. It is quite fast due to array syntax, and extensible via C or Fortran routines. It was created in 1996 by David H. Munro of Lawrence Livermore National Laboratory. 2003 14 10 79 175271 Lawrence Livermore i i i true 91 0 28 1 text Yorick http://www.rosettacode.org/wiki/Category:Yorick yorick "#!/usr/bin/yorick -batch print, ""Hello World""; " https://riju.codes/yorick "write, ""Hello, world!"" " > x=[[1,2,3],[4,5,6]] > x [[1,2,3],[4,5,6]] > y=[[7,8],[9,10],[11,12]] > x(,+)*y(+,) [[39,54,69],[49,68,87],[59,82,105]] > x(+,)*y(,+) [[58,139],[64,154]] Yorick print """" true true https://en.wikipedia.org/wiki/Yorick_(programming_language) 1 1 https://hopl.info/showlanguage.prx?exp=2637 Yorick yorick.github.com year|publisher|title|authors|isbn13\n||Yorick (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133269828 "year|title|doi|citations|influentialCitations|authors|paperId\n1976|""Review of """"Coputational Semantics: An Introduction to Artificial Intelligence and Natural Language Comprhension by Eugue Charniak and Yorick Wilks, Eds."""" North-Holland, Amer. Elsevier.""|10.1145/1045276.1045281|5|0|M. Rychener|a218cf15a4920446d1f432272028f9326725a65f" ok OK 2021 Jesse Duffield 13 pl 0 1073 1 9 22597 true 0 https://github.com/jesseduffield/OK pl 2021 2024 2021 4 19 519 11 false 2021 2022 91 3 76 1 19905 https://www.okquestionmark.org https://github.com/jesseduffield/OK/issues go json typescript yaml css bourne-shell markdown javascript html true 580 0 22 1 false Australia https://news.ycombinator.com/item?id=32640918 "let divide = fn(a, b) { return switch b { case 0: [NO!, ""cannot divide by zero""]; default: [a / b, """"]; }; }; result = divide(5, 0) switch result[1] { case """": puts(result[0]) default: puts(result[1]) // prints ""cannot divide by zero"" } " https://github.com/jesseduffield/OK 0 0 savi Savi 2018 Joe Eli McIlvain 16 pl 0 v0.20240428.0 1074 0 17 22595 true 0 https://github.com/savi-lang/savi pl 2018 2024 2018 8 12 154 84 false savi.py 2018 2024 2418 14 762 8 126189 https://github.com/savi-lang savi crystal markdown yaml json cpp bourne-shell make typescript ruby python c xml lua lisp dockerfile javascript nix true 205 0 33 1 false 0 true United States Savi https://github.com/savi-lang/savi true true true true 0 0 coffeekup CoffeeKup 2010 Maurice Machado 11 template https://coffeekup.org 0 1075 1 7 22591 true 1 jedi https://github.com/mauricemach/coffeekup template 2010 2024 34 84 1264 38 false 2010 2011 180 13 37 2 2688 Markup as CoffeeScript. Markup as CoffeeScript. Markup as CoffeeScript. coffeescript html markdown javascript bourne-shell css json true 1531 0 18 1 false "doctype 5 html -> head -> meta charset: 'utf-8' title ""#{@title or 'Untitled'} | A completely plausible website"" meta(name: 'description', content: @description) if @description? link rel: 'stylesheet', href: '/css/app.css' style ''' body {font-family: sans-serif} header, nav, section, footer {display: block} ''' script src: '/js/jquery.js' coffeescript -> $(document).ready -> alert 'Alerts suck!' body -> header -> h1 @title or 'Untitled' nav -> ul -> (li -> a href: '/', -> 'Home') unless @path is '/' li -> a href: '/chunky', -> 'Bacon!' switch @user.role when 'owner', 'admin' li -> a href: '/admin', -> 'Secret Stuff' when 'vip' li -> a href: '/vip', -> 'Exclusive Stuff' else li -> a href: '/commoners', -> 'Just Stuff' div '#myid.myclass.anotherclass', style: 'position: fixed', -> p 'Divitis kills! Inline styling too.' section -> # A helper function you built and included. breadcrumb separator: '>', clickable: yes h2 ""Let's count to 10:"" p i for i in [1..10] # Another hypothetical helper. form_to @post, -> textbox '#title', label: 'Title:' textbox '#author', label: 'Author:' submit 'Save' footer -> # CoffeeScript comments. Not visible in the output document. comment 'HTML comments.' p 'Bye!'" https://github.com/mauricemach/coffeekup 0 0 qmake QMake 2002 14 pl 0 1076 2 22589 true 0 pl 13539 17519 3624 0 qmake text source.qmake programming false 4 linux freebsd make qt cmake 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. 2007 31 57 48 10962771 Qt Group plc pro pri true 375 0 14 text Finland http://doc.qt.io/archives/qt-4.8/qmake-tutorial.html "CONFIG += qt debug HEADERS += hello.h SOURCES += hello.cpp SOURCES += main.cpp win32 { SOURCES += hellowin.cpp } unix { SOURCES += hellounix.cpp } !exists( main.cpp ) { error( ""No main.cpp file found"" ) } win32:debug { CONFIG += console }" #!/usr/bin/qmake message(This is QMake.) https://en.wikipedia.org/wiki/Qmake 0 0 QMake https://github.com/textmate/cpp-qt.tmbundle QMake lookml LookML 2012 16 pl https://docs.looker.com/data-modeling/learning-lookml/what-is-lookml 0 1077 2 22585 true 0 pl 47 185 5427 0 yaml yaml text/x-yaml source.yaml programming false 205 2013 2018 3 25 Looker lookml modellkml viewlkml 201 0 17 text https://docs.looker.com/relnotes/v1-release-notes#looker_1.10.13 "###################################### # FILE: ecommercestore.model.lkml # # Define the explores and join logic # ###################################### connection: order_database include: ""*.view.lkml"" explore: orders { join: customers { sql_on: ${orders.customer_id} = ${customers.id} ;; } } ########################################################## # FILE: orders.view.lkml # # Define the dimensions and measures for the ORDERS view # ########################################################## view: orders { dimension: id { primary_key: yes type: number sql: ${TABLE}.id ;; } dimension: customer_id { # field: orders.customer_id sql: ${TABLE}.customer_id ;; } dimension: amount { # field: orders.amount type: number value_format: ""0.00"" sql: ${TABLE}.amount ;; } dimension_group: created { # generates fields: type: time # orders.created_time, orders.created_date timeframes: [time, date, week, month] # orders.created_week, orders.created_month sql: ${TABLE}.created_at ;; } measure: count { # field: orders.count type: count # creates a sql COUNT(*) drill_fields: [drill_set*] # list of fields to show when someone clicks 'ORDERS Count' } measure: total_amount { type: sum sql: ${amount} ;; } set: drill_set { fields: [id, created_time, customers.name, amount] } } ############################################################# # FILE: customers.view.lkml # # Define the dimensions and measures for the CUSTOMERS view # ############################################################# view: customers { dimension: id { primary_key: yes type: number sql: ${TABLE}.id ;; } dimension: city { # field: customers.city sql: ${TABLE}.city ;; } dimension: state { # field: customers.state sql: ${TABLE}.state ;; } dimension: name { sql: CONCAT(${TABLE}.firstname, "" "", ${TABLE}.lastname) ;; } measure: count { # field: customers.count type: count # creates a sql COUNT(*) drill_fields: [drill_set*] # fields to show when someone clicks 'CUSTOMERS Count' } set: drill_set { # set: customers.drill_set fields: [id, state, orders.count] # list of fields to show when someone clicks 'CUSTOMERS Count' } }" - view: comments fields: - dimension: id primary_key: true type: int sql: ${TABLE}.id - dimension: body sql: ${TABLE}.body - dimension_group: created type: time timeframes: [time, date, week, month] sql: ${TABLE}.created_at - dimension: headline_id type: int hidden: true sql: ${TABLE}.headline_id - dimension_group: updated type: time timeframes: [time, date, week, month] sql: ${TABLE}.updated_at - dimension: user_id type: int hidden: true sql: ${TABLE}.user_id - measure: count type: count detail: detail* # ----- Detail ------ sets: detail: - id - headlines.id - headlines.name - users.id # true true false 0 0 LookML https://github.com/atom/language-yaml LookML eagle Eagle 1988 12 application 0 1078 1 22584 false 0 application 1788 2082 0 xml xml text/xml text.xml data false 97 2004 2018 2 12 1988 linux postscript xml arduino kicad 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. 2005 177 476 337 1470123 Autodesk sch brd 1105 0 12 text 4196 United States " parse -lang=Fre ""Marie aime Jean"" | align_words -lang=Fre,Dut,Lat -view=""eog""" -- true true false https://en.wikipedia.org/wiki/Grammatical_Framework 0 0 Grammatical Framework https://github.com/atom-haskell/language-haskell Grammatical Framework linearml LinearML 2010 Julien Verlaguet 13 pl https://github.com/pikatchu/LinearML 0 1080 0 6 22580 true 0 https://github.com/pikatchu/LinearML pl 2010 2024 26 37 430 4 false 2010 2014 237 15 116 1 17291 Facebook lml ocaml c make actionscript bash bourne-shell true 558 0 20 1 false United States https://github.com/pikatchu/LinearML 0 0 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 bloop BlooP 1979 17 esolang 0 1081 2 22577 844 true 0 esolang false b/Bloop.bloop 1979 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. 2004 33 41 99 436718 Fluid Analogies Research Group bloop 185 0 19 text https://repl.it/languages/bloop http://www.rosettacode.org/wiki/Category:BlooP United States DEFINE PROCEDURE ''HELLO-WORLD'' [N]: BLOCK 0: BEGIN PRINT['Hello World'] BLOCK 0: END. HELLO-WORLD[1]; DEFINE PROCEDURE ''ACKERMANN'' [M, N]: BLOCK 0: BEGIN CELL(0) ⇐ M; OUTPUT ⇐ N; CELL(1) ⇐ 0; MU-LOOP: BLOCK 1: BEGIN IF CELL(0) = 0, THEN: BLOCK 2: BEGIN OUTPUT ⇐ OUTPUT + 1; IF CELL(1) = 0, THEN: ABORT LOOP 1; CELL(0) ⇐ TOP [CELL(1)]; CELL(1) ⇐ POP [CELL(1)]; QUIT BLOCK 1; BLOCK 2: END IF OUTPUT = 0, THEN: BLOCK 3: BEGIN OUTPUT ⇐ 1; CELL(0) ⇐ MINUS [CELL(0), 1]; QUIT BLOCK 1; BLOCK 3: END OUTPUT ⇐ MINUS [OUTPUT, 1]; CELL(1) ⇐ PUSH [MINUS [CELL(0), 1], CELL(1)]; BLOCK 1: END; BLOCK 0: END. Bloop PRINT ' true true https://en.wikipedia.org/wiki/BlooP_and_FlooP 1 0 https://hopl.info/showlanguage.prx?exp=844 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 reko-decompiler Reko 2007 John Källén 11 decompiler https://uxmal.github.io/reko 0 1082 0 28 22576 false 0 https://github.com/uxmal/reko decompiler 2015 2024 2007 74 251 2098 164 false 2007 2025 11098 53 7028 941 8066057 https://github.com/uxmal/reko/issues csharp assembly-language expect c xml markdown cpp pascal cmake json python html llvmir xslt wasm yaml ring make dockerfile xsd css yacc php sql ocaml javascript go bourne-shell true 2906 0 39 1 false Sweden https://github.com/uxmal/reko 0 0 x-it [x]it! 2022 Jan Heuermann 12 dataNotation https://xit.jotaen.net 0 1083 1 1 22571 true 0 https://github.com/jotaen/xit dataNotation 2022 2024 2022 11 6 1035 0 false 2022 2023 9 2 2 1 236 markdown true 1057 0 14 todotxt 1 false https://news.ycombinator.com/item?id=32552782 [ ] This is an open item [x] This is a checked item [@] This is an ongoing item [~] This is an obsolete item https://github.com/jotaen/xit 0 0 csvw CSVw 2014 Ivan Herman 14 dataValidationLanguage 0 1084 1 13 22568 true 0 https://github.com/w3c/csvw dataValidationLanguage 2014 2024 2014 53 57 162 38 false CSV on the Web 2014 2022 2468 29 1737 57 2405606 The CSV on the Web Working Group has developed standard ways to express useful metadata about CSV files and other kinds of tabular data. The CSV on the Web Working Group has developed standard ways to express useful metadata about CSV files and other kinds of tabular data. CSV on the Web Working Group && CSV on the Web Community Group The CSV on the Web Working Group has developed standard ways to express useful metadata about CSV files and other kinds of tabular data. json csv html markdown javascript bourne-shell svg xml ruby haml css python yaml true 363 0 28 1 false Various https://www.w3.org/TR/tabular-data-primer/ "{ ""@context"": ""http://www.w3.org/ns/csvw"", ""url"": ""countries.csv"", ""tableSchema"": { ""aboutUrl"": ""http://example.org/country/{code}"", ""columns"": [{ ""titles"": ""country"", ""name"": ""code"" },{ ""titles"": ""country group"" },{ ""titles"": ""name (en)"", ""lang"": ""en"" },{ ""titles"": ""name (fr)"", ""lang"": ""fr"" },{ ""titles"": ""name (de)"", ""lang"": ""de"" },{ ""titles"": ""latitude"", ""datatype"": ""number"" },{ ""titles"": ""longitude"", ""datatype"": ""number"" }] } }" https://github.com/w3c/csvw 0 0 k-framework k-framework 2013 12 grammarLanguage http://www.kframework.org/ 0 v7.0.92 1085 0 20 22567 true 0 https://github.com/runtimeverification/k grammarLanguage 2016 2024 2010 38 143 430 274 false 2010 2025 23450 189 7042 164 409826 2013 Runtime Verification Inc. make java python markdown json standard-ml scala bash bourne-shell yaml html dockerfile xml nix toml c javascript css restructuredtext ini true 1050 0 32 false 7 true Various https://github.com/runtimeverification/k 0 0 kframework.org renderscript RenderScript 2011 17 pl http://developer.android.com/guide/topics/renderscript/index.html 0 1086 1 22565 true 0 pl 379 407 696 0 text none programming false 2011 android cuda 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. 2011 32 186 69 32576047 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. 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. 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. rs rsh 181 0 19 text https://developer.android.com/guide/topics/renderscript/advanced "/* * Copyright (C) 2012 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the ""License""); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an ""AS IS"" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #pragma version(1) #pragma rs java_package_name(com.android.gallery3d.filtershow.filters) #pragma rs_fp_relaxed int32_t gWidth; int32_t gHeight; const uchar4 *gPixels; rs_allocation gIn; float gCoeffs[9]; void root(const uchar4 *in, uchar4 *out, const void *usrData, uint32_t x, uint32_t y) { uint32_t x1 = min((int32_t)x+1, gWidth-1); uint32_t x2 = max((int32_t)x-1, 0); uint32_t y1 = min((int32_t)y+1, gHeight-1); uint32_t y2 = max((int32_t)y-1, 0); float4 p00 = rsUnpackColor8888(gPixels[x1 + gWidth * y1]); float4 p01 = rsUnpackColor8888(gPixels[x + gWidth * y1]); float4 p02 = rsUnpackColor8888(gPixels[x2 + gWidth * y1]); float4 p10 = rsUnpackColor8888(gPixels[x1 + gWidth * y]); float4 p11 = rsUnpackColor8888(gPixels[x + gWidth * y]); float4 p12 = rsUnpackColor8888(gPixels[x2 + gWidth * y]); float4 p20 = rsUnpackColor8888(gPixels[x1 + gWidth * y2]); float4 p21 = rsUnpackColor8888(gPixels[x + gWidth * y2]); float4 p22 = rsUnpackColor8888(gPixels[x2 + gWidth * y2]); p00 *= gCoeffs[0]; p01 *= gCoeffs[1]; p02 *= gCoeffs[2]; p10 *= gCoeffs[3]; p11 *= gCoeffs[4]; p12 *= gCoeffs[5]; p20 *= gCoeffs[6]; p21 *= gCoeffs[7]; p22 *= gCoeffs[8]; p00 += p01; p02 += p10; p11 += p12; p20 += p21; p22 += p00; p02 += p11; p20 += p22; p20 += p02; p20 = clamp(p20, 0.f, 1.f); *out = rsPackColorTo8888(p20.r, p20.g, p20.b); } " /* */ true true false https://en.wikipedia.org/wiki/RenderScript 2 0 RenderScript RenderScript 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 lem-editor lem-editor 2015 11 editor http://lem-project.github.io/ 0 v2.2.0 1087 0 7 22564 false 0 https://github.com/cxxxr/lem editor 2015 2024 2015 65 164 2180 120 false 2015 2025 11438 135 670 98 664202 https://github.com/lem-project lisp markdown bourne-shell json yaml make dockerfile true 2809 0 18 false 2 true Japan https://github.com/cxxxr/lem 0 0 hedy Hedy 2020 11 pl https://www.hedy.org/ 0 1088 0 16 22560 true 0 https://github.com/hedyorg/hedy pl 2019 2024 25 281 1276 226 false 2019 2025 16379 637 1560 988 1247394 Hedy is a gradual programming language to teach children programming. Gradual languages use different language levels, where each level adds new concepts and syntactic complexity. At the end of the Hedy level sequence, kids master a subset of syntactically valid Python. Hedy is a gradual programming language to teach children programming. Gradual languages use different language levels, where each level adds new concepts and syntactic complexity. At the end of the Hedy level sequence, kids master a subset of syntactically valid Python. https://github.com/hedyorg Hedy is a gradual programming language to teach children programming. Gradual languages use different language levels, where each level adds new concepts and syntactic complexity. At the end of the Hedy level sequence, kids master a subset of syntactically valid Python. yaml javascript python html typescript css json scss bash markdown csharp svg bourne-shell dockerfile csv toml true 2758 0 27 false Netherlands https://github.com/hedyorg/hedy 0 0 noweb Noweb 1989 Norman Ramsey 14 textMarkup https://www.cs.tufts.edu/~nr/noweb/ 0 1089 1 10 22559 true 0 https://github.com/nrnrnr/noweb textMarkup 2012 2024 1991 19 27 247 5 false 1991 2023 353 7 384 2 66135 Tufts University bourne-shell make tex c perl awk korn-shell c-shell lisp html true 357 0 25 cweb 1 false United States "\section{Hello world} Today I awoke and decided to write some code, so I started to write Hello World in \textsf C. <>= /* <> */ #include int main(int argc, char *argv[]) { printf(""Hello World!\n""); return 0; } @ \noindent \ldots then I did the same in PHP. <>= > */ echo ""Hello world!\n""; ?> @ \section{License} Later the same day some lawyer reminded me about licenses. So, here it is: <>= This work is placed in the public domain." https://github.com/nrnrnr/noweb https://en.wikipedia.org/wiki/Noweb 0 0 srecode-template SRecode Template 2000 16 textMarkup 0 1090 1 22558 true 0 textMarkup 160 163 705466 0 lisp commonlisp text/x-common-lisp source.lisp markup false 40 2005 2018 1 6 Semantic Recoder (or SRecode) is a template manager and code generator that is a part of CEDET. Semantic Recoder (or SRecode) is a template manager and code generator that is a part of CEDET. Free Software Foundation Semantic Recoder (or SRecode) is a template manager and code generator that is a part of CEDET. srt 200 0 17 text United States https://www.gnu.org/software/emacs/manual/html_mono/srecode.html ";;; linguist.srt --- Template for linguist-example-mode ;; Not copyrighted whatsoever. ;; ;; GPL can bite my shiny metal ass. ;; ;; GitHub: 1 ;; Stallman: 0 set mode ""default"" set comment_start "";"" set LICENSE ""It's public domain, baby. This was written for the sole purpose of the format's inclusion and recognition by GitHub Linguist. This block of multiline text was added because every other .srt file I could find was GPL-licensed and had long-winded copyright blobs in the file's header. Also, check out my sick line-wrapping abilities."" set DOLLAR ""$"" context file template license ---- {{LICENSE:srecode-comment-prefix}} ---- template filecomment :file :user :time ---- {{comment_start}} {{FILENAME}} --- {{^}} {{comment_prefix}} YUO WAN GPL? {{comment_prefix}} {{comment_prefix}} Copyright (C) {{YEAR}} {{?AUTHOR}} {{comment_prefix}} {{comment_prefix}} TUO BAD {{comment_prefix}} WE EXPAT PEOPLE {{comment_prefix}} {{EXPLETIVE}} YOU! {{>:copyright}} {{comment_end}} ---- ;; end " ; true true false 0 0 SRecode Template https://github.com/textmate/lisp.tmbundle SRecode Template type-language Type Language 2013 16 pl 0 1091 1 22558 true 0 pl 404774 0 tl text source.tl data false 25 2017 2018 2 3 TL (Type Language) serves to describe the used system of types, constructors, and existing functions. TL (Type Language) serves to describe the used system of types, constructors, and existing functions. TL (Type Language) serves to describe the used system of types, constructors, and existing functions. tl 200 0 19 text https://core.telegram.org/mtproto/TL "// built-in types int#a8509bda ? = Int; long ? = Long; double ? = Double; string ? = String; null = Null; vector {t:Type} # [ t ] = Vector t; coupleInt {alpha:Type} int alpha = CoupleInt; coupleStr {gamma:Type} string gamma = CoupleStr gamma; /* The name of the type variable is irrelevant: ""gamma"" could be replaced with ""alpha"" However, the combinator number will depend on the specific choice. */ intHash {alpha:Type} vector> = IntHash; strHash {alpha:Type} (vector (coupleStr alpha)) = StrHash alpha; intSortedHash {alpha:Type} intHash = IntSortedHash; strSortedHash {alpha:Type} (strHash alpha) = StrSortedHash alpha; // custom types pair x:Object y:Object = Pair; triple x:Object y:Object z:Object = Triple; user#d23c81a3 id:int first_name:string last_name:string = User; no_user#c67599d1 id:int = User; group id:int title:string last_name:string = Group; no_group = Group; ---functions--- // Maybe some built-in arithmetic functions; inverse quotes make ""identifiers"" out of arbitrary non-alphanumeric strings `+` Int Int = Int; `-` Int Int = Int; `+` Double Double = Double; // ... // API functions (aka RPC functions) getUser#b0f732d5 int = User; getUsers#2d84d5f5 (Vector int) = Vector User;" // /* */ true true true false 0 0 https://github.com/goodmind/language-typelanguage Type Language ibm-gml GML 1969 Charles Goldfarb and Edward Mosher and Raymond Lorie 19 pl 0 1092 1 22555 6352 true 0 pl false g/GML.gml IBM Generalised Markup Language 1969 script sgml xml ipf Generalized Markup Language (GML) is a set of macros that implement intent-based (procedural) markup tags for the IBM text formatter, SCRIPT. SCRIPT/VS is the main component of IBM's Document Composition Facility (DCF). A starter set of tags in GML is provided with the DCF product. 2005 23 27 56 1855712 IBM gml 135 0 23 3 text https://github.com/antlr/grammars-v4/tree/master/gml United States "draw_text(1, 1, ""Hello World"");" GML draw_text """" true true https://en.wikipedia.org/wiki/IBM_Generalized_Markup_Language 3 2 https://hopl.info/showlanguage.prx?exp=6352 year|publisher|title|authors|isbn13\n2014|Packt Publishing|GameMaker Game Programming with GML|DeLucas, Matthew|9781783559442\n2014|Packt Publishing|GameMaker Game Programming with GML|DeLucas, Matthew|9781783559459\n2010|Createspace Independent Publishing Platform|Game Maker 8 Game Creation Gml Programming: Practical Tips & Techniques Vol 2|Hobbypress|9781453722244 year|title|doi|citations|influentialCitations|authors|paperId\n2001|A specification of a spatial query language over GML|10.1145/512161.512186|50|3|J. E. Córcoles and P. González|81bb45a8a6c4a90abe791480488ce5eb21fdcdb4\n2014|Linking spatial data: automated conversion of geo-information models and GML data to RDF|10.2902/1725-0463.2014.09.ART3|32|7|L. V. D. Brink and P. Janssen and W. Quak and J. Stoter|dc8e68393e71f21ec861a34cfb1f231257ef1a45 sage Sage 2022 Adam McDaniel 13 pl https://adam-mcdaniel.github.io/sage-website/ 0 1093 1 22551 true 0 https://github.com/adam-mcdaniel/sage pl 2022 2024 7 16 466 9 false 2022 2024 707 5 660 87 402989 https://adam-mcdaniel.github.io/sage-website/playgrounds/playground/ Sage is a compiled language for anything from OS-dev to the web! Sage is a compiled language for anything from OS-dev to the web! Sage is a compiled language for anything from OS-dev to the web! true 521 0 13 1 https://adam-mcdaniel.github.io/sage-website/docs/getting-started/ "println(""Hello, world!"");" https://discord.gg/rSGkM4bcdP https://github.com/adam-mcdaniel/sage 0 0 psvg PSVG 2020 Lingdong Huang 14 pl https://psvg.netlify.app/ 0 1094 1 5 22550 true 0 https://github.com/LingDong-/psvg pl 2020 2024 6 15 297 3 false 2020 2020 62 4 47 1 5584 https://psvg.netlify.app/ Programmable SVG format Programmable SVG format Programmable SVG format svg typescript json markdown javascript svg true 348 0 20 1 false https://github.com/LingDong-/psvg/blob/main/QUICKSTART.md " " https://github.com/LingDong-/psvg 0 0 cweb CWEB 1987 Donald Knuth 15 textMarkup http://www-cs-faculty.stanford.edu/~uno/cweb.html 0 1095 2 22549 1939 true 1 noweb textMarkup 53 53 425 0 text none programming false 1987 tex c java pascal 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. 2002 31 94 73 87398 Stanford University w true 176 0 15 1 text Netherlands \datethis @*Intro. This program generates clauses for the transition relation from time $t$ to time $t+1$ in Conway's Game of Life, assuming that all of the potentially live cells at time $t$ belong to a pattern that's specified in |stdin|. The pattern is defined by one or more lines representing rows of cells, where each line has `\..' in a cell that's guaranteed to be dead at time~$t$, otherwise it has `\.*'. The time is specified separately as a command-line parameter. The Boolean variable for cell $(x,y)$ at time $t$ is named by its so-called ``xty code,'' namely by the decimal value of~$x$, followed by a code letter for~$t$, followed by the decimal value of~$y$. For example, if $x=10$ and $y=11$ and $t=0$, the variable that indicates liveness of the cell is \.{10a11}; and the corresponding variable for $t=1$ is \.{10b11}. Up to 19 auxiliary variables are used together with each xty code, in order to construct clauses that define the successor state. The names of these variables are obtained by appending one of the following two-character combinations to the xty code: \.{A2}, \.{A3}, \.{A4}, \.{B1}, \.{B2}, \.{B3}, \.{B4}, \.{C1}, \.{C2}, \.{C3}, \.{C4}, \.{D1}, \.{D2}, \.{E1}, \.{E2}, \.{F1}, \.{F2}, \.{G1}, \.{G2}. These variables are derived from the Bailleux--Boufkhad method of encoding cardinality constraints: The auxiliary variable \.{A$k$} stands for the condition ``at least $k$ of the eight neighbors are alive.'' Similarly, \.{B$k$} stands for ``at least $k$ of the first four neighbors are alive,'' and \.{C$k$} accounts for the other four neighbors. Codes \.D, \.E, \.F, and~\.G refer to pairs of neighbors. Thus, for instance, \.{10a11C2} means that at least two of the last four neighbors of cell $(10,11)$ are alive. Those auxiliary variables receive values by means of up to 77 clauses per cell. For example, if $u$ and~$v$ are the neighbors of cell~$z$ that correspond to a pairing of type~\.D, there are six clauses $$\bar u d_1,\quad \bar v d_1,\quad % This file is part of CWEB. % This program by Silvio Levy and Donald E. Knuth % is based on a program by Knuth. % It is distributed WITHOUT ANY WARRANTY, express or implied. % Version 3.64 --- January 2002 % Copyright (C) 1987,1990,1993,2000 Silvio Levy and Donald E. Knuth % Permission is granted to make and distribute verbatim copies of this % document provided that the copyright notice and this permission notice % are preserved on all copies. % Permission is granted to copy and distribute modified versions of this % document under the conditions for verbatim copying, provided that the % entire resulting derived work is given a different name and distributed % under the terms of a permission notice identical to this one. https://en.wikipedia.org/wiki/CWEB 0 0 https://hopl.info/showlanguage.prx?exp=1939 CWeb CWeb tls TLS 1999 10 protocol 0 1096 0 22548 true 0 protocol false Transport Layer Security 1999 http ftp smtp tcp udp linux android ios solaris delphi java javascript Transport Layer Security (TLS) and its predecessor, Secure Sockets Layer (SSL), are cryptographic protocols that provide communications security over a computer network. Several versions of the protocols find widespread use in applications such as web browsing, email, Internet faxing, instant messaging, and Voice over IP (VoIP). Websites are able to use TLS to secure all communications between their servers and web browsers. The Transport Layer Security protocol aims primarily to provide privacy and data integrity between two communicating computer applications. When secured by TLS, connections between a client (e.g., a web browser) and a server (e.g., wikipedia.org) have one or more of the following properties: The connection is private (or secure) because symmetric cryptography is used to encrypt the data transmitted. The keys for this symmetric encryption are generated uniquely for each connection and are based on a shared secret negotiated at the start of the session (see § TLS handshake). The server and client negotiate the details of which encryption algorithm and cryptographic keys to use before the first byte of data is transmitted (see § Algorithm below). The negotiation of a shared secret is both secure (the negotiated secret is unavailable to eavesdroppers and cannot be obtained, even by an attacker who places themselves in the middle of the connection) and reliable (no attacker can modify the communications during the negotiation without being detected). The identity of the communicating parties can be authenticated using public-key cryptography. This authentication can be made optional, but is generally required for at least one of the parties (typically the server). The connection ensures integrity because each message transmitted includes a message integrity check using a message authentication code to prevent undetected loss or alteration of the data during transmission. In addition to the properties above, careful configuration of TLS can provide additional privacy-related properties such as forward secrecy, ensuring that any future disclosure of encryption keys cannot be used to decrypt any TLS communications recorded in the past. TLS supports many different methods for exchanging keys, encrypting data, and authenticating message integrity (see § Algorithm below). As a result, secure configuration of TLS involves many configurable parameters, and not all choices provide all of the privacy-related properties described in the list above (see the § Key exchange (authentication), § Cipher security, and § Data integrity tables). Attempts have been made to subvert aspects of the communications security that TLS seeks to provide and the protocol has been revised several times to address these security threats (see § Security). Developers of web browsers have also revised their products to defend against potential security weaknesses after these were discovered (see TLS/SSL support history of web browsers). The TLS protocol comprises two layers: the TLS record and the TLS handshake protocols. TLS is a proposed Internet Engineering Task Force (IETF) standard, first defined in 1999 and updated in RFC 5246 (August 2008) and RFC 6176 (March 2011). It builds on the earlier SSL specifications (1994, 1995, 1996) developed by Netscape Communications for adding the HTTPS protocol to their Navigator web browser. 2001 4915 1638 4100 187813 24595 0 10 https://www.rfc-editor.org/rfc/rfc5246 na https://en.wikipedia.org/wiki/Transport_Layer_Security 1 2 year|publisher|title|authors|isbn13\n2011-01-07|Wiley|Implementing SSL / TLS Using Cryptography and PKI|Joshua Davies|9781118038772 year|title|doi|citations|influentialCitations|authors|paperId\n2017|Implementing and Proving the TLS 1.3 Record Layer|10.1109/SP.2017.58|74|2|K. Bhargavan and Antoine Delignat-Lavaud and C. Fournet and Markulf Kohlweiss and J. Pan and Jonathan Protzenko and Aseem Rastogi and N. Swamy and Santiago Zanella Béguelin and J. Zinzindohoué|3f4ec516aa4eaf52019a2bfced52e786190e5dc2\n2014|An Intrinsic Encoding of a Subset of C and its Application to TLS Network Packet Processing|10.6092/ISSN.1972-5787/4317|7|2|Reynald Affeldt and Kazuhiko Sakaguchi|8b052110776112bef379a27e6abbfc5288ccd40f creole Creole 2007 13 textMarkup 0 1097 3 22547 true 0 textMarkup 0 true 0 text text.html.creole prose false 17 2012 2018 1 3 2006 xml mediawiki tiddlywiki 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. 2008 59 52 91 20480609 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. 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. International Symposium on Wikis 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. creole 515 0 13 text https://github.com/antlr/grammars-v4/tree/master/creole Denmark * Bullet list * Second item ** Sub item # Numbered list # Second item ## Sub item = Creole Creole is a Creole-to-HTML converter for Creole, the lightweight markup language (http://wikicreole.org/). Github uses this converter to render *.creole files. Project page on github: * http://github.com/minad/creole Travis-CI: * https://travis-ci.org/minad/creole RDOC: * http://rdoc.info/projects/minad/creole == INSTALLATION {{{ gem install creole }}} == SYNOPSIS {{{ require 'creole' html = Creole.creolize('== Creole text') }}} == BUGS If you found a bug, please report it at the Creole project's tracker on GitHub: http://github.com/minad/creole/issues == AUTHORS * Lars Christensen (larsch) * Daniel Mendler (minad) == LICENSE Creole is Copyright (c) 2008 - 2013 Lars Christensen, Daniel Mendler. It is free software, and may be redistributed under the terms specified in the README file of the Ruby distribution. |= |= table |= header | | a | table | row | | b | table | row | https://en.wikipedia.org/wiki/Creole_(markup) 0 0 https://github.com/Siddley/Creole Creole candy Candy 2020 Jonas Wanke and Marcel Garus 14 pl https://github.com/candy-lang/Candy 0 v0.1.0 1098 1 11 22540 true 0 https://github.com/candy-lang/Candy pl 2020 2024 3 3 314 116 false 2020 2025 6063 13 484 22 83718 https://github.com/candy-lang/ candy rust markdown yaml toml json typescript c python dart nix make true 338 0 27 2 false 0 true Germany "type = use ""..Type"" is value := type.is value Struct hasKey struct key := needs (is struct) ✨.structHasKey struct key getUnwrap struct key := needs (is struct) needs (hasKey struct key) ✨.structGet struct key getKeys struct := needs (is struct) ✨.structGetKeys struct" https://github.com/candy-lang/Candy 0 0 tiledb tiledb 2017 11 database https://tiledb.com/ 0 2.23.0 1099 0 18 22537 false 0 https://github.com/TileDB-Inc/TileDB database 2017 2024 2014 72 181 1817 115 false 2014 2025 10162 114 2052 107 630202 2010 cpp cmake markdown c yaml bourne-shell diff python json svg powershell restructuredtext dockerfile css make bash javascript scss true 2476 0 29 false 2 true https://twitter.com/tiledb https://github.com/TileDB-Inc/TileDB 0 0 tiledb.com jinx jinx 2016 JamesBoer 14 pl https://jamesboer.github.io/Jinx/ 0 v1.3.10 1100 0 12 22537 true 0 https://github.com/JamesBoer/Jinx pl 2016 2024 2016 21 11 298 0 false 2016 2023 573 2 280 56 76836 2016 https://github.com/JamesBoer/Jinx/issues html javascript cpp csharp xaml bourne-shell css cmake xml markdown z-shell yaml true 335 0 26 1 false 1 true Unknown https://github.com/JamesBoer/Jinx 0 0 jamesboer.github.io 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 blackcoffee BlackCoffee 2014 Frank van Viegen 14 pl https://github.com/paiq/blackcoffee 0 0.2.0 1101 0 6 22531 true 0 https://github.com/paiq/blackcoffee pl 2013 2023 10 9 105 2 false 2009 2014 4133 196 246 15 60507 Paiq BV coffee coffeescript javascript html css markdown json true 330 0 22 1 false 0 true The Netherlands macro https://github.com/paiq/blackcoffee 0 0 contracts.coffee contracts.coffee 2011 Tim Disney 14 pl https://disnet.github.io/contracts.coffee/ 0 0.3.3 1102 0 10 22531 true 0 https://github.com/disnet/contracts.coffee pl 2011 2023 6 6 216 28 false 2009 2014 3929 94 224 14 46210 https://www.disnetdev.com/ coffee coffeescript javascript html css markdown bourne-shell erb ruby json yaml javascript true 330 0 26 1 false 0 true United States https://github.com/disnet/contracts.coffee 0 0 cyclone Cyclone 2001 15 pl http://cyclone.thelanguage.org 0 1103 2 22529 3312 true 0 pl false c/Cyclone.cyc 2001 c rust ml 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. 2002 43 28 133 7645 AT&T cyc 236 0 16 text United States "#include int main() { printf(""Hello World\n""); return 0; } " "char *itoa(int i) { char buf[20], *z; sprintf(buf,""%d"",i); z = buf; return z; }" Cyclone printf true https://en.wikipedia.org/wiki/Cyclone_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=3312 cyclone.thelanguage.org year|publisher|title|authors|isbn13\n2010||Cyclone (programming Language)|Frederic P. Miller|9786132847225 semicolon semicolon 2012 Pavan Kumar Sunkara 17 esolang https://pksunkara.com/semicolon 0 v0.1.3 1104 0 2 22529 true 0 https://github.com/pksunkara/semicolon esolang 2012 2024 2012 6 10 130 0 false 2012 2021 29 4 7 1 4489 An esoteric language made up of only semicolons. You can't escape the semicolon monster! An esoteric language made up of only semicolons. You can't escape the semicolon monster! https://github.com/pksunkara/semicolon/pulls An esoteric language made up of only semicolons. You can't escape the semicolon monster! json markdown true 166 0 21 brainfuck brainfuck 1 false 0 true https://esolangs.org/wiki/Semicolon India https://github.com/pksunkara/semicolon 0 0 excel-app Microsoft Excel 1987 10 application spreadsheet http://office.microsoft.com/en-us/excel 0 1105 1 22527 false 0 application false 1993 android ios vba visual-basic ooxml xml csv dbase mysql c fortran python javascript 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. 2001 3977 2892 3519 20268 Microsoft 19906 0 487 text United States " Name Example Value 123

" 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 https://en.wikipedia.org/wiki/Microsoft_Excel 0 0 jql JSON Query Language 2019 Jakub Martin 12 queryLanguage 0 v0.2.0 1106 0 6 22523 true 0 https://github.com/cube2222/jql queryLanguage 2019 2024 2019 12 19 897 3 false https://www.reddit.com/r/golang/comments/ehnsz5/jql_json_query_processor_with_an_easier_lispy/ 2019 2022 72 3 21 1 987 https://github.com/cube2222/jql/issues go yaml markdown yacc json bourne-shell true 958 0 18 1 false 0 true Poland https://github.com/cube2222/jql 0 0 roku-brightscript Brightscript 2010 14 pl 1 1107 1 22523 true 1 cloc pl 86 98 832 0 text source.brs programming false 26 2011 2015 1 3 brs 200 0 16 brs text https://medium.com/float-left-insights/what-makes-roku-brightscript-a-powerful-scripting-language-5f46532f496d "' ********************************************************* ' ** Simple Grid Screen Demonstration App ' ** Jun 2010 ' ** Copyright (c) 2010 Roku Inc. All Rights Reserved. ' ********************************************************* '************************************************************ '** Application startup '************************************************************ Sub Main() 'initialize theme attributes like titles, logos and overhang color initTheme() gridstyle = ""Flat-Movie"" 'set to go, time to get started while gridstyle <> """" print ""starting grid style= "";gridstyle screen=preShowGridScreen(gridstyle) gridstyle = showGridScreen(screen, gridstyle) end while End Sub '************************************************************* '** Set the configurable theme attributes for the application '** '** Configure the custom overhang and Logo attributes '** These attributes affect the branding of the application '** and are artwork, colors and offsets specific to the app '************************************************************* Sub initTheme() app = CreateObject(""roAppManager"") app.SetTheme(CreateDefaultTheme()) End Sub '****************************************************** '** @return The default application theme. '** Screens can make slight adjustments to the default '** theme by getting it from here and then overriding '** individual theme attributes. '****************************************************** Function CreateDefaultTheme() as Object theme = CreateObject(""roAssociativeArray"") theme.ThemeType = ""generic-dark"" ' All these are greyscales theme.GridScreenBackgroundColor = ""#363636"" theme.GridScreenMessageColor = ""#808080"" theme.GridScreenRetrievingColor = ""#CCCCCC"" theme.GridScreenListNameColor = ""#FFFFFF"" ' Color values work here theme.GridScreenDescriptionTitleColor = ""#001090"" theme.GridScreenDescriptionDateColor = """ ' true true false 0 0 Brightscript https://github.com/cmink/BrightScript.tmbundle Brightscript peg PEG 2002 12 grammarLanguage 0 1108 2 22521 true 0 grammarLanguage false parsing expression grammar grammar_notation.py 2002 regex 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. 2004 187 121 443 892899 peg 955 0 13 peg text Expr ← Sum Sum ← Product (('+' / '-') Product)* Product ← Value (('*' / '/') Value)* Value ← [0-9]+ / '(' Expr ')' PEG Value ← [0-9.]+ / '(' Expr ')' Product ← Expr (('*' / '/') Expr)* Sum ← Expr (('+' / '-') Expr)* Expr ← Product / Sum / Value true true https://en.wikipedia.org/wiki/Parsing_expression_grammar 0 0 gambas Gambas 1999 Benoît Minisini 13 pl 0 1109 2 22518 true 0 pl false 1999 linux freebsd visual-basic java basic qt opengl perl python visual-basic.net Gambas is the name of an object-oriented dialect of the BASIC programming language, as well as the integrated development environment that accompanies it. Designed to run on Linux and other Unix-like computer operating systems, its name is a recursive acronym for Gambas Almost Means Basic. Gambas is also the word for prawns in the Spanish, French, and Portuguese languages, from which the project's logos are derived. 2003 93 153 496 215824 https://lists.gambas-basic.org/listinfo true 485 0 13 1 http://www.rosettacode.org/wiki/Category:Gambas France https://riju.codes/gambas "Print ""Hello, world!"" " Private Sub Test(X As Float) As Float Dim Mu As Float = 10.0 Dim Pu, Su As Float Dim I, J, N As Integer Dim aPoly As New Float[100] N = 500000 For I = 0 To N - 1 For J = 0 To 99 Mu = (Mu + 2.0) / 2.0 aPoly[J] = Mu Next Su = 0.0 For J = 0 To 99 Su = X * Su + aPoly[J] Next Pu += Su Next Return Pu End Public Sub Main() Dim I as Integer For I = 1 To 10 Print Test(0.2) Next End true false https://en.wikipedia.org/wiki/Gambas 0 0 mal mal 2014 10 interpreter 0 1110 0 74 22517 true 0 https://github.com/kanaka/mal interpreter 2014 2024 2014 182 2515 9938 76 false 2014 2024 4047 141 2465 14 383457 Mal is a Clojure inspired Lisp interpreter. Mal is implemented in 75 languages. Mal is a Clojure inspired Lisp interpreter. Mal is implemented in 75 languages. https://github.com/kanaka/mal/issues Mal is a Clojure inspired Lisp interpreter. Mal is implemented in 75 languages. make dockerfile swift ada python bash javascript lisp java c visual-basic sql scheme ruby perl json bourne-shell xslt matlab zig csharp f-sharp pascal elm smalltalk haxe php scala elixir assembly-language markdown forth cpp erlang lua lex standard-ml vala vhdl go visual-basic.net d fennel typescript rexx tcl objective-c crystal purescript vim-script r groovy kotlin nim julia racket coffeescript awk rust dart powershell haskell prolog ocaml css yaml svg html clojure dhall diff gradle toml clojurescript true 17625 0 84 true United States https://github.com/kanaka/mal 0 0 wsdl WSDL 2000 11 xmlFormat 0 1111 1 22516 true 0 xmlFormat false Web Services Description Language 2000 xml soap bpel "The Web Services Description Language (WSDL ) is an XML-based interface definition language that is used for describing the functionality offered by a web service. The acronym is also used for any specific WSDL description of a web service (also referred to as a WSDL file), which provides a machine-readable description of how the service can be called, what parameters it expects, and what data structures it returns. Therefore, its purpose is roughly similar to that of a method signature in a programming language. The current version of WSDL is WSDL 2.0. The meaning of the acronym has changed from version 1.1 where the ""D"" stood for ""Definition""." 2002 471 277 535 23713739 2375 0 11 https://www.w3.org/TR/2001/NOTE-wsdl-20010315 text " This is a sample WSDL 2.0 document. ... ... " https://en.wikipedia.org/wiki/Web_Services_Description_Language 2 3 year|publisher|title|authors|isbn13\n2003|Addison Wesley Publishing Company|J2EE Web Services: XML SOAP WSDL UDDI WS-I JAX-RPC JAXR SAAJ JAXP|Monson-Haefel, Richard|9780321146182 year|title|doi|citations|influentialCitations|authors|paperId\n2013|Revising WSDL Documents: Why and How, Part 2|10.1109/MIC.2013.4|15|0|C. Mateos and M. Crasso and Alejandro Zunino and J. Coscia|f6968aceaf0392f05e7e5414a0e9de282ee3f1fd\n2015|A new customizable security framework for preventing WSDL attacks|10.1109/ISMSC.2015.7594022|5|1|B. Ibrahim and M. Hassan|119d259c521fd02f0c5bf3802efb9afed3775996\n2019|Comparative Study between Web Services Technologies: REST and WSDL|10.1109/3ICT.2019.8910298|1|0|Rashed A. Bahlool and A. Zeki|8b241398fc0f8d2cfd4f83bf6722fcb741ddebd4 title|year|author|goodreadsId|rating|ratings|reviews\nWsdl 100 Success Secrets Essentials of Understanding and Applying Web Services Description Language - The XML Based Protocol for Information Exchange in Decentralized and Distributed Environments|2008|Kevin Allen|23405681|0.0|0|0 ladder-logic Ladder Logic 1994 11 pl 0 1112 1 22513 8317 true 0 pl false 1999 sequential-function-chart basic c 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.). 2002 468 83 513 66251 International Electrotechnical Commission 2360 0 11 true text Switzerland +--------+ --------------------+ A + B +----------- | into C | +--------+ Adder https://en.wikipedia.org/wiki/Ladder_logic 0 0 https://hopl.info/showlanguage.prx?exp=8317 Ladder Logic uniface Uniface 1994 16 pl http://uniface.com 0 1113 1 22504 true 0 pl false u/Uniface.uniface 1998 1994 mysql smtp c java unix linux sql postgresql Uniface is a development and deployment platform for enterprise applications that can run in a large range of runtime environments, including mobile, mainframe, web, Service-oriented architecture (SOA), Windows, Java EE and .NET. Uniface is a model-driven, Rapid Application Development (RAD) environment used to create mission-critical applications. Uniface applications are database- and platform-independent. Uniface provides an integration framework that enables Uniface applications to integrate with all major DBMS products such as Oracle, Microsoft SQL Server, MySQL and IBM DB2. In addition, Uniface also supports file systems such as RMS (HP OpenVMS), Sequential files, operating system text files and a wide range of other technologies, such as mainframe-based products (CICS, IMS), web services, SMTP and POP email, LDAP directories, .NET, ActiveX, Component Object Model (COM), C(++) programs, and Java. Uniface operates under Microsoft Windows, Windows Mobile, various flavors of Unix and Linux, VMS, IBM iSeries, and z/OS. Uniface can be used in complex systems that maintain critical enterprise data supporting mission-critical business processes such as point-of sale and web-based online shopping, financial transactions, salary administration, and inventory control. It is currently used by thousands of companies in more than 30 countries, with an effective installed base of millions of end-users. Uniface applications range from client/server to web, and from data entry to workflow, as well as portals that are accessed locally, via intranets and the internet. Originally developed in the Netherlands by Inside Automation, later Uniface B.V., the product and company were acquired by Detroit-based Compuware Corp in 1994, and in 2014 was acquired by Marlin Equity Partners and is now an independent company. Uniface B.V. global headquarters are in Amsterdam. 2005 35 23 174 2905637 uniface 196 0 18 text http://www.rosettacode.org/wiki/Category:Uniface "message ""Hello World""" https://twitter.com/uniface Uniface message """" true true https://en.wikipedia.org/wiki/Uniface_(programming_language) 1 0 uniface.com year|publisher|title|authors|isbn13\n2011||Uniface (programming Language)|Lambert M. Surhone|9786135235524 acl2 ACL2 1990 Robert S. Boyer and J Strother Moore 16 pl 0 1114 0 22502 6972 true 0 pl false A Computational Logic for Applicative Common Lisp 1990 common-lisp axiom "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.""" 2002 35 72 124 162049 University of Texas at Austin true 195 0 17 2 text http://www.rosettacode.org/wiki/Category:ACL2 United States true https://en.wikipedia.org/wiki/ACL2 2 0 https://hopl.info/showlanguage.prx?exp=6972 year|publisher|title|authors|isbn13\n2000|Springer|Computer-Aided Reasoning: ACL2 Case Studies (Advances in Formal Methods, 4)||9780792378495 title|year|author|goodreadsId|rating|ratings|reviews\nComputer-Aided Reasoning: Acl2 Case Studies|2000|Matt Kaufmann|13910610|4.00|1|0 rye Rye 2019 Janko Metelko 13 pl https://ryelang.org 0 v0.0.19 1115 0 16 22501 true 0 https://github.com/refaktor/rye pl 2020 2024 12 18 392 6 false 2019 2025 1658 22 540 115 39762 https://github.com/refaktor/rye/ go markdown html javascript yaml json bash svg css xml r csv java python c dockerfile true 470 0 29 1 false 0 true Slovenia https://www.reddit.com/r/ryelang/ https://github.com/refaktor/rye 0 0 sparc SPARC 1987 11 isa 0 1116 0 22498 true 0 isa false 1987 mips ml lisp solaris freebsd linux verilog systemverilog 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. 2002 431 955 1055 36954 Sun Microsystems 2175 0 11 na 9263 https://en.wikipedia.org/wiki/SPARC 5 0 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 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 pyth Pyth 2014 Isaac Grosof 13 esolang https://pyth.herokuapp.com/ 0 1117 0 8 22498 true 0 https://github.com/isaacg1/pyth esolang 2014 2024 16 57 263 29 false 2014 2024 768 31 119 2 25575 https://github.com/isaacg1/pyth/issues html restructuredtext python javascript css svg make markdown true 467 0 21 1 true https://pyth.readthedocs.io/en/latest https://esolangs.org/wiki/Pyth United States https://github.com/isaacg1/pyth 0 0 aplus A+ 1988 Arthur Whitney 14 pl arrayLang http://www.aplusdev.org/ 0 1118 1 22495 1531 true 0 pl false 1988 apl k unix linux j 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. 2008 57 71 1 890931 Morgan Stanley true 306 0 14 1 text United States https://riju.codes/aplus 'Hello, world!' https://en.wikipedia.org/wiki/A+_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=1531 aplusdev.org mapgen Mapgen 2017 Amit Patel 12 visual https://www.redblobgames.com/maps/mapgen4/ 0 1119 0 5 22493 true 0 https://github.com/redblobgames/mapgen4 visual 2018 2024 19 88 602 1 false mapgen.jpg 2017 2024 162 1 38 1 4660 https://www.redblobgames.com/maps/mapgen4/ Procedural wilderness map generator Procedural wilderness map generator Procedural wilderness map generator typescript javascript json html bourne-shell true 869 0 17 1 false https://github.com/redblobgames/mapgen4 0 0 lighttable Light Table 2012 Chris Granger 10 editor http://lighttable.com/ 0 1120 0 11 22492 false 0 https://github.com/LightTable/LightTable editor 2012 2025 425 914 11712 181 false 2013 2021 1378 102 194 20 29027 next generation code editor next generation code editor next generation code editor clojurescript css markdown javascript json bourne-shell yaml bash clojure xml html true 14558 0 21 1 false https://github.com/LightTable/LightTable 0 0 redprl redprl 2016 Jonathan Sterling 14 pl http://www.redprl.org/ 0 v0.1.0 1121 0 13 22490 true 0 https://github.com/redprl/sml-redprl pl 2016 2024 2016 33 18 227 7 false 2016 2019 1234 21 185 12 22610 2016 https://github.com/RedPRL standard-ml bourne-shell restructuredtext markdown vim-script python tex lisp lex css yaml make json true 304 0 27 1 false 0 true Various https://github.com/redprl/sml-redprl 0 0 redprl.org express EXPRESS 2004 12 dataNotation 0 1122 2 22485 true 0 dataNotation false e/Express.js 1993 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. 168 454 8075592 ISO js https://cheatsheets.zip/express 860 0 13 Switzerland SCHEMA Family; ENTITY Person ABSTRACT SUPERTYPE OF (ONEOF (Male, Female)); name: STRING; mother: OPTIONAL Female; father: OPTIONAL Male; END_ENTITY; ENTITY Female SUBTYPE OF (Person); END_ENTITY; ENTITY Male SUBTYPE of (Person); END_ENTITY; END_SCHEMA; "const express = require('express') const app = express() app.get('/', (_, res) => res.send(""Hello World"")) app.listen(8080)" Express """" true https://en.wikipedia.org/wiki/EXPRESS_(data_modeling_language) 0 0 ugbasic ugBASIC 2021 Marco Spedaletti 18 pl https://ugbasic.iwashere.eu 0 1123 0 2 22481 true 0 https://github.com/spotlessmind1975/ugbasic pl 2021 2024 11 13 84 348 false ugbasic.png 2021 2025 9673 8 6054 33 732099 ugBASIC is an isomorphic and open source language, fully documented and designed to develop portable programs, without sacrificing efficiency. With a single source it is therefore possible to create games for numerous 8 bit platforms. ugBASIC is an isomorphic and open source language, fully documented and designed to develop portable programs, without sacrificing efficiency. With a single source it is therefore possible to create games for numerous 8 bit platforms. https://github.com/spotlessmind1975/ugbasic/issues ugBASIC is an isomorphic and open source language, fully documented and designed to develop portable programs, without sacrificing efficiency. With a single source it is therefore possible to create games for numerous 8 bit platforms. .bas c assembly-language true 133 0 21 1 false https://www.youtube.com/watch?v=Klg1njCwZhs https://ugbasic.iwashere.eu/#about Italy https://github.com/spotlessmind1975/ugbasic 0 0 ugbasic.iwashere.eu modula Modula 1975 Niklaus Wirth 15 pl 0 1124 0 22477 771 true 0 pl false 1975 pascal alma-0 go modula-2 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. 2002 37 55 68 20824 ETH Zurich 205 0 17 algol-60 1 text Switzerland := true https://en.wikipedia.org/wiki/Modula 13 0 https://hopl.info/showlanguage.prx?exp=771 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 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 minikanren minikanren 2013 13 pl http://minikanren.org/ 0 1125 0 2 22475 true 0 https://github.com/miniKanren/miniKanren pl 2013 2024 2013 17 31 349 4 false 2013 2018 7 4 16 1 3549 https://github.com/miniKanren scheme markdown true 448 0 15 false United States https://twitter.com/minikanren https://github.com/miniKanren/miniKanren 0 0 minikanren.org egl EGL 2008 17 pl 0 1126 2 22473 7930 true 0 pl false e/Egl.egl Enterprise Generation Language 2008 java cobol c uml javascript jvm linux systemz soap ibm-rpg 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 2004 26 14 104 1205107 IBM egl 150 0 19 text http://www.rosettacode.org/wiki/Category:EGL "program HelloWorld function main() SysLib.writeStdout(""Hello World""); end end " "1 package com.mycompany.ui; 2 3 import com.mycompany.services.Employee; 4 import com.mycompany.services.EmployeeService; 5 import dojo.widgets.DojoGrid; 6 import dojo.widgets.DojoGridColumn; 7 8 handler EmployeeView type RUIhandler { initialUI = [ grid ], 9 onConstructionFunction = start, 10 cssFile = ""main.css"" } 11 12 grid DojoGrid { behaviors = [ ], headerBehaviors = [ ], columns = [ 13 new DojoGridColumn { displayName = ""First Name"", name = ""FIRSTNAME"" }, 14 new DojoGridColumn { displayName = ""Last Name"", name = ""LASTNAME"" }, 15 new DojoGridColumn { displayName = ""Salary"", name = ""SALARY"" } 16 ] }; 17 18 function start() 19 svc EmployeeService { }; 20 call svc.getEmployees () returning to displayEmployees; 21 end 22 23 function displayEmployees(retResult Employee [ ] in) 24 grid.data = retResult as any [ ]; 25 end 26 27 end" Egl SysLib.writeStdout """" true true https://en.wikipedia.org/wiki/EGL_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=7930 EGL title|year|author|goodreadsId|rating|ratings|reviews\nIBM Rational Business Developer with EGL|2008|Ben Margolis|6568310|2.00|2|0 pegdown pegdown 2010 Mathias Sirthias 11 textMarkup https://pegdown.org/ 0 1127 0 5 22468 true 0 https://github.com/sirthias/pegdown textMarkup 2010 2024 62 218 1290 84 true 2010 2016 300 31 582 12 8454 A pure-Java Markdown processor based on a parboiled PEG parser supporting a number of extensions A pure-Java Markdown processor based on a parboiled PEG parser supporting a number of extensions A pure-Java Markdown processor based on a parboiled PEG parser supporting a number of extensions markdown html java scala xhtml true 1977 0 16 1 false https://github.com/sirthias/pegdown 0 0 rpm-package-manager Rpm 1997 11 packageManager http://www.rpm.org 0 1128 0 22467 false 0 packageManager false 1996 1997 c perl linux fat gzip 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). 2002 391 35 847 21772272 Red Hat true 1976 0 11 text United States https://en.wikipedia.org/wiki/Rpm_(software) 0 0 rpm.org ags-script Adventure Game Studio Script 2001 15 pl http://www.adventuregamestudio.co.uk/site/ags/tutorial/scripting/1/ 0 1129 2 22467 true 0 pl 631 674 128 0 ags c_cpp clike text/x-c++src source.c++ programming false 359 2005 2018 4 23 Adventure Game Studio asc ash 201 0 16 text "function hDoor_Look() { Display(""It's quite a large, ominous looking door.""); }" // Main header script - this will be included into every script in // the game (local and global). Do not place functions here; rather, // place import definitions and #define names here to be used by all // scripts. // true true false 0 0 AGS Script https://github.com/textmate/c.tmbundle AGS Script kit Kit 2012 15 template https://codekitapp.com/help/kit/ 0 1130 2 22467 true 0 template 59 67 218 0 html htmlmixed text/html text.html.basic markup false 371 2013 2018 1 51 HTML template language from CodeKit HTML template language from CodeKit https://codekitapp.com/about/ HTML template language from CodeKit kit 201 0 15 text 1359 United States https://www.hongkiat.com/blog/kit-language/ "

" 0 0 Kit https://github.com/atom/language-html Kit nxc Not eXactly C 2006 18 pl 0 1131 2 22466 true 0 pl false n/NXC.nxc 2006 assembly-language c nqc 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: 2008 21 13 50 16826148 https://sourceforge.net/p/bricxcc/_list/tickets nxc 125 0 21 text United States https://www.hispabrickmagazine.com/pdfs/HBM009_EN/HBM009_EN-32-33.pdf "task main() { TextOut(0, LCD_LINE1, ""Hello World""); } " task main() //sets a new task. main() is compulsory { OnFwd(OUT_BC,75); //ask the motors connected to ports B and C to move forward at a power of 75. Wait(5000); //wait for 5 seconds [the value is in milliseconds](note that 1000 = 1 second) Off(OUT_BC); //off the motors connected to ports B and C } NXC // TextOut """" true true true false true https://en.wikipedia.org/wiki/Not_eXactly_C 0 0 femtolisp femtolisp 2008 Jeff Bezanson 11 pl 0 1132 0 7 22459 true 0 https://github.com/JeffBezanson/femtolisp pl 2012 2024 2008 74 119 1564 21 false 2008 2019 300 15 112 2 43805 Julia Computing Inc c lisp scheme make clojure markdown bourne-shell true 1937 0 18 1 false United States https://en.wikipedia.org/wiki/Julia_(programming_language)#Implementation https://github.com/JeffBezanson/femtolisp 0 0 clisp CLISP 1973 16 pl 0 1133 1 22455 604 true 0 pl false c/CLISP.lisp 1987 common-lisp unix c 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). 2004 31 118 940494 Xerox PARC lisp true 175 0 18 https://tio.run/#clisp United States https://semanticscholar.org/paper/4fa23aa15e2d62ee9f3a4091d8b05b1fe4dcd1ac "(write-line ""Hello World"")" CLISP write-line """" true true https://en.wikipedia.org/wiki/CLISP 0 0 https://hopl.info/showlanguage.prx?exp=604 krl KRL 1976 Daniel G. Bobrow and Terry Winograd 21 pl 0 1134 1 22454 763 true 0 pl 18 30 440 0 text none programming false knowledge representation language 1976 kuka 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. 2002 14 18 38 17227 Xerox PARC && Stanford University krl 90 0 25 2 text United States "ruleset sample { meta { name ""Hello World"" description << Hello world >> author ""Phil Windley"" } // just one rule rule hello { select when web pageview notify(""Hello world!"", ""Just a note to say hello""); } } " // """" true true false true https://en.wikipedia.org/wiki/KRL_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=763 KRL year|publisher|title|authors|isbn13\n||Krl (programming Language)|Surhone and Lambert M. and Tennoe and Mariam T. and Henssonow and Susan F.|9786133170896 KRL json-url json->url 2017 Tim Bray 20 jsonFormat https://jsonurl.org 0 v1.1.7 1135 0 6 22451 true 0 https://github.com/jsonurl/jsonurl-js jsonFormat 2020 2024 5 7 41 10 false 2020 2024 591 11 67 3 17070 https://jsonurl.org/#sandbox 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. 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. Textuality Services, Inc. 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. javascript json markdown bourne-shell yaml typescript true 95 0 26 1 false 1 true https://tio.run/#https://jsonurl.org/#sandbox https://github.com/jsonurl/specification Canada https://www.rfc-editor.org/rfc/rfc8259 https://github.com/jsonurl/jsonurl-js https://en.wikipedia.org/wiki/JSON%E2%86%92URL 0 0 moo MOO 1993 23 pl 0 1136 4 22451 true 0 pl 23 23 83 0 text none programming false m/Moo.moo MUD, object-oriented 1993 scheme smalltalk self c ada muf lpc pike linden-scripting-language 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. 2001 12 67 119 20178 University of Waterloo moo moo 80 0 25 text https://github.com/antlr/grammars-v4/tree/master/moo http://www.rosettacode.org/wiki/Category:MOO Canada "@program toy:wind this.wound = this.wound + 2; player:tell(""You wind up the "", this.name,"".""); player.location:announce(player.name, "" winds up the "", this.name,"".""); . " "@program hello:run player:tell(""Hello World""); ." "@program toy:wind if (this.location == player) if (this.wound < this.maximum) this.wound = this.wound + 2; player:tell(""You wind up the "", this.name,"".""); player.location:announce(player.name, "" winds up the "", this.name,"".""); if (this.wound >= this.maximum) player:tell(""The knob comes to a stop while winding.""); endif else player:tell(""The "",this.name,"" is already fully wound.""); endif else player:tell(""You have to be holding the "", this.name,"".""); endif ." Moo player:tell """" true true false true https://en.wikipedia.org/wiki/MOO_(programming_language) 0 0 MOO Moocode Moocode maya Maya Embedded Language 2013 14 pl 0 1137 1 22442 true 0 pl false MEL Script 2013 perl tcl python 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. 2005 50 30 97 1690201 Autodesk 270 0 15 text United States // animated duplicates/instances script proc animatedDuplication (int $rangeStart, int $rangeEnd, int $numOfDuplicates, int $duplicateOrInstance) { int $range_start = $rangeStart; int $range_end = $rangeEnd; int $num_of_duplicates = $numOfDuplicates; int $step_size = ($range_end - $range_start) / $num_of_duplicates; int $i = 0; int $temp; currentTime $range_start; // set to range start string $selectedObjects[]; // to store selected objects $selectedObjects = `ls -sl`; // store selected objects select $selectedObjects; while ($i <= $num_of_duplicates) { $temp = $range_start + ($step_size * $i); currentTime ($temp); // selected the objects to duplicate or instance select $selectedObjects; if($duplicateOrInstance == 0) { duplicate; } else { instance; } $i++; } } // Usage example: // duplicate the current selection 5 times -- // evenly distributed between frame 1 and 240 animatedDuplication(1, 240, 5, 0); // true true false https://en.wikipedia.org/wiki/Maya_Embedded_Language 0 0 bato Bato 2016 Joel Bryan Juliano 13 pl https://jjuliano.github.io/bato/ 0 1138 1 1 22440 true 0 https://github.com/jjuliano/bato pl 2016 2024 28 26 329 2 false 2016 2024 55 9 53 1 2150 A general-purpose scripting language in Filipino dialect A general-purpose scripting language in Filipino dialect A general-purpose scripting language in Filipino dialect ruby true 418 0 14 1 false Philippines https://www.theregister.com/2018/03/21/philippines_ruby_bato " ang gumawaNgID mag_print ""------------------------------------------"" magbigay_daan mag_print ""------------------------------------------"" wakas" https://github.com/jjuliano/bato 0 0 edje-data-collection Edje Data Collection 2010 15 jsonFormat 0 1139 1 22440 true 0 jsonFormat 30865 0 c_cpp clike text/x-c++src source.c++ data false 21 2007 2016 1 11 An Edje Data Collection, it's a plain text file (normally identified with the .edc extension), consisting of instructions for the Edje Compiler. An Edje Data Collection, it's a plain text file (normally identified with the .edc extension), consisting of instructions for the Edje Compiler. Enlightenment development team An Edje Data Collection, it's a plain text file (normally identified with the .edc extension), consisting of instructions for the Edje Compiler. edc 200 0 17 text Various https://phab.enlightenment.org/w/edjebasics/ "// https://raw.githubusercontent.com/billiob/terminology/master/data/themes/mild.edc /* overlay to default to make theme easier on the eyes, less effects */ #ifndef BG_COLOR #define BG_COLOR 48 48 48 255 #endif #ifndef BG_COLOR_TRANSLUCENT #define BG_COLOR_TRANSLUCENT 48 48 48 200 #endif #ifndef BELL_OVERLAY_COLOR #define BELL_OVERLAY_COLOR 220 220 220 16 #endif collections { group { name: ""terminology/background""; #ifndef INHERIT_PROVIDE_OWN_COLORS color_classes { #include ""default_colors.in.edc"" } #endif images { image: ""bg_bevel.png"" COMP; image: ""bg_shine.png"" COMP; image: ""bg_glint.png"" COMP; image: ""bg_led_base.png"" COMP; image: ""bg_led.png"" COMP; image: ""bg_led_strobe.png"" COMP; image: ""pm_shadow.png"" COMP; image: ""pm_overlay.png"" COMP; image: ""pm_fill.png"" COMP; image: ""tab_bg_l0.png"" COMP; image: ""tab_bg_l1.png"" COMP; image: ""tab_bg_r0.png"" COMP; image: ""tab_bg_r1.png"" COMP; image: ""tab_shad_l0.png"" COMP; image: ""tab_shad_l1.png"" COMP; image: ""tab_shad_r0.png"" COMP; image: ""tab_shad_r1.png"" COMP; } sounds { sample { name: ""bell"" LOSSY 64; source: ""bell.wav""; } } script { public message(Msg_Type:type, id, ...) { new r, g, b, a, v; if ((type != MSG_INT) || (id != 1)) return; v = (getarg(2) * 255) / 100; custom_state(PART:""base"", ""default"", 0.0); get_state_val(PART:""base"", STATE_COLOR, r, g, b, a); set_state_val(PART:""base"", STATE_COLOR, r, g, b, v); set_state(PART:""base"", ""custom"", 0.0); custom_state(PART:""fade"", ""default"", 0.0); get_state_val(PART:""fade"", STATE_COLOR, r, g, b, a); set_state_val(PART:""fade"", STATE_COLOR, r, g, b, v); set_state(PART:""fade"", ""custom"", 0.0); } } pa" /* */ true true false 0 0 https://github.com/textmate/json.tmbundle Edje Data Collection gcc-machine-description GCC Machine Description 2001 15 pl 0 1140 1 22440 true 0 pl 856 878 1027 0 lisp commonlisp text/x-common-lisp source.lisp programming false 40 2005 2018 1 6 University of Arizona md 200 0 16 text United States https://en.wikipedia.org/wiki/Register_transfer_language ;;- Machine description for the PDP-10. ;; Copyright (C) 2001, 2002 Lars Brinkhoff. ;; Contributed by Lars Brinkhoff , funded by XKL, LLC. ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ;; Index ;; Front Page ;; Index ;; Constraints for Immediate Operands ;; To-do List ;; Instruction Wish-List ;; Attributes ;; length, skip, reorg_type ;; Unspec Usage ;; UNSPEC_ADJSP, UNSPEC_ADJBP, UNSPEC_ADDRESS, UNSPEC_FFO, UNSPEC_SUBBP, ;; VUNSPEC_BLT, VUNSPEC_FSC, VUNSPEC_XBLT, VUNSPEC_MOVSLJ, VUNSPEC_MOVST ;; Constants ;; RIGHT_HALF, LEFT_HALF, SIGNBIT, SP_REGNUM ;; Optimizations ;; Data Movement ;; LDB, ILDB, (LDBI), LDBE, ILDBE, (LDBEI), DPB, IDPB, (DPBI), ;; HRR, HRL, HLR, HLL, HRRM, HRLM, HLRM, HLLM, ;; HRRZ, HRLZ, HLRZ, HLLZ, HRRE, HRLE, HLRE, HLLE, ;; SETZM, SETOM, ;; MOVE, MOVEI, MOVSI, HRLOI, HRROI, MOVEM, ;; MOVS, EXCH, SETZB, ;; DMOVE, DMOVEM, ;; BLT, XBLT, (MOVSLJ), (MOVST), (CMPS) ;; Conditional Data Movement ;; SKIPL, SKIPE, SKIPLE, SKIPGE, SKIPN, SKIPG, ;; TDZA ;; Integer Arithmetic ;; AOS, SOS, ;; ADD, ADDI, ADDM, ADDB, DADD, ;; SUB, SUBI, SUBM, SUBB, DSUB, ;; IMUL, IMULI, IMULM, IMULB, MUL, MULI, MULM, MULB, DMUL, ;; IDIV, IDIVI, IDIVM, DIV, DIVI, DIVM, DDIV, ;; UIDIV, UIDIVI, UIDIVM, UIMOD, UIMODI, UIMODM, ;; MOVN, MOVNM, MOVNS, MOVNI, DMOVN, DMOVNM, ;; MOVM, MOVMM, MOVMS, ;; FFS ;; Integer Conversions ;; ANDI, HRRZ, SEXT, HRRE, ANDI, HRR ;; Shifting and Rotating ;; LSH, LSHC, ASH, ASHC, ROT, ROTC ;; Logical Operations ;; AND, ANDI, ANDM, ANDB, TLZ, ANDCMI, ;; ANDCA, ANDCAI, ANDCAM, ANDCAB, ANDCBI, ;; ANDCM, ANDCMM, ANDCMB, ;; XOR, XORI, XORM, XORB, TLC, EQVI, ;; IOR, IORI, IORM, IORB, TLO, ORCMI, ;; ANDCB, ANDCBM, ANDCBB, ;; EQV, EQVM, EQVB, ;; SETCA, SETCAM, SETCAB, ;; SETCM, SETCMM, SETCMB, ;; ORCA, ORCAI, ORCAM, ORCAB, ORCBI, ;; ORCM, ORCMM, ORCMB, ;; ORCB, ORCBM, ORCBB ;; Floating-point Arithmetic ;; FADR, FADRI, FADRM, FADRB, DFAD, GFAD, ;; FSBR, FSBRI, FSBRM, FSBRB, DFSB, ; true true false 0 0 GCC Machine Description https://github.com/textmate/lisp.tmbundle GCC Machine Description shaderlab ShaderLab 2000 15 pl 3d shadingLanguage 0 1141 1 22440 true 0 pl 1132 1210 59455 3 "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入门精要》源代码""" text source.shaderlab programming false 5 2017 2017 3 2 https://github.com/tgjones/shaders-tmLanguage/issues shader 200 0 16 text United Kingdom https://docs.unity3d.com/Manual/SL-Shader.html "// From https://github.com/Unity-Technologies/PostProcessing, // licensed under MIT licence. Shader ""Hidden/Post FX/Depth Of Field"" { Properties { _MainTex ("""", 2D) = ""black"" } CGINCLUDE #pragma exclude_renderers d3d11_9x #pragma target 3.0 ENDCG SubShader { Cull Off ZWrite Off ZTest Always // (0) Downsampling, prefiltering & CoC Pass { CGPROGRAM #pragma multi_compile __ UNITY_COLORSPACE_GAMMA #pragma vertex VertDOF #pragma fragment FragPrefilter #include ""DepthOfField.cginc"" ENDCG } // (1) Pass 0 + temporal antialiasing Pass { CGPROGRAM #pragma vertex VertDOF #pragma fragment FragPrefilter #define PREFILTER_TAA #include ""DepthOfField.cginc"" ENDCG } // (2-5) Bokeh filter with disk-shaped kernels Pass { CGPROGRAM #pragma vertex VertDOF #pragma fragment FragBlur #define KERNEL_SMALL #include ""DepthOfField.cginc"" ENDCG } Pass { CGPROGRAM #pragma vertex VertDOF #pragma fragment FragBlur #define KERNEL_MEDIUM #include ""DepthOfField.cginc"" ENDCG } Pass { CGPROGRAM #pragma vertex VertDOF #pragma fragment FragBlur #define KERNEL_LARGE #include ""DepthOfField.cginc"" ENDCG } Pass { CGPROGRAM #pragma vertex VertDOF #pragma fragment FragBlur #define KERNEL_VERYLARGE #include ""DepthOfField.cginc"" ENDCG } // (6) Postfilter blur Pass { CGPROGRAM #pragma vertex VertDOF #pragma fragment FragPostBlur #include ""DepthOfField.cginc"" ENDCG } } FallBack Off }" // true true false 0 0 ShaderLab https://github.com/tgjones/shaders-tmLanguage ShaderLab gforth Gforth 1992 16 pl https://www.gnu.org/software/gforth/ 0 1142 0 27 22437 true 0 https://git.savannah.gnu.org/git/gforth.git pl false 1994 2025 10062 22 1424 121 271752 1992 Gforth is a free and portable implementation of the Forth programming language for Unix-like systems, Microsoft Windows, and other operating systems. A primary goal of Gforth is to adhere to the ANS Forth standard. Gforth is free software as part of the GNU Project. 25 10 25795841 https://www.gnu.org/software/gforth/gforth.html#MAILLIST forth f-sharp c bourne-shell make bash tex assembly-language yaml markdown python sed dockerfile java scheme xml awk m4 vim-script yacc lex lisp pascal diff css javascript powerbuilder true 168 0 44 forth false https://tio.run/#forth-gforth Various https://git.savannah.gnu.org/git/gforth.git true true false https://en.wikipedia.org/wiki/Gforth 0 0 tht tht 2017 16 pl https://tht-lang.org/ 0 v0.7.1 1143 1 6 22435 true 0 https://github.com/joelesko/tht pl 2017 2024 2017 12 7 137 7 false 2017 2024 732 7 370 24 php css javascript markdown bourne-shell json true 167 0 23 false 0 true // Familiar variable and List syntax. $colors = ['red', 'blue', 'green']; // New JSON-style syntax for Maps $colorHex = { red: '#FF0000', green: '#00FF00', blue: '#0000FF', }; // Built-in types have methods using // the mainstream 'dot' syntax. $colors.push('purple'); // Extra parens aren't needed. if $colors.length() > 3 { $colors.pop(); } // The standard library is organized // into modules. Response.sendPage({ title: 'Colors', body: bodyHtml($colors), }); // Template Functions let you organize // your output (views) however you like. // (e.g. by component, module, file, etc.) template bodyHtml($colors) {
Colors
-- foreach $colors as $c {
{{ $c.toUpperCaseFirst() }} -- } } https://github.com/joelesko/tht // true true false 0 0 tht-lang.org id|title|time|timestamp|by|comments|score\n15163343|Show HN: THT – a cleaner, safer language that compiles to PHP|2017-09-03 19:29:56 UTC|1504466996|jlesk|0|3 asdf ASDF 2015 Perry Greenfield and Michael Droettboom and Erik M. Bray 12 pl https://asdf.readthedocs.io/ 0 3.2.0 1144 0 9 22434 true 0 https://github.com/asdf-format/asdf pl 2014 2024 2011 30 57 512 115 false 2011 2025 4988 68 889 8 138596 Space Telescope Science Institute json python restructuredtext yaml diff markdown ini toml make true 753 0 23 3 false 3 true United States https://github.com/asdf-format/asdf 0 0 google-apps-script Google Apps Script 2009 12 pl 0 1145 2 22429 true 0 pl false g/Google Apps Script.gs 2009 javascript "Apps Script is a scripting language for light-weight application development in the G Suite platform. It is based on JavaScript 1.6 with some portions of 1.7 and 1.8 and provides subset of ECMAScript 5 API, however instead of running on the client, it gets executed in the Google Cloud. According to Google, Apps Script ""provides easy ways to automate tasks across Google products and third party services."" Apps Script is also the tool that powers the add-ons for Google Docs, Sheets and Slides." 2011 143 473 139 31285354 Google 735 0 14 United States "function helloWorld() { Logger.log(""Hello World""); } " "function doGet() { var app = UiApp.createApplication(); app.add(app.createHTML(""Hello World!"")); return app; }" Google Apps Script Logger.log """" true true https://en.wikipedia.org/wiki/Google_Apps_Script 0 0 project-mentat Project Mentat 2016 Richard Newman 21 queryLanguage https://mentat.rs/ 0 0.11.1 1146 1 18 22429 true 0 https://github.com/qpdb/mentat queryLanguage 2018 2024 2016 4 2 52 299 false 2016 2022 1530 27 2321 43 339865 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. 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. Mozilla 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. html rust javascript java toml xml swift markdown yaml css json gradle bourne-shell python dockerfile svg kotlin make true 87 0 43 datascript datomic sqlite 1 false 0 true United States https://mozilla.github.io/mentat {:db/id :person/email :db/valueType :db.type/string :db/cardinality :db.cardinality/many ; People can have multiple email addresses. :db/unique :db.unique/identity ; For our purposes, each email identifies one person. :db/index true} ; We want fast lookups by email. {:db/id :person/friend :db/valueType :db.type/ref :db/cardinality :db.cardinality/many} ; People can have many friends. https://github.com/qpdb/mentat ; true true false 0 0 mentat.rs strictyaml StrictYAML 2016 Colm O'Connor 11 dataNotation https://hitchdev.com/strictyaml/ 0 1147 0 5 22427 true 0 https://github.com/crdoconnor/strictyaml dataNotation 2016 2025 27 61 1522 96 false 2016 2023 802 21 226 2 31954 StrictYAML is a type-safe YAML parser that parses and validates a restricted subset of the YAML specification. StrictYAML is a type-safe YAML parser that parses and validates a restricted subset of the YAML specification. StrictYAML is a type-safe YAML parser that parses and validates a restricted subset of the YAML specification. markdown python yaml toml bourne-shell true 1728 0 17 yaml 1 false https://github.com/crdoconnor/strictyaml 0 0 snap Snap! 2011 Brian Harvey 13 pl https://snap.berkeley.edu/ 0 1148 0 22427 true 0 pl false https://snap.berkeley.edu/snap/snap.html 2011 javascript squeak scratch scheme logo smalltalk python c linux ios 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. 2011 77 28 101 34236881 University of California Berkeley ypr ysp xml true 406 0 13 1 text 7321 United States https://en.wikipedia.org/wiki/Snap!_(programming_language) 0 0 algol-w ALGOL W 1966 Niklaus Wirth and Tony Hoare 16 pl 0 1149 2 22427 243 true 0 pl false a/ALGOL W.algol 1966 algol-60 pascal modula-2 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. 2003 29 41 107 211058 Stanford University 165 0 20 algol-60 2 text "begin write( ""Hello World"" ) end. " RECORD PERSON ( STRING(20) NAME; INTEGER AGE; LOGICAL MALE; REFERENCE(PERSON) FATHER, MOTHER, YOUNGESTOFFSPRING, ELDERSIBLING ); REFERENCE(PERSON) PROCEDURE YOUNGESTUNCLE (REFERENCE(PERSON) R); BEGIN REFERENCE(PERSON) P, M; P := YOUNGESTOFFSPRING(FATHER(FATHER(R))); WHILE (P ¬= NULL) AND (¬ MALE(P)) OR (P = FATHER(R)) DO P := ELDERSIBLING(P); M := YOUNGESTOFFSPRING(MOTHER(MOTHER(R))); WHILE (M ¬= NULL) AND (¬ MALE(M)) DO M := ELDERSIBLING(M); IF P = NULL THEN M ELSE IF M = NULL THEN P ELSE IF AGE(P) < AGE(M) THEN P ELSE M END ALGOL W write """" true true https://en.wikipedia.org/wiki/ALGOL_W 1 0 https://hopl.info/showlanguage.prx?exp=243 title|year|author|goodreadsId|rating|ratings|reviews\nStructured Programming And Problem Solving With Algol W||Richard B. Kieburtz|4755689|0.0|0|0 multiaddr multiaddr 2014 Juan Batiz-Benet 12 schema http://multiformats.io/multiaddr/ 0 1150 0 7 22426 true 0 https://github.com/multiformats/multiaddr schema 2014 2024 2014 43 84 419 37 false 2014 2024 168 56 16 1 581 https://github.com/multiformats markdown go yaml clojure csv gherkin make true 729 0 20 url 1 false Various https://github.com/multiformats/multiaddr 0 0 elf Extensible Linking Format 1999 10 binaryExecutable 0 1151 0 22425 false 1 gold-linker binaryExecutable false Extensible Linking Format 1999 unix x86-isa ascii linux solaris freebsd sparc mips powerpc arm risc-v coff preferred-executable-format android atmel-avr ia-32 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. 2001 625 194 570 9914 Unix System Laboratories 3145 0 10 https://tio.run/#elf binary United States https://en.wikipedia.org/wiki/Executable_and_Linkable_Format 0 0 autocad-app AutoCAD 1982 John Walker and Michael Riddle 10 application cad 3d https://www.autodesk.com/products/autocad/overview 0 1152 0 22425 4836 false 0 application false 1982 ios android dwg unix autolisp vba 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. 2001 1669 741 2753 Autodesk 8366 0 11 2 United States https://en.wikipedia.org/wiki/AutoCAD 0 0 https://hopl.info/showlanguage.prx?exp=4836 orc-lang Orc 2004 Jayadev Misra 21 pl http://orc.csres.utexas.edu/ 0 1153 1 22423 true 0 pl false o/Orc.orc 2004 haskell ml oz smalltalk 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. 2007 13 11 37 13345244 University of Texas at Austin orc true 86 0 25 1 text United States "{- HelloWorld.orc -- Orc program HelloWorld - - $Id$ - - Created by xbony2 on Nov 8, 2014 8:30:25 PM - Licensed under public domain. -} Println(""Hello World"") >> stop " Orc {- -} Println """" true true true false true https://en.wikipedia.org/wiki/Orc_(programming_language) 0 0 orc.csres.utexas.edu geojson GeoJSON 2008 11 jsonFormat http://geojson.org/ 0 1154 1 22422 true 0 jsonFormat false 2007 2007 json julia GeoJSON is an open standard format designed for representing simple geographical features, along with their non-spatial attributes. It is based on JSON, the JavaScript Object Notation. The features include points (therefore addresses and locations), line strings (therefore streets, highways and boundaries), polygons (countries, provinces, tracts of land), and multi-part collections of these types. GeoJSON features need not represent entities of the physical world only; mobile routing and navigation apps, for example, might describe their service coverage using GeoJSON. The GeoJSON format differs from other GIS standards in that it was written and is maintained not by a formal standards organization, but by an Internet working group of developers. A notable offspring of GeoJSON is TopoJSON, an extension of GeoJSON that encodes geospatial topology and that typically provides smaller file sizes. 2009 335 38 151 24627646 Planet Labs && Mapbox && Hobu Inc && Cadcorp 1696 0 14 text United States and United Kingdom https://tools.ietf.org/html/rfc7946 "{ ""type"":""Topology"", ""transform"":{ ""scale"": [1,1], ""translate"": [0,0] }, ""objects"":{ ""two-squares"":{ ""type"": ""GeometryCollection"", ""geometries"":[ {""type"": ""Polygon"", ""arcs"":[[0,1]],""properties"": {""name"": ""Left_Polygon"" }}, {""type"": ""Polygon"", ""arcs"":[[2,-1]],""properties"": {""name"": ""Right_Polygon"" }} ] }, ""one-line"": { ""type"":""GeometryCollection"", ""geometries"":[ {""type"": ""LineString"", ""arcs"": [3],""properties"":{""name"":""Under_LineString""}} ] }, ""two-places"":{ ""type"":""GeometryCollection"", ""geometries"":[ {""type"":""Point"",""coordinates"":[0,0],""properties"":{""name"":""Origine_Point""}}, {""type"":""Point"",""coordinates"":[0,-1],""properties"":{""name"":""Under_Point""}} ] } }, ""arcs"": [ [[1,2],[0,-2]], [[1,0],[-1,0],[0,2],[1,0]], [[1,2],[1,0],[0,-2],[-1,0]], [[0,-1],[2,0]] ] }" https://en.wikipedia.org/wiki/GeoJSON 0 0 geojson.org atomspace atomspace 2008 11 application https://wiki.opencog.org/w/AtomSpace 0 v5.0.3-stable 1155 0 17 22421 false 0 https://github.com/opencog/atomspace application 2015 2024 2008 86 224 803 75 false 2008 2025 34110 214 1266 174 270238 OpenCog Foundation scheme cpp cmake markdown xml python haskell cython bourne-shell yaml ocaml svg tex sql csv ini c true 1691 0 28 false 5 true Various https://github.com/opencog/atomspace 0 0 hush Hush 2021 Gabriel Bastos 12 pl https://hush-shell.github.io/ 0 v0.1.4-alpha 1156 0 10 22418 true 0 https://github.com/hush-shell/hush pl 2020 2024 2020 12 23 633 17 false 2020 2024 299 7 224 1 19270 https://github.com/hush-shell/ rust json bourne-shell markdown python lua toml lisp dockerfile make true 711 0 22 1 false 0 true Brazil https://github.com/hush-shell/hush 0 0 flowgorithm Flowgorithm 2014 13 visual http://www.flowgorithm.org/ 0 1157 0 22416 true 2 larp visual-logic visual false flowgorithm.png 2014 Flowgorithm is a free beginner's programming language that is based on simple graphical flowcharts. Flowgorithm is a free beginner's programming language that is based on simple graphical flowcharts. http://robatz.altervista.org Flowgorithm is a free beginner's programming language that is based on simple graphical flowcharts. 221 0 15 dot scratch Italy https://reddit.com/r/flowgorithm https://twitter.com/flowgorithm 0 0 flowgorithm.org pandoc-app Pandoc 2006 13 application http://pandoc.org/ 0 1158 0 1 22415 false 0 application false 2014 2006 haskell markdown html restructuredtext latex org ooxml tex lua bibtex 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. 2014 75 136 66 43162750 If you need to convert files from one markup format into another, pandoc is your swiss-army knife. If you need to convert files from one markup format into another, pandoc is your swiss-army knife. https://github.com/jgm/pandoc/issues If you need to convert files from one markup format into another, pandoc is your swiss-army knife. haskell true 396 0 14 false text United States https://en.wikipedia.org/wiki/Pandoc 0 0 pandoc.org markovjunior MarkovJunior 2022 Maxim Gumin 10 pl 0 1159 0 4 22414 true 0 https://github.com/mxgmn/MarkovJunior pl 2022 2024 2022 93 309 6930 5 false 2022 2024 32 6 473 15 11321 https://github.com/mxgmn/MarkovJunior/issues xml csharp markdown yaml true 7864 0 14 1 false Finland https://github.com/mxgmn/MarkovJunior 0 0 pikelet pikelet 2017 Brendan Zabarauskas 12 pl https://pikelet-lang.github.io/pikelet/ 0 1160 0 6 22413 true 0 https://github.com/pikelet-lang/pikelet pl 2017 2024 2017 30 26 610 31 false 2017 2021 1190 12 90 6 13733 Pikelet is a small, functional, dependently typed programming language. Pikelet is a small, functional, dependently typed programming language. https://github.com/pikelet-lang Pikelet is a small, functional, dependently typed programming language. markdown rust toml json yaml javascript true 702 0 18 1 false Australia https://github.com/pikelet-lang/pikelet 0 0 vi vi 1976 Bill Joy 10 editor 0 1161 1 22410 false 1 vim editor false v/Vi 1976 c unix emacs-editor ruby solaris freebsd vim utf-8 "vi is a screen-oriented text editor originally created for the Unix operating system. The portable subset of the behavior of vi and programs based on it, and the ex editor language supported within these programs, is described by (and thus standardized by) the Single Unix Specification and POSIX.The original code for vi was written by Bill Joy in 1976, as the visual mode for a line editor called ex that Joy had written with Chuck Haley. Bill Joy's ex 1.1 was released as part of the first Berkeley Software Distribution (BSD) Unix release in March 1978. It was not until version 2.0 of ex, released as part of Second BSD in May 1979 that the editor was installed under the name ""vi"" (which took users straight into ex's visual mode), and the name by which it is known today. Some current implementations of vi can trace their source code ancestry to Bill Joy; others are completely new, largely compatible reimplementations. The name ""vi"" is derived from the shortest unambiguous abbreviation for the ex command visual, which switches the ex line editor to visual mode. The name is sometimes pronounced (as in the discrete English letters v and i) and sometimes to rhyme with bye.In addition to various non–free software variants of vi distributed with proprietary implementations of Unix, vi was opensourced with OpenSolaris, and several free and open source software vi clones exist. A 2009 survey of Linux Journal readers found that vi was the most widely used text editor among respondents, beating gedit, the second most widely used editor, by nearly a factor of two (36% to 19%)." 2001 589 713 1132 32494 true 2965 0 11 ex-editor 1 na "The following tab indented lines will cause a true vi with modelines activated to infinitely loop putting ""Hello World"" in the buffer. Hit to abort the loop and see the output. None of the vi clones support modelines this powerful, and modelines are disabled by default. Set the environment variable EXINIT to ""set ml"" to activate modelines. vi: $ y a : vi: $-1y b : vi: @b : put a |@b Hello World Whitespace is largely insignificant, but these must be the last five lines in the file to work properly. Unless it is in ""vi: ... :"" or ""ex: ... :"" format, any preceding text will be ignored. " Vi https://en.wikipedia.org/wiki/Vi 0 0 notation3 Notation3 1998 Tim Berners-Lee 13 dataNotation 0 1162 1 22408 true 0 dataNotation false n3 2008 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. 74 145 2906123 W3C 390 0 17 turtle rdf rdfa turtle 1 United States https://www.w3.org/DesignIssues/N3Resources "@prefix dc: . dc:title ""Tony Benn""; dc:publisher ""Wikipedia""." https://en.wikipedia.org/wiki/Notation3 0 0 toy-lang Toy 2018 Kayne Ruse 14 pl https://toylang.com/ 0 v1.3.1 1163 1 7 22408 true 0 https://github.com/Ratstail91/Toy pl 2018 2024 2018 10 9 219 3 false 2024 2025 1014 3 115 3 17826 2019 c markdown make json cpp xml yaml true 251 0 22 1 false 1 true "if (1 < 2) { print ""this will print to the console""; } else { print ""this will not""; }" https://github.com/Ratstail91/Toy print true 0 0 toylang.com sqrl SQRL 2018 Josh Yudaken and Pete Hunt and Julian Tempelsman and Paul Mou and Yunjing Xu and David Newman 16 queryLanguage https://sqrl-lang.github.io/sqrl/ 0 1164 1 13 22407 true 0 https://github.com/sqrl-lang/sqrl queryLanguage 2022 2024 1 10 113 5 false Smyte Query and Rules Language 2018 2023 259 12 689 9 100766 https://websqrl.vercel.app/twitter 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. 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. Smyte 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. typescript javascript markdown json ejs scss yaml jsx bash svg css python dockerfile true 157 0 34 6 false https://news.ycombinator.com/item?id=34680269 "LET Username := input(); LET Message := concat(""Hello, "", Username, ""!""); EOF" https://github.com/sqrl-lang/sqrl 0 0 charity Charity 1992 18 pl http://pll.cpsc.ucalgary.ca/charity1/www/home.html 0 1165 1 22407 1540 true 0 pl 7 10 11 0 text none programming false 1992 linux ml 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. 2005 18 16 38 1364508 University of Calgary ch 111 0 19 text 4766 Canada % % Some very badly written Charity % data LA(A) -> D = ss: A -> D | ff: -> D. % true true false https://en.wikipedia.org/wiki/Charity_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=1540 Charity Charity jupyter-notebook Jupyter Notebook 2014 12 jsonFormat 23 1166 1 22401 true 23 cloc deno flatline halide lfortran logica manim matplotlib mojo mongodb myia nltk onnx pandas pytorch sympy taichi tensorflow wiredtiger xarray xgboost-model xgboost xla jsonFormat 13715 17210 Notebook 137996 26 "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""" IPython Notebook json javascript application/json source.json markup false 21 2007 2016 1 11 ipynb true 200 0 15 ipynb text "{ ""cells"": [ { ""cell_type"": ""markdown"", ""metadata"": {}, ""source"": [ ""# Morphological image operations\n"", ""\n"", ""** Bird Counting **\n"", ""\n"", ""I've used some simple morphological image operations from scipy.morphology module.\n"", ""\n"", ""The goal was to count how many birds were in an image\n"", ""\n"", ""Here are the steps taken :\n"", ""\n"", ""1. Load the image as an ndimage matrix object\n"", ""2. Filter all pixels for those with a color tone less than 100/255\n"", ""3. Get a binary representation of the pixels that satisfy the condition in step 2\n"", ""4. Apply some dilation and erosion in order to get rid of noise and isolate the birds\n"", ""5. Count all contiguous areas"" ] }, { ""cell_type"": ""code"", ""execution_count"": 2, ""metadata"": { ""collapsed"": false, ""scrolled"": true }, ""outputs"": [ { ""name"": ""stdout"", ""output_type"": ""stream"", ""text"": [ ""Original image:\n"" ] }, { ""data"": { ""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" true false true 0 0 Jupyter Notebook https://github.com/textmate/json.tmbundle Jupyter Notebook focal Formulating On-Line Calculations in Algebraic Language 1968 Richard Merrill 18 pl 0 1167 2 22400 406 true 0 pl false f/Focal.fc Formulating On-Line Calculations in Algebraic Language 1968 joss basic mumps "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 DEC'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." 2004 18 51 96 1170592 DEC fc 110 0 19 1 https://tio.run/#focal text 9081 https://github.com/antlr/grammars-v4/tree/master/focal http://www.rosettacode.org/wiki/Category:FOCAL United States "0.1.0.1 TYPE ""HELLO WORLD"" , ! " "FOCAL15 V6B *01.10 ASK ""IN WHAT YEAR WERE YOU BORN?"", YEAR *01.20 SET YEAROFFOCAL=YEAR-1969+1 *01.30 IF (YEAROFFOCAL) 02.10,02.10,01.40 *01.40 TYPE ""YOU WERE BORN IN THE YEAR "",YEAROFFOCAL,"" OF FOCAL!"",! *01.50 GOTO 01.10 *02.10 TYPE ""YOU ARE TOO OLD FOR FOCAL, POPS"",! *02.20 GOTO 01.10 *GO IN WHAT YEAR WERE YOU BORN?:1969 YOU WERE BORN IN THE YEAR 1.0000 OF FOCAL IN WHAT YEAR WERE YOU BORN?:1950 YOU ARE TOO OLD FOR FOCAL, POPS IN WHAT YEAR WERE YOU BORN?:" Focal """" true https://en.wikipedia.org/wiki/FOCAL_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=406 clist CLIST 1990 17 pl 0 1168 1 22398 3423 true 0 pl false 1956 batch cobol pl-i jcl rexx "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." 2003 21 24 63 391542 IBM 125 0 20 text United States "1 /********************************************************************/ 2 /* MULTI-LINGUAL ""HELLO WORLD"" PROGRAM. */ 3 /* */ 4 /* THIS CLIST, STORED AS USERID.TSO.CLIST(TEST), CAN BE INVOKED */ 5 /* FROM THE ISPF COMMAND LINE AS SHOWN IN THE FOLLOWING EXAMPLE: */ 6 /* */ 7 /* COMMAND ===> TSO TEST SPANISH */ 8 /* */ 9 /********************************************************************/ 10 PROC 1 LANGUAGE 11 IF &LANGUAGE = SPANISH THEN + 12 WRITE HOLA, MUNDO 13 ELSE IF &LANGUAGE = FRENCH THEN + 14 WRITE BONJOUR, MONDE 15 ELSE + 16 WRITE HELLO, WORLD 17 EXIT" /* */ """" true true false true https://en.wikipedia.org/wiki/CLIST 3 0 https://hopl.info/showlanguage.prx?exp=3423 year|publisher|title|authors|isbn13\n1990|Mcgraw-hill|Clist Programming (j Ranade Ibm Series)|Kurt Bosler|9780070065512 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 kai kai 2016 20 pl http://docs.kai-lang.org 0 0.2.0 1169 1 5 22395 true 0 https://github.com/kai-language/kai pl 2016 2024 2016 4 1 71 37 false 2016 2018 1003 11 116 3 18371 An expressive low level programming language An expressive low level programming language https://github.com/kai-language An expressive low level programming language swift markdown yaml bourne-shell c true 87 0 28 false 0 true The Netherlands "/* // github.com/kai-language/issues/116 #test ""bitcast to struct"" { A :: struct { a: rawptr } x : rawptr = nil a := bitcast(A) x } */" https://github.com/kai-language/kai // /* */ true true true false 0 0 docs.kai-lang.org tbox-lib tbox-lib 2010 10 library https://tboox.org 0 v1.7.5 1170 0 8 22389 true 0 https://github.com/tboox/tbox library 2011 2024 2010 210 713 4797 34 false 2010 2025 3407 38 1102 34 214201 2011 c assembly-language yaml markdown lua bourne-shell objective-c cpp true 6976 0 18 false 1 true https://github.com/tboox/tbox 0 0 tboox.org hdf Hierarchical Data Format 1992 11 binaryDataFormat https://support.hdfgroup.org/HDF5/ 0 1171 0 22386 false 0 binaryDataFormat false Hierarchical Data Format 2017 java matlab scilab octave mathematica idl python r julia sql utf-8 c fortran common-lisp d erlang elixir lfe gdl go igor-pro json labview lua perl pandas rust cdf protobuf Hierarchical Data Format (HDF) is a set of file formats (HDF4, HDF5) designed to store and organize large amounts of data. Originally developed at the National Center for Supercomputing Applications, it is supported by The HDF Group, a non-profit corporation whose mission is to ensure continued development of HDF5 technologies and the continued accessibility of data stored in HDF. In keeping with this goal, the HDF libraries and associated tools are available under a liberal, BSD-like license for general use. HDF is supported by many commercial and non-commercial software platforms, including Java, MATLAB, Scilab, Octave, Mathematica, IDL, Python, R, and Julia. The freely available HDF distribution consists of the library, command-line utilities, test suite source, Java interface, and the Java-based HDF Viewer (HDFView).The current version, HDF5, differs significantly in design and API from the major legacy version HDF4. 2004 304 55 248 635425 National Center for Supercomputing Applications hdf h4 hdf4 he2 h5 hdf5 he5 1541 0 18 binary United States https://en.wikipedia.org/wiki/Hierarchical_Data_Format 0 0 bliss BLISS 1969 William Wulf 14 pl 0 1172 1 22385 375 true 0 pl false 1970 mips ia-32 algol c doi "BLISS is a system programming language developed at Carnegie Mellon 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." 2003 44 113 390261 Carnegie Mellon 240 0 15 1 United States https://semanticscholar.org/paper/4430dfe254804b19bb6a4d9fc10d5bed2932b7cc MODULE E1 (MAIN = CTRL) = BEGIN FORWARD ROUTINE CTRL, STEP; ROUTINE CTRL = !+ ! This routine inputs a value, operates on it, and ! then outputs the result. !- BEGIN EXTERNAL ROUTINE GETNUM, ! Input a number from terminal PUTNUM; ! Output a number to terminal LOCAL X, ! Storage for input value Y; ! Storage for output value GETNUM(X); Y = STEP(.X); PUTNUM(.Y) END; ROUTINE STEP(A) = !+ ! This routine adds 1 to the given value. !- (.A+1); END ELUDOM ! true true false https://en.wikipedia.org/wiki/BLISS 0 0 https://hopl.info/showlanguage.prx?exp=375 slony Slony 2004 Steve Singer 16 application https://www.slony.info/ 0 1173 0 18 22385 false 0 https://github.com/ssinger/slony1-engine application 2010 2024 4 19 38 6 false 2003 2022 4226 27 735 14 135897 c postgresql linux sql plpgsql pl-sql perl javascript 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. 2008 2 15462886 "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." "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." https://github.com/ssinger/slony1-engine "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." bourne-shell sql javascript perl c diff make m4 lex html yacc xslt bash svg css awk lisp markdown true 154 0 34 1 false https://www.slony.info/documentation/ United States https://github.com/ssinger/slony1-engine https://en.wikipedia.org/wiki/Slony-I 0 0 slony.info pod Pod 1997 13 textMarkup 0 1174 2 22384 true 0 textMarkup 0 true 0 perl perl perl text/x-perl none prose false 3 Plain Old Documentation 2000 perl xml tex markdown parrot-vm bash tiddlywiki mediawiki ascii utf-8 Plain Old Documentation (pod) is a lightweight markup language used to document the Perl programming language. 2004 31 84 118 888219 https://www.perl.org pod 375 0 13 text 9791 United States https://groups.google.com/forum/#!search/%22Plain$20Old$20Documentation%22/comp.lang.perl.misc/A9zVCf4UrIs/1hSITu_f4ckJ use strict; use warnings; package DZT::Sample; sub return_arrayref_of_values_passed { my $invocant = shift; return \@_; } 1; =head1 NAME My::Module - An example module =head1 SYNOPSIS use My::Module; my $object = My::Module->new(); print $object->as_string; =head1 DESCRIPTION This module does not really exist, it was made for the sole purpose of demonstrating how POD works. =head2 Methods =over 12 =item C Returns a new My::Module object. =item C Returns a stringified representation of the object. This is mainly for debugging purposes. =back =head1 LICENSE This is released under the Artistic License. See L. =head1 AUTHOR Juerd - L =head1 SEE ALSO L, L =cut https://en.wikipedia.org/wiki/Plain_Old_Documentation 0 0 https://github.com/perl6/atom-language-perl6 Pod action Action! 1983 19 pl 0 1175 1 22382 true 0 pl false 1983 optimized-systems-software algol-68 atari-basic 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. 2004 15 14 181 1273369 Optimized Systems Software 95 0 23 text 473 https://github.com/antlr/grammars-v4/tree/master/action "BYTE RTCLOK=20, ; addr of sys timer SDMCTL=559 ; DMA control BYTE ARRAY FLAGS(8190) CARD COUNT,I,K,PRIME,TIME PROC SIEVE() SDMCTL=0 ; shut off Antic RTCLOK=0 ; only one timer needed COUNT=0 ; init count FOR I=0 TO 8190 ; and flags DO FLAGS(I)='T ; ""'T"" is a compiler-provided constant for True OD FOR I=0 TO 8190 ; and flags DO IF FLAGS(I)='T THEN PRIME=I+I+3 K=I+PRIME WHILE K<=8190 DO FLAGS(K)='F ; ""'F"" is a compiler-provided constant for False K==+PRIME OD COUNT==+1 FI OD TIME=RTCLOK ; get timer reading SDMCTL=34 ; restore screen PRINTF(""%E %U PRIMES IN"",COUNT) PRINTF(""%E %U JIFFIES"",TIME) RETURN" ; PRINTF True False true true true true true false https://en.wikipedia.org/wiki/Action!_(programming_language) 1 0 title|year|author|goodreadsId|rating|ratings|reviews\nAction Programming Languages|1905|Michael Thielscher|22766460|0.0|0|0 ia-32 IA-32 1985 11 isa 0 1176 0 22378 true 0 isa false 1985 x86-isa "IA-32 (short for ""Intel Architecture, 32-bit"", sometimes also called i386) is the 32-bit version of the x86 instruction set architecture, first implemented in the Intel 80386 microprocessors in 1985. IA-32 is the first incarnation of x86 that supports 32-bit computing; as a result, the ""IA-32"" term may be used as a metonym to refer to all x86 versions that support 32-bit computing. The IA-32 instruction set was introduced in the Intel 80386 microprocessor in 1985 and, as of 2017, remains supported by contemporary PC microprocessors. Even though the instruction set has remained intact, the successive generations of microprocessors that run it have become much faster. Within various programming language directives, IA-32 is still sometimes referred to as the ""i386"" architecture. Intel is the inventor and the biggest supplier of IA-32 processors, and the second biggest supplier is AMD. For a while, VIA, Transmeta and others also produced IA-32 processors, but since the 2000s all manufacturers moved to the 64-bit variant of x86, x86-64." 2001 299 971 570 15046 Intel Corporation 1515 0 11 http://flint.cs.yale.edu/cs422/doc/24547212.pdf na United States https://en.wikipedia.org/wiki/IA-32 1 0 title|year|author|goodreadsId|rating|ratings|reviews\nThe Software Optimization Cookbook High Performance Recipes for IA 32 Platforms|2002|Richard Gerber|542593|3.62|8|0 orca-pl orca-pl 2018 12 esolang http://wiki.xxiivv.com/orca 0 1177 0 5 22378 true 0 https://github.com/hundredrabbits/orca-c esolang 2018 2024 2018 26 48 473 19 false 2018 2022 1025 17 69 2 8730 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. 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. https://github.com/hundredrabbits/Orca-c/issues 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. c markdown bourne-shell make yaml true 636 0 17 false Unknown https://git.sr.ht/~rabbits/orca https://github.com/hundredrabbits/orca-c 0 0 parser Parser 3 1997 Konstantin Morshnev 26 pl http://www.parser.ru/ 0 1178 3 22377 true 0 pl false p/Parser.p parser3 1997 xml pcre 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. 2007 8 16 29 13923210 Art. Lebedev Studio p true 61 0 29 1 text Parser 3 parser3-cgi Russia # Hello World in Parser Hello world! "@main[] ^rem{Will print ""Hello World"" when run as CGI script} $hello[Hello World] $result[$hello] " https://riju.codes/parser3 $console:line[Hello, world!] Parser # $console:line """" true true true false true https://en.wikipedia.org/wiki/Parser_(CGI_language) 0 0 parser.ru vrml VRML 1994 11 3d pl 0 1179 1 22372 3756 false 1 x3d 3d false v/VRML.wrl 1995 java gzip collada webgl VRML (Virtual Reality Modeling Language, pronounced vermal or by its initials, originally—before 1995—known as the Virtual Reality Markup Language) is a standard file format for representing 3-dimensional (3D) interactive vector graphics, designed particularly with the World Wide Web in mind. It has been superseded by X3D. 2002 170 384 802 101679 wrl 870 0 12 http://www.rosettacode.org/wiki/Category:VRML "#VRML V2.0 utf8 Shape { geometry Text { string ""Hello World"" } }" VRML """" true https://en.wikipedia.org/wiki/VRML 5 0 https://hopl.info/showlanguage.prx?exp=3756 year|publisher|title|authors|isbn13\n1996|Addison-Wesley Professional|The Vrml 2.0 Handbook: Building Moving Worlds on the Web|Hartman, Jed and Wernecke, Josie|9780201479447\n1996|Ziff Davis Pr|Instant Vrml Worlds|Kennedy, Randall|9781562764210\n1995|Hayden Books|Virtus Vrml Toolkit|Smith, David and Boyd, Richard and Scott, Alan|9781568302478\n2010|LAP Lambert Academic Publishing|Managing Active Object Scalability on Distributed Memory: With a Case Study in Parallel VRML|Rischbeck, Thomas|9783838307282\n1996|Waite Group|VRML Construction Kit: Creating 3D Web Worlds|David Fox and Philip Shaddock|9781571690685 lemon-lang Lemon 2017 Zhicheng Wei 12 pl http://www.lemon-lang.org/ 0 1180 0 3 22372 true 0 https://github.com/lemon-lang/lemon pl 2017 2024 2017 24 39 499 7 false 2017 2018 35 2 107 1 25570 2016 https://github.com/lemon-lang c markdown make true 620 0 15 1 false Singapore https://github.com/lemon-lang/lemon 0 0 lemon-lang.org candor candor 2012 Fedor Indutny 14 pl http://candor-lang.org 0 1181 0 8 22369 true 0 https://github.com/indutny/candor pl 2012 2023 2012 15 16 176 4 false 2012 2015 1008 7 198 3 61904 https://darksi.de/ python cpp markdown lisp make yaml bourne-shell c true 233 0 22 1 false United States https://github.com/indutny/candor 0 0 candor-lang.org 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 pyret-lang Pyret 2012 Ben Lerner and Joe Gibbs Politz 11 pl https://www.pyret.org/ 0 1182 0 13 22365 true 0 https://github.com/brownplt/pyret-lang pl 2012 2024 2012 42 106 1061 437 false 2012 2025 11152 92 654 481 1095548 Brown University javascript json markdown svg make lisp vim-script asp.net html bourne-shell csv xml yaml true 1473 0 25 2 false United States https://github.com/brownplt/pyret-lang 0 0 satysfi SATySFi 2015 Takashi Suwa 11 textMarkup 0 v0.0.11 1183 0 7 22363 true 0 https://github.com/gfngfn/SATySFi textMarkup 2015 2024 2015 50 81 1162 117 false 2015 2025 4053 59 325 9 97809 https://github.com/gfngfn/SATySFi/issues ocaml make markdown css bourne-shell svg yaml true 1465 0 18 1 false 0 true Japan https://github.com/gfngfn/SATySFi 0 0 margin Margin 2019 Alex Gamburg 14 textMarkup https://margin.love 0 1184 1 4 22360 true 0 https://github.com/gamburg/margin textMarkup 2019 2024 2019 11 9 190 7 false 2019 2022 70 7 24 1 1895 2019 Margin is a lightweight markup language for hierarchically structured thought, like notes and to-do lists. Margin is a lightweight markup language for hierarchically structured thought, like notes and to-do lists. https://github.com/gamburg/margin/issues Margin is a lightweight markup language for hierarchically structured thought, like notes and to-do lists. javascript markdown css html true 226 0 18 1 false United States Favorite Movies Eyes Wide Shut [year: 1999] Black Narcissus [year: 1947] Adaptation [year: 2002] https://github.com/gamburg/margin 0 0 margin.love qoir QOIR 2022 Nigel Tao 17 binaryDataFormat https://nigeltao.github.io 0 1185 0 6 22359 false 0 https://github.com/nigeltao/qoir binaryDataFormat 2022 2024 2022 10 5 97 2 false 2022 2023 139 1 97 9 85711 A Fast, Simple, Lossless Image File Format based on QOI ( http://qoiformat.org ) A Fast, Simple, Lossless Image File Format based on QOI ( http://qoiformat.org ) https://github.com/nigeltao/qoir/issues A Fast, Simple, Lossless Image File Format based on QOI ( http://qoiformat.org ) qoir c cpp bourne-shell go markdown yaml true 115 0 24 1 false https://github.com/nigeltao/qoir#readme Australia https://nigeltao.github.io/blog/2022/qoir.html https://github.com/nigeltao/qoir 0 0 nigeltao.github.io arquero Arquero 2020 Jeffrey Heer 11 dataFlow library https://uwdata.github.io/arquero/ 0 5.4.0 1186 0 6 22358 true 0 https://github.com/uwdata/arquero dataFlow 2020 2024 30 64 1234 35 false 2020 2025 481 23 266 2 29667 Query processing and transformation of array-backed data tables. Query processing and transformation of array-backed data tables. Query processing and transformation of array-backed data tables. javascript markdown json svg csv yaml true 1451 0 17 1 false 5 true https://github.com/uwdata/arquero 0 0 symbol SYMBOL 1971 10 pl 0 1187 0 22357 3238 true 0 pl false 1953 isbn "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." 2002 1206 4174 37673 6050 0 10 https://docs.symbol.dev/handbook/all-coding-guidelines.html 3244 https://semanticscholar.org/paper/5f4c1ed840783affd959097c5e6fd06350c7dc38 https://en.wikipedia.org/wiki/Symbol 0 19 https://hopl.info/showlanguage.prx?exp=3238 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 dasm Dasm 1988 13 assembly https://dasm-assembler.github.io/ 0 2.20.14 1188 0 8 22353 true 0 https://github.com/dasm-assembler/dasm assembly 2019 2024 2019 21 39 208 44 false asm.py 2019 2024 339 29 379 17 42798 https://github.com/dasm-assembler/ dasm16 dasm assembly-language c tex make bourne-shell python yaml dockerfile true 356 0 21 false 2 true United States and Germany and Canada DASM16 https://github.com/dasm-assembler/dasm 0 0 dasm-assembler.github.io tao3d tao3d 2003 Christophe de Dinechin 14 pl http://tao3d.sourceforge.net/ 0 1189 1 21 22352 true 0 https://github.com/c3d/tao3D pl 2014 2024 2003 18 7 172 5 false 2003 2019 9365 26 1649 139 445183 Tao3D is a programming language for interactive 3D. Tao3D is a programming language for interactive 3D. Tao3D is a programming language for interactive 3D. cpp ini json bourne-shell qt svg html xml bash assembly-language perl yaml sed c f-sharp make markdown objective-cpp csv protobuf typescript true 221 0 36 xl-lang 1 false "import SeasonsGreetingsTheme theme ""SeasonsGreetings"" main_title_slide ""The main title slide"", title ""Seasons Greetings theme"" subtitle ""A theme for the holidays"" section_slide ""A section slide"", title ""Section title"" subtitle ""Section subtitle"" slide ""Bullet points"", * ""Bullet points"" ** ""More bullet points"" *** ""Deeper""" https://twitter.com/taodyne https://github.com/c3d/tao3D 0 0 tao3d.sourceforge.net wart Wart 2010 Kartik K. Agaram 15 pl http://akkartik.name/post/wart 0 1190 1 5 22351 true 0 https://github.com/akkartik/wart pl 2010 2024 2010 10 12 139 0 false 2010 2018 4134 6 1081 7 120099 cpp make vim-script bash z-shell true 183 0 21 1 false def (foo (a | (b c))) # 'b' and 'c' name parts of list 'a' (list a b c) (foo '(1 2)) https://github.com/akkartik/wart # true true false 0 0 mqtt Message Queuing Telemetry Transport 1999 10 protocol http://mqtt.org/ 0 1191 0 22349 true 0 protocol false Message Queuing Telemetry Transport 2004 1999 "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)." 1128 256 32695816 Organization for the Advancement of Structured Information Standards 5661 0 10 United States https://en.wikipedia.org/wiki/MQTT 0 0 mqtt.org pycket Pycket 2022 Sam Tobin-Hochstadt 13 pl 0 1192 0 10 22349 true 0 https://github.com/pycket/pycket pl 2013 2024 2013 17 25 255 53 false 2013 2024 5094 24 252 58 89624 Pycket: a Racket/Scheme implementation that is generated using the RPython framework Pycket: a Racket/Scheme implementation that is generated using the RPython framework https://github.com/pycket Pycket: a Racket/Scheme implementation that is generated using the RPython framework python racket scheme bourne-shell markdown make ini json yaml c true 355 0 23 1 false Germany https://reddit.com/r/Racket/comments/upim61/pycket_a_racketscheme_implementation_that_is/ https://github.com/pycket/pycket 0 0 spiderbasic SpiderBasic 2015 13 pl https://www.spiderbasic.com/ 0 1193 0 11 22346 true 0 https://github.com/fantaisie-software/purebasic pl 2019 2024 24 64 113 4 false 2019 2025 526 42 3722 41 690514 Fantaisie Software pb html xml make glsl markdown hlsl asciidoc bourne-shell ini css yaml true 349 0 122 false France 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 https://github.com/fantaisie-software/purebasic true 0 0 pure Pure 2008 Albert Gräf 15 pl https://agraef.github.io/pure-lang/ 0 1194 1 22341 true 0 pl false 2008 freebsd linux haskell lisp alice matlab llvmir c miranda puredata octave opengl faust supercollider 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)). 2008 31 34 100 20446791 https://bitbucket.org/purelang/pure-lang/issues true 176 0 15 1 https://tio.run/#pure text 3337 http://www.rosettacode.org/wiki/Category:Pure Germany "extern int puts(char*); hello = puts ""Hello, world!""; hello;" https://en.wikipedia.org/wiki/Pure_(programming_language) 0 19 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 apt Automatically Programmed Tool 1956 13 pl 0 1195 1 22340 23 true 0 pl false Automatically Programmed Tool 1956 g-code 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. 2006 64 24 98 3673047 MIT 340 0 13 text 8742 https://github.com/antlr/grammars-v4/tree/master/apt United States PARTNO / APT-1 CLPRNT UNITS / MM NOPOST CUTTER / 20.0 $$ GEOMETRY DEFINITION SETPT = POINT / 0.0, 0.0, 0.0 STRTPT = POINT / 70,70,0 P1 = POINT / 50, 50, 0 P2 = POINT / 20, -20, 0 C1 = CIRCLE / CENTER, P2, RADIUS, 30 P3 = POINT / -50, -50, 0 P5 = POINT / -30, 30, 0 C2 = CIRCLE / CENTER, P5, RADIUS, 20 P4 = POINT / 50, -20, 0 L1 = LINE / P1, P4 L2 = LINE / P3, PERPTO, L1 L3 = LINE / P3, PARLEL, L1 L4 = LINE / P1, PERPTO, L1 PLAN1 = PLANE / P1, P2, P3 PLAN2 = PLANE / PARLEL, PLAN1, ZSMALL, 16 $$ MOTION COMMANDS SPINDL / 3000, CW FEDRAT / 100, 0 FROM / STRTPT GO/TO, L1, TO, PLAN2, TO, L4 TLLFT, GOFWD / L1, TANTO, C1 GOFWD / C1, TANTO, L2 GOFWD / L2, PAST, L3 GORGT / L3, TANTO, C2 GOFWD / C2, TANTO, L4 GOFWD / L4, PAST, L1 NOPS GOTO / STRTPT FINI https://en.wikipedia.org/wiki/APT_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=23 firrtl firrtl 2015 11 ir https://www.chisel-lang.org/firrtl/ 0 v1.6.0 1196 0 15 22339 true 0 https://github.com/freechipsproject/firrtl ir 2015 2024 2015 62 175 707 287 false 2015 2024 4197 116 522 59 35468 https://github.com/freechipsproject scala yaml bourne-shell python markdown bash protobuf scheme svg cpp json make llvmir xml c true 1350 0 26 false 1 true United States and China https://github.com/freechipsproject/firrtl 0 0 scribble scribble 1997 Matthew Flatt 12 pl 0 v8.11.1 1197 1 7 22338 true 0 https://github.com/racket/scribble pl 2014 2024 1997 30 91 196 113 false 1997 2025 2423 103 398 12 56663 https://github.com/racket racket tex css yaml javascript markdown html true 573 0 19 1 false 8 true United States "#lang scribble/doc @(require scribble/manual ""utils.rkt"" (for-syntax racket/base) (for-label scribble/manual-struct version/utils syntax/quote)) @(define lit-ellipses (racket ...)) @(define lit-ellipses+ (racket ...+)) @title[#:tag ""manual"" #:style 'toc]{Manual Forms} @defmodulelang[scribble/manual]{The @racketmodname[scribble/manual] language provides all of @racketmodname[scribble/base] plus many additional functions that are specific to writing Racket documentation. It also associates @tech{style properties} with the generated @racket[doc] export to select the default Racket manual style for rendering; see @secref[""manual-render-style""] for more information. The @racketmodname[scribble/manual] name can also be used as a library with @racket[require], in which case it provides all of the same bindings, but without setting the reader or setting the default rendering format to the Racket manual format.}" https://github.com/racket/scribble 0 0 fo fo 2018 Alex Browne 11 pl 0 1198 0 3 22334 true 0 https://github.com/albrow/fo pl 2018 2024 2018 27 34 1236 15 false 2018 2022 112 4 237 2 17858 https://github.com/albrow/fo/issues go markdown logos true 1343 0 14 1 false United States https://github.com/albrow/fo 0 0 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 metafont METAFONT 1977 13 application 0 1199 1 22332 1238 false 0 application false 1977 postscript tex asymptote 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. 2002 63 159 240 44263 Stanford University true 335 0 13 text http://www.rosettacode.org/wiki/Category:Metafont United States "%file name: beta.mf %mode_setup; % Define a beanlike shape for the character B beginchar(""B"",11pt#,11pt#,0); % Setup coordinates as an equation system y1=y2=y3=0; y4=y5=y6=h; x1=x4=0; x2=x5=w; x3=x6=2*w; % Define pen pickup pencircle xscaled 0.2w yscaled 0.04w rotated 45; % Draw the character curve draw z1..z3..z6{z2-z6}..z5..{z4-z2}z4..cycle; endchar; end" true https://en.wikipedia.org/wiki/Metafont 2 0 https://hopl.info/showlanguage.prx?exp=1238 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 fp3 fp 2022 Joona Piirainen 17 pl 0 0.0.1 1200 0 7 22332 true 0 https://github.com/japiirainen/fp pl 2022 2024 2022 2 1 102 1 false Functional Programming 2022 2023 83 4 105 1 3600 https://japiirainen.com/ glsl haskell yaml bash nix markdown toml true 110 0 24 1 false 0 true Finland https://dl.acm.org/doi/10.1145/359576.359579 https://github.com/japiirainen/fp true true true true 0 0 juniper juniper 2016 Caleb Helbling 17 pl http://www.juniper-lang.org/ 0 v4.0.0 1201 0 4 22332 true 0 https://github.com/calebh/Juniper pl 2019 2024 2016 6 9 72 3 false 2016 2024 273 9 51 1 14813 2016 Juniper is a functional reactive programming language for the Arduino and other related platforms. Juniper is a functional reactive programming language for the Arduino and other related platforms. https://github.com/calebh/Juniper/issues Juniper is a functional reactive programming language for the Arduino and other related platforms. f-sharp markdown xml bourne-shell true 110 0 22 1 false 4 true junos text United States https://github.com/calebh/Juniper 0 0 juniper-lang.org epigram Epigram 2004 Conor McBride 16 pl 0 1202 1 22331 8173 true 0 pl false 2004 linux agda idris coq haskell dependent-ml 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. 2005 23 31 87 1933143 University of London true 135 0 16 1 text http://www.rosettacode.org/wiki/Category:Epigram United Kingdom http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.115.9718&rep=rep1&type=pdf plus x y <= rec x { plus x y <= case x { plus zero y => y plus (suc x) y => suc (plus x y) } } true https://en.wikipedia.org/wiki/Epigram_(programming_language) 1 0 https://hopl.info/showlanguage.prx?exp=8173 year|publisher|title|authors|isbn13\n2011||Epigram (programming Language)|Kn Tr Benoit|9786136777214 lever lever 2015 15 pl http://leverlanguage.com/ 0 0.8.0 1203 0 11 22330 true 0 https://github.com/cheery/lever pl 2015 2024 2014 12 11 132 1 false 2014 2018 694 6 669 15 598459 2015 A dynamically typed language built to absorb features from other languages. A dynamically typed language built to absorb features from other languages. https://github.com/cheery/lever/issues A dynamically typed language built to absorb features from other languages. python html glsl json javascript css markdown c make tex svg true 173 0 26 false 0 true text Finland https://github.com/cheery/lever 0 0 leverlanguage.com gas GNU Assembler 1986 12 compiler 0 1204 1 22326 true 0 compiler false asm.py 2016 c unix powerpc mips arm linux ia-32 x86-isa The GNU Assembler, commonly known as gas or simply as, its executable name, is the assembler used by the GNU Project. It is the default back-end of GCC. It is used to assemble the GNU operating system and the Linux kernel, and various other software. It is a part of the GNU Binutils package. The GAS executable is named as, the standard name for a Unix assembler. GAS is cross-platform, and both runs on and assembles for a number of different computer architectures. Released under the GNU General Public License v3, GAS is free software. 2004 97 65 228 863402 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.4503&rep=rep1&type=pdf GNU Project s S true 555 0 12 na 1119 gas GAS ".global _start .text _start: movl $4, %eax movl $1, %ebx movl $msg, %ecx movl $len, %edx int $0x80 movl $1, %eax movl $0, %ebx int $0x80 .data msg: .ascii ""Hello, world!\n"" len = . - msg" https://en.wikipedia.org/wiki/GNU_Assembler 0 0 aheui Aheui 2012 19 esolang http://aheui.github.io/aheuicon 0 1.2.5 1205 2 5 22326 true 0 https://github.com/aheui/rpaheui esolang 2015 2024 15 7 57 5 false Korean a/Aheui.aheui esoteric.py 2015 2024 146 7 35 1 3158 aheui aheui python markdown yaml make ini true 87 0 24 false 1 true https://tio.run/#aheui https://esolangs.org/wiki/Aheui text Aheui Korea 밤밣따빠밣밟따뿌 빠맣파빨받밤뚜뭏 돋밬탕빠맣붏두붇 볻뫃박발뚷투뭏붖 뫃도뫃희멓뭏뭏붘 뫃봌토범더벌뿌뚜 뽑뽀멓멓더벓뻐뚠 뽀덩벐멓뻐덕더벅 Aheui https://riju.codes/aheui 밤밣따빠밣밟따뿌 빠맣파빨받밤뚜뭏 돋밬탕빠맣붏두붇 볻뫃박발뚷투뭏붖 뫃도뫃희멓뭏뭏붘 뫃봌토범더벌뿌뚜 뽑뽀멓멓더벓뻐뚠 뽀덩벐멓뻐덕더벅 Aheui https://github.com/aheui/rpaheui 0 0 jesth Jesth 2022 14 dataNotation 0 0.0.8 1206 1 4 22325 true 0 https://github.com/pyrustic/jesth dataNotation 2022 2024 2 3 193 0 false Just Extract Sections Then Hack ! 2022 2024 40 2 104 1 15173 https://github.com/pyrustic markdown python toml json true 205 0 21 toml json yaml false 0 true Unknown https://news.ycombinator.com/item?id=35991018 This text actually belongs to an anonymous section, which happens to also be the first section of this document [] This text actually belongs to the second anonymous section of this document. If the very first section of a document is anonymous, it can ignore to define its header. https://github.com/pyrustic/jesth 0 0 pharen Pharen 2009 Tamreen Khan 13 pl http://www.pharen.org 0 1207 0 4 22321 true 0 https://github.com/scriptor/pharen/ pl 2009 2023 15 31 217 10 false 2009 2018 1190 17 58 2 7645 http://github.com/scriptor/pharen/issues phn php markdown json bourne-shell php true 329 0 19 1 false United States https://github.com/scriptor/pharen/ 0 0 fleck fleck 2019 Chris McCormick 12 pl 0 v0.1.2 1208 1 8 22319 true 0 https://github.com/chr15m/flk pl 2019 2024 2019 8 14 497 1 false 2019 2021 113 5 36 1 4933 https://mccormick.cx clojure svg bourne-shell bash markdown make html yaml true 545 0 20 1 false 0 true United States "(println ""Hello world!"")" https://github.com/chr15m/flk 0 0 micro-cpp ΜC++ 1992 pabuhr 13 pl https://plg.uwaterloo.ca/usystem/uC++.html 0 1209 0 6 22319 true 0 https://github.com/pabuhr/uCPP pl 2013 2024 2013 12 28 148 1 false 2013 2025 52 4 384 33 102152 2006 "μ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." 2005 14 22 3405199 University of Waterloo cpp tex make assembly-language bourne-shell python true 328 0 19 1 false Canada https://github.com/pabuhr/uCPP https://en.wikipedia-on-ipfs.org/wiki/%CE%9CC%2B%2B 0 0 frink Frink 2001 24 pl https://frinklang.org/ 0 1210 2 22319 true 0 pl false f/Frink.frink 2014 2011 jvm java "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.""" 2017 8 6 11 54431028 https://futureboy.us/ frink 61 0 27 text http://www.rosettacode.org/wiki/Category:Frink United States Frink "// Hello World in Frink println[""Hello World!""] " "println[""Hello World""] " https://twitter.com/frinklang Frink // println """" true true true false true true https://en.wikipedia.org/wiki/Frink_(programming_language) 0 0 frinklang.org djangoql djangoql 2017 Denis Stebunov 11 pl 0 1211 0 8 22317 true 0 https://github.com/ivelum/djangoql pl 2017 2024 2017 45 88 969 35 false 2017 2025 352 31 65 1 6837 https://github.com/ivelum python javascript svg html css restructuredtext yaml json true 1265 0 19 1 false Russia and Ukraine amd Lithuania and Serbia https://github.com/ivelum/djangoql 0 0 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 apacheconf ApacheConf 1995 14 application https://httpd.apache.org/ 0 1212 1 22315 false 0 application 55081 68565 .htaccess apache2.conf httpd.conf 0 aconf or apache apache_conf source.apache-config data false 93 2005 2016 1 10 configs.py Apache Software Foundation apacheconf vhost .htaccess apache.conf apache2.conf 201 0 14 text United States https://en.wikipedia.org/wiki/Apache_HTTP_Server "####################### # HOSTNAME ###################### ServerAdmin patrick@heysparkbox.com DocumentRoot ""/var/www/HOSTNAME"" ServerName HOSTNAME Options Indexes MultiViews FollowSymLinks AllowOverride All Order allow,deny Allow from all DirectoryIndex index.php " ApacheConf 0 0 httpd.apache.org ApacheConf https://github.com/textmate/apache.tmbundle ApacheConf observable-plot Observable Plot 2020 Mike Bostock 10 dataVis library https://observablehq.com/plot/ 0 0.6.14 1213 0 9 22313 true 0 https://github.com/observablehq/plot dataVis 2020 2024 45 171 4160 301 false 2020 2025 2645 26 1863 88 958683 svg typescript javascript csv markdown html json yaml css true 4701 0 19 1 false 0 true https://github.com/observablehq/plot 0 0 slideshow Slideshow 2000 Matthew Flatt and Robert Bruce Findler 16 textMarkup 0 v8.8 1214 0 3 22307 true 0 https://github.com/racket/slideshow textMarkup 2014 2024 2000 25 21 33 9 false 2000 2025 570 31 90 2 10227 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 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 University of Utah && Northwestern University 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 .rkt racket scheme markdown true 128 0 22 2 false 8 true https://docs.racket-lang.org/slideshow https://lists.racket-lang.org United States https://github.com/racket/slideshow 0 0 sako SAKO 1960 36 pl 0 1215 1 22305 2178 true 0 pl false Polish System Automatycznego Kodowania SAKO (PL: System Automatycznego Kodowania - EN: An Automatic Coding System) is a non-English-based programming language written for Polish computers XYZ, ZAM-2, ZAM-21 and ZAM-41. 2013 4 4 12 38814216 Polish Academy of Sciences 40 0 38 text Poland https://historiainformatyki.pl/skan.php?doc_id=1489&type=pdf&for_download=1 TEKST: HELLO WORLD LINIA STOP NASTEPNY KONIEC K) = true true true true false true true true true false true true true true false true true true false true false https://en.wikipedia.org/wiki/SAKO_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=2178 imp-lang imp 2019 Jamie Brandon 13 pl https://scattered-thoughts.net/writing/imp-intro/ 0 1216 1 5 22292 true 0 https://github.com/jamii/imp pl 2015 2025 14 11 272 0 false 2022 2022 1343 1 17 6 275798 https://scattered-thoughts.net/imp 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. 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. 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. zig c nix markdown bash true 308 0 18 1 false United States "let colors = ""apples"" x ""red"" | ""apples"" x ""green"" | ""oranges"" x ""orange"" in let fancy = ""red"" x ""scarlet"" | ""red"" x ""crimson"" | ""green"" x ""emerald"" in ""apples"" colors fancy" https://github.com/jamii/imp 0 0 hal-format HAL Format 2012 13 binaryDataFormat 0 1217 0 9 22291 false 0 https://github.com/ComparativeGenomicsToolkit/hal binaryDataFormat 2012 2024 2012 13 40 156 104 false 2012 2024 1988 30 395 10 77276 HAL is a graph-based structure to efficiently store and index multiple genome alignments and ancestral reconstructions. HAL files are represented in HDF5 format, an open standard for storing and indexing large, compressed scientific data sets. Genomes within HAL are organized according to the phylogenetic tree that relate them: each genome is segmented into pairwise DNA alignment blocks with respect to its parent and children (if present) in the tree. Note that if the phylogeny is unknown, a star tree can be used. The modularity provided by this tree-based decomposition allows for efficient querying of sub-alignments, as well as the ability to add, remove and update genomes within the alignment with only local modifications to the structure. Another important feature of HAL is reference independence: alignments in this format can be queried with respect to the coordinates of any genome they contain. HAL is a graph-based structure to efficiently store and index multiple genome alignments and ancestral reconstructions. HAL files are represented in HDF5 format, an open standard for storing and indexing large, compressed scientific data sets. Genomes within HAL are organized according to the phylogenetic tree that relate them: each genome is segmented into pairwise DNA alignment blocks with respect to its parent and children (if present) in the tree. Note that if the phylogeny is unknown, a star tree can be used. The modularity provided by this tree-based decomposition allows for efficient querying of sub-alignments, as well as the ability to add, remove and update genomes within the alignment with only local modifications to the structure. Another important feature of HAL is reference independence: alignments in this format can be queried with respect to the coordinates of any genome they contain. https://github.com/ComparativeGenomicsToolkit HAL is a graph-based structure to efficiently store and index multiple genome alignments and ancestral reconstructions. HAL files are represented in HDF5 format, an open standard for storing and indexing large, compressed scientific data sets. Genomes within HAL are organized according to the phylogenetic tree that relate them: each genome is segmented into pairwise DNA alignment blocks with respect to its parent and children (if present) in the tree. Note that if the phylogeny is unknown, a star tree can be used. The modularity provided by this tree-based decomposition allows for efficient querying of sub-alignments, as well as the ability to add, remove and update genomes within the alignment with only local modifications to the structure. Another important feature of HAL is reference independence: alignments in this format can be queried with respect to the coordinates of any genome they contain. cpp python make markdown c yaml r bourne-shell lisp true 307 0 22 false binary Unknown https://genome.ucsc.edu/FAQ/FAQformat.html#format1 https://github.com/ComparativeGenomicsToolkit/hal 0 0 jcof JCOF 2022 Martin Dørum 15 dataNotation 0 1218 1 4 22291 true 0 https://github.com/mortie/jcof dataNotation 2022 2024 2022 4 1 153 7 false JSON-like Compact Object Format 2022 2022 14 1 18 1 8876 https://github.com/mortie/jcof/issues json javascript markdown make true 158 0 19 1 false Norway https://news.ycombinator.com/item?id=32109406 "Programmer;""age""""first-name""""full-time""""occupation""; {""people""[(0,iw""Bob""b""Plumber"")(0,is""Alice""b,s0)(0,iA""Bernard""n,n)(0,iV""El""B,s0)]}" https://github.com/mortie/jcof false false 0 0 gw-basic GW-BASIC 1983 11 pl 0 1219 0 22289 2081 true 0 pl false 1983 ibm-basica qbasic msx-basic basic quickbasic mbasic dartmouth-basic ascii GW-BASIC is a dialect of the BASIC programming language developed by Microsoft from BASICA, originally for Compaq. It is otherwise identical to Microsoft/IBM BASICA, but is a fully self-contained executable and does not need the ROM BASIC. It was bundled with MS-DOS operating systems on IBM PC compatibles by Microsoft. Microsoft also sold a BASIC compiler, BASCOM, compatible with GW-BASIC, for programs needing more speed. The language is suitable for simple games, business programs and the like. Since it was included with most versions of MS-DOS, it was also a low-cost way for many aspiring programmers to learn the fundamentals of computer programming. With the release of MS-DOS 5.0, GW-BASIC's place was eventually taken by QBasic, the interpreter part of the separately available QuickBASIC compiler. 2002 234 251 426 13087 Microsoft 1190 0 11 http://www.rosettacode.org/wiki/Category:GW-BASIC United States true https://en.wikipedia.org/wiki/GW-BASIC 0 0 https://hopl.info/showlanguage.prx?exp=2081 eyg EYG 2021 Peter Saxton 15 pl https://eyg.run/ 0 1220 1 14 22289 true 0 https://github.com/crowdhailer/eyg-lang pl 2021 2024 3 5 138 6 false Eat Your Greens 2021 2025 2291 2 481 14 58348 https://eyg.run/ "Experiments in building ""better"" languages and tools; for some measure of better." "Experiments in building ""better"" languages and tools; for some measure of better." "Experiments in building ""better"" languages and tools; for some measure of better." gleam go markdown javascript json html elixir toml yaml dockerfile css csv cpp bourne-shell true 157 0 29 1 false https://eyg.run/documentation "let message = ""Hello, World!"" let greet = message -> perform Alert(message) greet(message)" https://github.com/crowdhailer/eyg-lang true 0 0 mouse Mouse 1970 19 pl https://mouse.sourceforge.net 0 1221 2 22289 684 true 0 pl false m/Mouse.mse 1970 reverse-polish-notation assembly-language pascal isbn 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. 2006 12 10 43 6378343 https://sourceforge.net/p/mouse/mailman mse 81 0 21 https://tio.run/#mouse text 2382 United States """Hello World"" '! !' $ " "1 N: ~ initialize N to 1 ( N. N. * ! "" "" ~ begin loop; print squares of numbers N. 10 - 0 < ^ ~ exit loop if N >= 10 N. 1 + N: ) $ ~ increment N and repeat loop" Mouse ~ """" true true false true https://en.wikipedia.org/wiki/Mouse_(programming_language) 0 0 https://hopl.info/showlanguage.prx?exp=684 dyvil dyvil 2014 20 pl https://reddit.com/r/Dyvil 0 v0.48.1 1222 1 5 22289 true 0 https://github.com/Dyvil/Dyvil pl 2014 2024 2014 5 2 60 44 false d/Dyvil.dyv 2014 2024 4651 6 929 48 19531 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. 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. https://github.com/Dyvil 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. dyv java gradle markdown bourne-shell yaml true 74 0 27 false 0 true https://tio.run/#dyvil text Germany class Dyvil { static func main(args: [String]) = print 'Hello World' } Dyvil https://github.com/Dyvil/Dyvil print ' true true 0 0 alma-007 Alma 2014 Carl Mäsak 14 pl http://masak.github.io/alma/ 0 1223 1 7 22288 true 0 https://github.com/masak/alma pl 2014 2024 9 14 137 222 false 007 2014 2025 1820 19 155 3 17763 Alma is a small language created as a testbed for Raku macros. Alma is a small language created as a testbed for Raku macros. http://strangelyconsistent.org/ Alma is a small language created as a testbed for Raku macros. raku markdown bourne-shell json html d yaml true 200 0 21 1 false Sweden "macro swap(a, b) { return quasi { my t = {{{a}}}; {{{a}}} = {{{b}}}; {{{b}}} = t; }; } func gcd(a, b) { if b { return gcd(b, a % b); } return a.abs(); } my bigger = +prompt(""Enter the bigger integer: ""); my smaller = +prompt(""Enter the smaller integer: ""); if bigger < smaller { swap(bigger, smaller); } say(); say(""Greatest common denominator: "", gcd(bigger, smaller));" https://github.com/masak/alma 0 0 hxml HXML 2009 14 application 0 1224 2 22288 false 0 application 0 text source.hxml data false 109 2017 2018 2 4 haxe.py 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. 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. Haxe Foundation 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. hxml hxml 200 0 14 text Unknown https://haxe.org/manual/compiler-usage-hxml.html -cp src -dce full --each -js bin/homepage.js -main website.HomePage --next -js bin/gallery.js -main website.GalleryPage --next -js bin/contact.js -main website.ContactPage buildGlobal.hxml -lib mcover:2.1.1 -D unittest -x TestMain --macro mcover.MCover.coverage(['checkstyle'], ['src'], ['checkstyle.reporter', 'checkstyle.Main']) --next -cmd neko run -s src -s test -p resources/static-analysis.txt -cmd neko run --default-config resources/default-config.json -cmd neko run -c resources/default-config.json Hxml true 0 0 https://github.com/vshaxe/haxe-TmLanguage HXML rhtml RHTML 2004 14 template 0 1225 1 22288 true 0 template 0 0 false 458 2013 2018 76 templates.py RHTML is HTML mixed with Ruby, using HTML tags. All of Ruby is available for programming along with HTML. RHTML is HTML mixed with Ruby, using HTML tags. All of Ruby is available for programming along with HTML. https://github.com/rails RHTML is HTML mixed with Ruby, using HTML tags. All of Ruby is available for programming along with HTML. rhtml rhtml 200 0 14 text Various https://www.tutorialspoint.com/ruby-on-rails/rails-and-rhtml.htm
<% @products.each do |p| %>
<%= @p.name %>
<% end %>
RHTML 0 0 https://github.com/atom/language-ruby RHTML infusion-framework infusion-framework 2007 12 framework http://fluidproject.org/infusion.html 0 4.6.0 1226 0 10 22285 false 0 https://github.com/fluid-project/infusion framework 2011 2024 2007 22 97 136 9 false 2007 2025 10014 78 834 50 137909 https://github.com/fluid-project javascript html json css scss markdown yaml dockerfile ini svg true 507 0 22 false 4 true Various https://docs.google.com/spreadsheets/d/12sTu7RT-s_QlAupY1v-3DfI1Mm9NEX5YMWWTDAKHLfc/edit#gid=0 https://github.com/fluid-project/infusion 0 0 pasukon pasukon 2020 Federico Ramirez 16 grammarLanguage https://pasukon.rocks 0 0.0.1 1227 1 3 22284 true 0 https://github.com/gosukiwi/Pasukon grammarLanguage 2020 2024 2020 4 3 110 6 false 2020 2020 83 1 53 1 10462 https://pasukon.rocks/#try-it https://github.com/gosukiwi/Pasukon/issues javascript json markdown true 122 0 19 1 false 0 true Argentina https://news.ycombinator.com/item?id=24347956 lex match NUMBER /[0-9]+(?:\.[0-9]+)?/ match PLUS '+' match MINUS '-' match TIMES '*' match DIV '/' match POPEN '(' match PCLOSE ')' ignore WHITESPACE /^\s+/ /lex addition | (subtraction as :lhs) then :PLUS then (subtraction as :rhs) |> 'return $.lhs + $.rhs' | subtraction ; subtraction | (multiplication as :lhs) then :MINUS then (multiplication as :rhs) |> 'return $.lhs - $.rhs' | multiplication ; multiplication | (division as :lhs) then :TIMES then (division as :rhs) |> 'return $.lhs * $.rhs' | division ; division | (expression as :lhs) then :DIV then (expression as :rhs) |> 'return $.lhs / $.rhs' | expression ; expression | :POPEN then (addition as :expr) then :PCLOSE |> 'return $.expr' | number ; number | :NUMBER 'return +$1' ; start | addition ; https://github.com/gosukiwi/Pasukon 0 0 pasukon.rocks plam plam 2017 Sandro Lovnički 12 pl 0 v2.2.0 1228 0 4 22280 true 0 https://github.com/sandrolovnicki/pLam pl 2017 2024 2017 9 17 446 4 false 2017 2021 269 6 44 2 3167 https://github.com/slovnicki/pLam/issues plam haskell yaml markdown bourne-shell true 504 0 17 1 false 2 true Croatia https://github.com/sandrolovnicki/pLam 0 0 shml shml 2015 12 textMarkup https://odb.github.io/shml/ 0 1.1.0 1229 0 9 22275 true 0 https://github.com/odb/shml textMarkup 2013 2024 11 14 441 2 false 2013 2018 205 9 186 1 7915 https://github.com/odb bourne-shell html markdown css yaml svg make json xml true 494 0 21 false 1 true United States https://github.com/odb/shml 0 0 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 cor cor 2016 Yosbel Marin 21 pl http://yosbelms.github.io/cor/ 0 0.12.0 1230 1 10 22274 true 0 https://github.com/yosbelms/cor pl 2015 2022 2016 9 3 54 0 false c/Cor.cor 2016 2016 419 3 144 1 26500 https://github.com/yosbelms/cor cor javascript html markdown css json yacc lex yaml svg bourne-shell javascript true 68 0 34 1 false 0 true text United States "func main() console.log(""Hello World"") " Cor https://github.com/yosbelms/cor console.log """" true true 0 0 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 reach Reach 2019 Jay McCarthy 11 contractLanguage https://www.reach.sh/ 0 1231 1 21 22273 true 0 https://github.com/reach-sh/reach-lang contractLanguage 2019 2025 16 168 582 21 false 2019 2023 10373 63 3209 207 944977 Reach: The Safest and Smartest DApp Programming Language Reach: The Safest and Smartest DApp Programming Language Reach: The Safest and Smartest DApp Programming Language javascript json typescript markdown haskell bourne-shell make svg dockerfile yaml solidity python css html diff csharp go toml scss racket bash true 1151 0 32 1 false f(); if ( p() ) { g(); } else { h(); } m(); https://github.com/reach-sh/reach-lang 0 0 inno-setup Inno Setup 1997 12 pl 0 1232 1 22272 true 0 pl 3409 3719 178157 2 "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""" text source.inno programming false 1 1997 delphi ia-32 ini pascal unicode Inno Setup is a free software script-driven installation system created in Delphi by Jordan Russell. The first version was released in 1997. 2006 54 27 231 5715341 https://jrsoftware.org/ iss isl true 490 0 12 text United States "; Basic setup script for the Inno Setup installer builder. For more ; information on the free installer builder, see www.jrsoftware.org. ; ; This script was contributed by Tim Peters. ; It was designed for Inno Setup 2.0.19 but works with later versions as well. [Setup] AppName=Expat AppId=expat AppVersion=2.1.0 AppVerName=Expat 2.1.0 AppCopyright=Copyright 1998-2012 Thai Open Source Software Center, Clark Cooper, and the Expat maintainers AppPublisher=The Expat Developers AppPublisherURL=http://www.libexpat.org/ AppSupportURL=http://www.libexpat.org/ AppUpdatesURL=http://www.libexpat.org/ UninstallDisplayName=Expat XML Parser 2.1.0 VersionInfoVersion=2.1.0 DefaultDirName={pf}\Expat 2.1.0 UninstallFilesDir={app}\Uninstall Compression=lzma SolidCompression=yes SourceDir=.. OutputDir=win32 DisableStartupPrompt=yes AllowNoIcons=yes DisableProgramGroupPage=yes DisableReadyPage=yes [Files] Flags: ignoreversion; Source: win32\bin\Release\xmlwf.exe; DestDir: ""{app}\Bin"" Flags: ignoreversion; Source: win32\MANIFEST.txt; DestDir: ""{app}"" Flags: ignoreversion; Source: Changes; DestDir: ""{app}""; DestName: Changes.txt Flags: ignoreversion; Source: COPYING; DestDir: ""{app}""; DestName: COPYING.txt Flags: ignoreversion; Source: README; DestDir: ""{app}""; DestName: README.txt Flags: ignoreversion; Source: doc\*.html; DestDir: ""{app}\Doc"" Flags: ignoreversion; Source: doc\*.css; DestDir: ""{app}\Doc"" Flags: ignoreversion; Source: doc\*.png; DestDir: ""{app}\Doc"" Flags: ignoreversion; Source: win32\bin\Release\*.dll; DestDir: ""{app}\Bin"" Flags: ignoreversion; Source: win32\bin\Release\*.lib; DestDir: ""{app}\Bin"" Flags: ignoreversion; Source: expat.dsw; DestDir: ""{app}\Source"" Flags: ignoreversion; Source: win32\README.txt; DestDir: ""{app}\Source"" Flags: ignoreversion; Source: bcb5\*.bp*; DestDir: ""{app}\Source\bcb5"" Flags: ignoreversion; Source: bcb5\*.mak; DestDir: ""{app}\Source\bcb5"" Flags: ignoreversion; Source: bcb5\*.def; DestDir: ""{app}\Source\bcb5"" Flags: ignoreversion; Source: bcb5\*.txt; DestDir: ""{app}\Source\bcb5"" Flags: ignoreversion; Source: bcb5\*.bat; DestDir: ""{app}\Source\bcb5"" Flags: ignoreversion; Source: lib\*.c; DestDir: ""{app}\Source\lib"" Flags: ignoreversion; Source: lib\*.h; DestDir: ""{app}\Source\lib"" Flags: ignoreversion; Source: lib\*.def; DestDir: ""{app}\Source\lib"" Flags: ignoreversion; Source: lib\*.dsp; DestDir: ""{app}\Source\lib"" Flags: ignoreversion; Source: examples\*.c; DestDir: ""{app}\Source\examples"" Flags: ignoreversion; Source: examples\*.dsp; DestDir: ""{app}\Source\examples"" Flags: ignoreversion; Source: tests\*.c; DestDir: ""{app}\Source\tests"" Flags: ignoreversion; Source: tests\*.cpp; DestDir: ""{app}\Source\tests"" Flags: ignoreversion; Source: tests\*.h; DestDir: ""{app}\Source\tests"" Flags: ignoreversion; Source: tests\README.txt; DestDir: ""{app}\Source\tests"" Flags: ignoreversion; Source: tests\benchmark\*.c; DestDir: ""{app}\Source\tests\benchmark"" Flags: ignoreversion; Source: tests\benchmark\*.ds*; DestDir: ""{app}\Source\tests\benchmark"" Flags: ignoreversion; Source: tests\benchmark\README.txt; DestDir: ""{app}\Source\tests\benchmark"" Flags: ignoreversion; Source: xmlwf\*.c*; DestDir: ""{app}\Source\xmlwf"" Flags: ignoreversion; Source: xmlwf\*.h; DestDir: ""{app}\Source\xmlwf"" Flags: ignoreversion; Source: xmlwf\*.dsp; DestDir: ""{app}\Source\xmlwf"" [Messages] WelcomeLabel1=Welcome to the Expat XML Parser Setup Wizard WelcomeLabel2=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. " https://en.wikipedia.org/wiki/Inno_Setup 0 0 Inno Setup https://github.com/idleberg/atom-language-innosetup Inno Setup silk silk 2019 18 pl https://ajaymt.github.io/silk/ 0 1233 1 3 22267 true 0 https://github.com/AjayMT/silk pl 2019 2024 2019 5 1 81 1 false 2019 2021 90 1 30 1 4511 University of Illinois Urbana-Champaign ocaml bourne-shell markdown true 87 0 23 false United States https://news.ycombinator.com/item?id=22926080 "// A comment extern func printf(s *i8) void; func main(argc i32, argv **i8) i32 { printf(""hello, world\n""); if argc > 1 { val arg = @(argv + 1); printf(arg); } return 0; }" https://github.com/AjayMT/silk // printf true true true false 0 0 cache-objectscript Caché ObjectScript 1997 16 pl 0 1234 1 22262 4987 true 0 pl false c/Cache ObjectScript.mac 1997 mumps sql 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. 2005 19 19 55 2242790 InterSystems 115 0 19 mumps text United States "HelloWorld ; Write ""Hello World"" Quit " Cache ObjectScript Write """" true true https://en.wikipedia.org/wiki/Caché_ObjectScript 1 0 https://hopl.info/showlanguage.prx?exp=4987 title|year|author|goodreadsId|rating|ratings|reviews\nCache Objectscript and Mumps: Technical Learning Manual|2012|Paul Mike Kadow|23453991|3.29|7|0 parboiled parboiled 2009 Mathias Sirthias 10 grammarLanguage library http://parboiled.org/ 0 1235 0 4 22258 true 1 parboiled2 https://github.com/sirthias/parboiled grammarLanguage 2009 2024 53 156 1270 39 false 2009 2025 964 32 319 64 7493 "parboiled is a mixed Java/Scala library providing for lightweight and easy-to-use, yet powerful and elegant parsing of arbitrary input text based on Parsing expression grammars (PEGs). PEGs are an alternative to context free grammars (CFGs) for formally specifying syntax, they make a good replacement for regular expressions and generally have quite a few advantages over the ""traditional"" way of building parsers via CFGs." "parboiled is a mixed Java/Scala library providing for lightweight and easy-to-use, yet powerful and elegant parsing of arbitrary input text based on Parsing expression grammars (PEGs). PEGs are an alternative to context free grammars (CFGs) for formally specifying syntax, they make a good replacement for regular expressions and generally have quite a few advantages over the ""traditional"" way of building parsers via CFGs." "parboiled is a mixed Java/Scala library providing for lightweight and easy-to-use, yet powerful and elegant parsing of arbitrary input text based on Parsing expression grammars (PEGs). PEGs are an alternative to context free grammars (CFGs) for formally specifying syntax, they make a good replacement for regular expressions and generally have quite a few advantages over the ""traditional"" way of building parsers via CFGs." java scala yaml markdown true 1772 0 14 1 false https://github.com/sirthias/parboiled 0 0 haggis HAGGIS 2010 12 pl 0 1236 1 22257 true 0 pl false 2010 python HAGGIS is a high-level reference programming language used primarily to examine Computing Science for Scottish pupils taking SQA courses on the subject. HAGGIS is used as a tool to bridge the gap between pseudocode and typical computer programming. HAGGIS is not based on any one language but a mixture that is intended to allow a pupil familiar with any of the many languages used in classrooms to easily understand the syntactic construct being used in an example. It has multiple programming paradigms of functional, imperative and object-oriented to suit this purpose. There are three separate language definitions, one for each level at which computing is assessed by the SQA; these are proper subsets of each other, so for example any program contained by the National 5 level language is also well-defined at Higher and Advanced Higher levels. Higher includes the definition of procedures and functions and the use of record types and files, while Advanced Higher includes object-orientation. Online HAGGIS interpreters have been developed to provide a way for examiners and teachers to check their programs are correctly defined and behave as expected. 2016 92 11 88 52222071 University of Glasgow && Heriot Watt University && University of Strathclyde 480 0 15 text Scotland CONSTRUCTOR( [Data Type][Data Name], [Data Type][Data Name]...) The users' '''HAGGIS''' code will then go here. END CONSTRUCTOR FUNCTION () RETURN The users' '''HAGGIS''' code will then go here. RETURN THIS END FUNCTION '''“THIS” is used to reference the current object invoking the method.''' PROCEDURE () The users' '''HAGGIS''' code will then go here. END PROCEDURE ''' true true false https://en.wikipedia.org/wiki/HAGGIS 0 0 little little 2016 Larry McVoy 13 pl http://www.little-lang.org 0 1237 0 5 22255 true 0 https://github.com/bitkeeper-scm/little-lang pl 2016 2024 2016 13 18 216 9 false 2016 2016 30 11 18 1 3595 2016 https://www.little-lang.org/community.html lex bourne-shell make markdown bash true 283 0 18 1 false United States https://github.com/bitkeeper-scm/little-lang 0 0 little-lang.org 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 cognate Cognate 2020 Finn Barber 13 pl https://cognate-lang.github.io/ 0 1238 1 6 22254 true 0 https://github.com/cognate-lang/cognate pl 2020 2024 9 10 233 3 false 2020 2025 1427 17 56 5 8876 A human readable quasi-concatenative programming language. Cognate is a small, dynamic, concatenative language for functional programming. Cognate aims to express complex programs in a simple and readable way through its unique syntax, which emphasises embedding comments into statements. This makes programs very readable and helps a programmer better express their intentions. A human readable quasi-concatenative programming language. Cognate is a small, dynamic, concatenative language for functional programming. Cognate aims to express complex programs in a simple and readable way through its unique syntax, which emphasises embedding comments into statements. This makes programs very readable and helps a programmer better express their intentions. https://cognate-lang.github.io/learn.html A human readable quasi-concatenative programming language. Cognate is a small, dynamic, concatenative language for functional programming. Cognate aims to express complex programs in a simple and readable way through its unique syntax, which emphasises embedding comments into statements. This makes programs very readable and helps a programmer better express their intentions. yaml c lex yacc markdown make c true 282 0 20 1 false ~~ Prime numbers in Cognate Def Factor (Zero? Modulo Swap); Def Primes ( Let U is upper bound; initially List (); For Range 2 to U ( Let P is potential prime; Let Found be list of found primes; Let To-check be Take-while (<= Sqrt P) Found; When All (Not Factor of P) To-check ( Append P ) to Found ) ); Print Primes up to 1000; https://github.com/cognate-lang/cognate 0 0 manool manool 2018 Alex Protasov 19 pl https://manool.org/ 0 1239 1 7 22252 true 0 https://github.com/rusini/manool pl 2019 2024 2019 5 3 61 0 false 2019 2024 612 4 78 2 32306 2018 "Practical programming language with expressive power, in 10 KLOC in C++11 - ""MAnool is Not an Object-Oriented Language!""" "Practical programming language with expressive power, in 10 KLOC in C++11 - ""MAnool is Not an Object-Oriented Language!""" https://github.com/rusini/manool/pulls "Practical programming language with expressive power, in 10 KLOC in C++11 - ""MAnool is Not an Object-Oriented Language!""" cpp c yaml markdown bourne-shell make bash true 76 0 27 1 false Colombia https://www.reddit.com/r/ProgrammingLanguages/comments/ep8pc2/manool_practical_language_with_universal_syntax/ "-- recursive version, MANOOLish ""cascading"" notation { {extern ""manool.org.18/std/0.3/all""} in : let rec { Fact = -- compile-time constant binding { proc { N } as -- precondition: N.IsI48[] & (N >= 0) : if N == 0 then 1 else N * Fact[N - 1] } } in Out.WriteLine[""Factorial of 10 is ""; Fact[10]] }" https://github.com/rusini/manool -- true true false 0 0 manool.org qb64 QB64 2007 12 pl 0 1240 1 22248 true 0 pl false 2007 linux quickbasic basic qbasic 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. 2008 90 102 233 18410776 https://qb64.boards.net true 470 0 13 United States "t1 = _FREETIMER t2 = _FREETIMER ON TIMER(t1, 1) GOSUB Timer.Trap 'the code following the Timer.Trap label will be run every 1 second ON TIMER(t2, .5) mySub 'QB64 can also trigger a SUB procedure with TIMER; ' in this case mySUB will be triggered every 500 milliseconds 'activate timers: TIMER(t1) ON TIMER(t2) ON DO 'go into an infinite loop until the window is closed _LIMIT 1 'run the main loop at 1 cycle per second, to show how timers are independent from main program flow LOOP Timer.Trap: PRINT ""1s; ""; RETURN SUB mySub PRINT ""500ms; ""; END SUB" ' true true false https://en.wikipedia.org/wiki/QB64 0 0 simpl SIMPL 1990 16 pl https://web.archive.org/web/20180926123901/http://icanprogram.com/simpl 0 1241 0 22242 5221 true 0 https://simpl.cvs.sourceforge.net/cvsroot/simpl pl false 2012 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. 18 26 35101726 iCanProgram Inc true 111 0 16 Canada and United States https://www.crestron.com/en-US/Products/Control-Hardware-Software/Software/Control-System-Software/SW-SIMPL-PLUS https://simpl.cvs.sourceforge.net/cvsroot/simpl https://en.wikipedia.org/wiki/SIMPL 1 0 https://hopl.info/showlanguage.prx?exp=5221 year|publisher|title|authors|isbn13\n2008|Lulu.com|Programming the SIMPL Way|Collins, John and Findlay, Robert|9780557012701 nice Nice 2006 Daniel Bonniot 20 pl https://nice.sourceforge.net/ 0 1242 1 22236 true 0 pl false n/Nice.nice 2006 haskell eiffel java-bytecode java 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. 2003 9 20 50 294856 Inria nice 66 0 22 1 https://nice.sourceforge.net/manual.html https://nice.sourceforge.net/ text 1157 http://www.rosettacode.org/wiki/Category:Nice France https://nice.sourceforge.net/Nice-source.tar.gz "void main(String[] args){ println(""Hello World""); } " Nice println """" true true https://en.wikipedia.org/wiki/Nice_(programming_language) 0 0 fp FP 1977 John Backus 14 pl 0 1243 1 22232 759 true 0 pl false Functional Programming 1977 apl fl haskell j "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." 2004 35 32 94 899253 IBM 195 0 14 1 text 8320 http://www.rosettacode.org/wiki/Category:FP United States insert-left \f where \f:〈x〉 = x and \f:〈x1,x2,...,xn〉 = f:〈\f:〈x1,...,xn-1〉,xn〉 and \f:〈〉 = unit f https://en.wikipedia.org/wiki/FP_(programming_language) 2 0 https://hopl.info/showlanguage.prx?exp=759 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 objectscript ObjectScript 2012 unitpoint 15 pl http://objectscript.org 0 1244 0 14 22231 8615 true 0 https://github.com/unitpoint/objectscript pl 11 13 1054 text source.objectscript programming 2012 2024 2012 12 19 70 9 false 2012 2015 618 14 1224 48 695421 https://github.com/unitpoint/objectscript/issues cls cpp html cmake c bourne-shell xml javascript make css xslt markdown vim-script perl puppet true 143 0 29 1 false Russia https://www.codeproject.com/Articles/466907/%2FArticles%2F466907%2FObjectScript-A-new-programming-language https://github.com/unitpoint/objectscript 0 0 https://hopl.info/showlanguage.prx?exp=8615 ObjectScript ObjectScript aldor Aldor 1990 Richard Dimick Jenks and Barry Trager and Stephen Watt and James Davenport and Robert Sutor and Scott Morrison 18 pl http://www.aldor.org 0 1245 1 22230 6911 true 0 pl false 2000 1990 linux solaris pascal haskell python "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." 2004 12 23 63 948551 Western University true 81 0 24 6 text United Kingdom "#include ""aldor"" #include ""aldorio"" import from Integer, String; bob(n: Integer): String == { b: String := "" bottle""; if n ~= 1 then b := b + ""s""; b + "" of beer""; } main(): () == { n: Integer := 99; otw: String := "" on the wall""; -- refrain while n > 0 repeat { stdout << n << bob(n) << otw << "", "" << n << bob(n) << ""."" << newline; stdout << ""Take one down and pass it around, ""; n := n - 1; if n > 0 then stdout << n; else stdout << ""no more""; stdout << bob(n) << otw << ""."" << newline; stdout << newline; } -- last verse stdout << ""No more"" << bob(n) << otw << "", no more"" << bob(n) << ""."" << newline; stdout << ""Go to the store and buy some more, ""; n: Integer := 99; stdout << n << bob(n) << otw << ""."" << newline; } main();" -- true true true https://github.com/mattpap/IAldor https://en.wikipedia.org/wiki/Aldor 0 0 https://hopl.info/showlanguage.prx?exp=6911 aldor.org s-algol S-algol 1979 Ron Morrison and Tony Davie 20 pl 0 1246 2 22230 869 true 0 pl false s/S Algol 1979 algol-60 ps-algol unix pascal c napier88 algol 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. 2006 9 17 75 4706468 University of St Andrews 65 0 26 2 United Kingdom "write ""Hello World"" ? " "! Comments are introduced by an exclamation point and continue until end of line. ! The let keyword introduces declarations of constants and variables ! Identifiers start with an alphabetic character followed by alphanumeric characters or the full stop (.) ! An initial value must be given, and this determines the data type of declaration let width := 10 ! := sets the value of a variable, this is an int let animal := ""dog"" ! type string let x := -7 ; let y := x + x ! ; separates clauses, needed only if there are two or more clauses on a line let n.a = 6.022e+23 ! = is used to set the value of a constant, this is a cfloat (constant float) ! if and case can have values and be used in expressions let no.of.lives := if animal = ""cat"" then 9 else 1 ! Sieve of Eratosthenes write ""Find primes up to n = ?"" let n = readi ! constant values can be set during the program run let p = vector 2::n of true ! vector of bool with bounds 2 to n for i = 2 to truncate(sqrt(n)) do ! for indexes are constants so they use = rather than := if p(i) do ! vector dereference uses parens like a procedure call for j = 2 * i to n by i do p(j) := false for i = 2 to n do if p(i) do write i, ""'n"" ! 'n in a literal string is a newline ! structure (record) type for a binary tree of cstrings ! the pntr data type can point to a structure of any type, type checking is done at runtime structure tree.node(cstring name ; pntr left, right) ! inserts a new string into the binary tree head procedure insert.tree(cpntr head ; cstring new -> pntr) ! the case clause ends with a mandatory default option, use default : {} if it is not needed case true of head = nil : tree.node(new, nil, nil) new < head(name) : { head(left) := insert.tree(head(left), new) ; head } new > head(name) : { head(right) := insert.tree(head(right), new) ; head } default : head procedure print.tree(cpntr head) if head ~= nil do ! ~= is the not equals operator begin print.tree(head(left)) write head(name), ""'n"" print.tree(head(right)) end let fruit := nil fruit := insert.tree(fruit, ""banana"") fruit := insert.tree(fruit, ""kiwi"") fruit := insert.tree(fruit, ""apple"") fruit := insert.tree(fruit, ""peach"") print.tree(fruit) ! print in sorted order ! The end of the S-algol program is indicated by ? ?" S Algol ! write """" true false true true true true false true https://en.wikipedia.org/wiki/S-algol 0 0 https://hopl.info/showlanguage.prx?exp=869 fold Fold 2016 Erik Demaine and Jason S. Ku and Robert J. Lang 12 jsonFormat https://github.com/edemaine/fold/blob/main/doc/spec.md 0 1247 1 5 22229 true 0 https://github.com/edemaine/fold jsonFormat 2016 2024 18 48 304 27 false 2016 2023 206 7 26 1 7799 FOLD file format for origami models, crease patterns, etc. FOLD file format for origami models, crease patterns, etc. https://erikdemaine.org/papers/FOLD_CGW2016/paper.pdf FOLD file format for origami models, crease patterns, etc. coffeescript markdown javascript html json true 456 0 19 3 false "{ ""file_spec"": 1.1, ""file_creator"": ""fold-convert --flat-fold"", ""file_classes"": [ ""singleModel"" ], ""frame_classes"": [ ""foldedForm"" ], ""vertices_coords"": [ [0,0], [1,0], [0,0], [0,1] ], ""edges_vertices"": [ [0,1], [1,2], [2,3], [3,0], [3,1] ], ""edges_assignment"": [ ""B"", ""B"", ""B"", ""B"", ""V"" ], ""edges_foldAngle"": [ 0, 0, 0, 0, 180 ], ""cpedit:page"": {""xMin"":0,""yMin"":0,""xMax"":1,""yMax"":1}, ""file_title"": ""diagonal"", ""vertices_edges"": [ [0,3], [1,4,0], [1,2], [3,4,2] ], ""faces_vertices"": [ [0,1,3], [1,2,3] ], ""faces_edges"": [ [0,4,3], [1,2,4] ], ""edges_faces"": [ [0,null], [1,null], [1,null], [0,null], [1,0] ], ""faces_flatFoldTransform"": [ [[1,0,0],[0,1,0]], [[0,-1,1],[-1,0,1]] ], ""faces_flatFoldOrientation"": [ 1, -1 ], ""vertices_flatUnfoldCoords"": [ [0,0], [1,0], [1,1], [0,1] ] }" https://github.com/edemaine/fold 0 0 iswim ISWIM 1966 Peter Landin 15 pl 0 1248 1 22221 261 true 0 pl false If you See What I Mean 1966 algol-60 lisp haskell clean lucid krc hope miranda "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." 2003 24 43 97 233385 RAND 140 0 16 1 text United Kingdom Print `Hello world' Print true true https://en.wikipedia.org/wiki/ISWIM 0 0 https://hopl.info/showlanguage.prx?exp=261 om Om 2012 Jason Erb 14 pl https://www.om-language.org/ 0 0.1.3 1249 0 6 22220 true 0 https://github.com/sparist/Om pl 2012 2024 2012 16 8 166 11 false 2012 2024 682 2 277 87 33670 https://github.com/sparist/Om/issues cpp cmake markdown html css bourne-shell true 194 0 20 1 false 0 true Canada https://github.com/sparist/Om 0 0 om-language.org snowman-decompiler Snowman 2015 10 decompiler 0 1250 1 8 22218 false 0 https://github.com/yegord/snowman decompiler 2015 2024 2015 119 309 2265 94 false s/Snowman.sm 2023 2023 1 1 1 SmartDec sm javascript json yaml html markdown css svg ejs true 3194 0 18 false Russia or Israel "~""Hello World""sPvG" Snowman https://github.com/yegord/snowman 0 0 alice Alice 2000 13 pl http://www.ps.uni-saarland.de/alice 0 1251 2 22218 true 0 pl false a/Alice.alice 2000 ml oz standard-ml haskell 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. 2006 48 36 94 30877972 Saarland University alice true 261 0 13 https://tio.run/#alice text 5414 """dlroW olleH""d&O`@ " fun fib 0 = 0 | fib 1 = 1 | fib n = spawn fib(n-1) + fib(n-2); Alice https://en.wikipedia.org/wiki/Alice_(programming_language) 6 0 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 alumina Alumina 2021 14 pl https://docs.alumina-lang.net 0 1252 1 14 22216 true 0 https://github.com/tibordp/alumina pl 2021 2024 2021 9 8 163 1 false 2021 2025 318 1 323 11 123375 https://play.alumina-lang.net/ rust markdown json yaml javascript toml python svg css make dockerfile c bourne-shell xml c true 190 0 30 rust false https://docs.alumina-lang.net/ https://www.reddit.com/r/ProgrammingLanguages/comments/x4xhdj/alumina_programming_language/ "fn main() { println!(""Hello, world!""); }" https://github.com/tibordp/alumina 0 0 obsidian-lang Obsidian 2018 Michael Coblenz 15 pl http://obsidian-lang.com 0 1253 0 24 22216 true 0 https://github.com/mcoblenz/Obsidian pl 2017 2024 2017 16 10 76 79 false 2017 2023 2056 29 906 128 53325 2018 Obsidian: A safer blockchain programming language Obsidian: A safer blockchain programming language University of California San Diego Obsidian: A safer blockchain programming language solidity java scala bourne-shell html restructuredtext tex json yaml xml agda markdown bash python gradle csv typescript css mustache make javascript svg perl protobuf https://cheatsheets.zip/obsidian true 137 0 39 1 false United States https://github.com/mcoblenz/Obsidian 0 0 obsidian-lang.com 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 eff eff 2012 11 pl https://www.eff-lang.org/ 0 1254 0 12 22214 true 0 https://github.com/matijapretnar/eff pl 2012 2024 2012 35 41 854 6 false 2012 2024 2577 24 393 16 42734 2012 University of Ljubljana ocaml xml svg html markdown matlab yaml bourne-shell lisp javascript python make true 1003 0 23 false Slovenia https://github.com/matijapretnar/eff 0 0 eff-lang.org wah wah 2017 Tom MacWright 14 pl 0 1255 1 3 22210 true 0 https://github.com/tmcw/wah pl 2017 2024 2017 9 8 158 0 false 2017 2017 20 2 21 1 1090 a slightly higher-level language superset of webassembly a slightly higher-level language superset of webassembly a slightly higher-level language superset of webassembly markdown wasm clojure wasm true 185 0 19 wasm 1 false text (0 = 1) (%$a + %$b) (0 + 1) https://github.com/tmcw/wah 0 0 focus FOCUS 1997 12 pl 1 1256 0 22208 2041 true 1 cloc pl false 1997 mathematica sql ibm-rpg 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. 2004 49 40 83 867853 Information Builders Inc 265 0 13 focexec text 1230 United States https://en.wikipedia.org/wiki/FOCUS 4 0 https://hopl.info/showlanguage.prx?exp=2041 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 heron-lang Heron 2016 Christopher Diggins 18 pl https://cdiggins.github.io/heron-language 0 0.3.0 1257 1 10 22202 true 0 https://github.com/cdiggins/heron-language pl 2016 2024 2016 5 5 59 0 false 2016 2023 95 3 253 19 62913 https://github.com/cdiggins/heron-language/issues javascript typescript html json markdown css svg yaml python xml true 79 0 29 1 false 0 true Canada // Named function with statement body function sum(xs) { var result = 0; for (var x in xs) result += x; return result; } https://twitter.com/cdiggins https://github.com/cdiggins/heron-language // true true false 0 0 lucid-lang Lucid 2014 Chris Done 12 template 0 2.11.0 1258 1 6 22201 true 0 https://github.com/chrisdone/lucid template 2014 2024 2014 12 40 279 1 false 2014 2025 263 32 45 1 5815 https://github.com/chrisdone/lucid/issues haskell markdown yaml css javascript dockerfile true 432 0 18 1 false 2 true England "table_ [rows_ ""2""] (tr_ (do td_ [class_ ""top"",colspan_ ""2"",style_ ""color:red""] (p_ ""Hello, attributes!"") td_ ""yay!""))" https://github.com/chrisdone/lucid 0 0 recfiles Recfiles 2009 Jose E. Marchesi 22 dataNotation https://www.gnu.org/software/recutils/ 0 v1.7.91 1259 1 10 22200 true 1 susn https://git.savannah.gnu.org/git/recutils.git dataNotation false 2009 2023 1259 23 261 5 73101 1964 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. -1 1 63063548 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. 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. Free Software Foundation 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. rec c bourne-shell make sed tex css lex m4 yacc python true 39 0 34 1 false 1 true https://fscons.org/videos/2011/gnu-recutils-changed-title-and-subject.webm United States https://www.gnu.org/software/recutils/ %rec: Book %mandatory: Title %type: Location enum loaned home unknown %doc: + A book in my personal collection. Title: GNU Emacs Manual Author: Richard M. Stallman Publisher: FSF Location: home Title: The Colour of Magic Author: Terry Pratchett Location: loaned Title: Mio Cid Author: Anonymous Location: home Title: chapters.gnu.org administration guide Author: Nacho Gonzalez Author: Jose E. Marchesi Location: unknown Title: Yeelong User Manual Location: home https://git.savannah.gnu.org/git/recutils.git # true true false https://en.wikipedia.org/wiki/Recfiles 0 0 srt SRT 2013 Marc Cymontkowski 13 protocol https://www.srtalliance.org/ 0 1260 0 13 22199 true 1 rtmp https://github.com/Haivision/srt protocol false 2017 2025 2353 158 316 16 113155 Secure Reliable Transport (SRT) is an open source video transport protocol that utilises the UDP transport protocol. Secure Reliable Transport (SRT) is an open source video transport protocol that utilises the UDP transport protocol. Haivision Secure Reliable Transport (SRT) is an open source video transport protocol that utilises the UDP transport protocol. cpp markdown c cmake yaml tcl powershell bourne-shell python bash lua xml vim-script true 180 0 26 1 false https://github.com/antlr/grammars-v4/tree/master/srt https://github.com/Haivision/srt https://en.wikipedia.org/wiki/Secure_Reliable_Transport 0 0 raptorjit raptorjit 2009 Mike Pall 11 pl 0 v1.0.3 1261 0 12 22198 true 0 https://github.com/raptorjit/raptorjit pl 2017 2024 2009 58 39 834 127 false 2009 2024 3304 21 444 9 87889 https://github.com/raptorjit lua c html nix markdown css make r assembly-language cpp pascal yaml true 973 0 23 1 false 1 true Unknown https://github.com/raptorjit/raptorjit 0 0 fractran FRACTRAN 1996 John Conway 13 esolang 0 1262 1 22198 true 0 esolang false 1996 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. 2007 46 13 94 13408203 University of Cambridge 250 0 13 1 https://tio.run/#fractran https://esolangs.org/wiki/Fractran text United Kingdom http://raganwald.com/2020/05/03/fractran.html 17/65, 133/34, 17/19, 23/17, 2233/69, 23/29, 31/23, 74/341, 31/37, 41/31, 129/287, 41/43, 13/41, 1/13, 1/3 https://en.wikipedia.org/wiki/FRACTRAN 0 0 humanhash-hash-function humanhash-hash-function 2011 Zachary Voase 11 hashFunction 0 v0.0.1 1263 0 2 22197 false 0 https://github.com/zacharyvoase/humanhash hashFunction 2011 2024 2011 18 39 852 11 false 2011 2011 5 1 5 1 261 https://github.com/zacharyvoase/humanhash/issues python markdown true 971 0 13 1 false 0 true United States https://github.com/zacharyvoase/humanhash 0 0 multics Multics 1967 11 pl 0 1264 0 22196 3513 true 0 pl false 1969 pl-i assembly-language unix linux algol 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). 2001 190 303 18847 University of Calgary false 970 0 11 Canada https://semanticscholar.org/paper/bbdb16ebe3c71e7b6d32750ae61d0aab7ab72e84 https://en.wikipedia.org/wiki/Multics 0 1 https://hopl.info/showlanguage.prx?exp=3513 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 pilot PILOT 1962 14 pl 0 1265 2 22185 341 true 0 pl false Programmed Instruction, Learning, or Teaching 1960 basic 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 2002 31 162 104 57399 University of California San Francisco 175 0 14 text 3447 http://www.rosettacode.org/wiki/Category:PILOT United States R:Hello world in PILOT T:Hello World! R:Call subroutine starting at label *INITIALIZE U:*INITIALIZE https://en.wikipedia.org/wiki/PILOT 0 0 https://hopl.info/showlanguage.prx?exp=341 PILOT ooxml Office Open XML 2006 10 xmlFormat 0 1266 0 22183 true 0 xmlFormat false 2006 xml excel-app 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. 2005 560 1196 5072 3300610 Microsoft 2820 0 10 https://learn.microsoft.com/en-us/office/open-xml/open-xml-sdk text United States https://en.wikipedia.org/wiki/Office_Open_XML 0 0 elpi Elpi 2014 Enrico Tassi 12 pl 0 5.0.0 1267 0 10 22183 true 0 https://github.com/LPCIC/elpi pl 2017 2024 2014 13 34 277 49 false elpi.py 2014 2025 3176 32 523 44 593560 https://github.com/LPCIC elpi standard-ml ocaml json markdown make restructuredtext yaml python typescript tex true 412 0 22 1 false 5 true Unknown Elpi https://github.com/LPCIC/elpi 0 0 orange orange 2014 Robert Fratto 16 pl https://web.archive.org/web/20191002000130/http://orange-lang.org/ 0 1268 1 4 22183 true 0 https://github.com/orange-lang/orange pl 2015 2024 10 8 74 5 false 2017 2018 2009 1 81 4 133 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. 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. https://github.com/orange-lang 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. go yaml markdown dockerfile true 101 0 78 1 false United States "extern printf(char* s, ...) -> int32 class Person public char* name public Person(char* name) @name = name end end Person john = Person(""Johnny"") printf(""Hello, %s!\n"", john.name)" 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 https://github.com/orange-lang/orange 0 0 orange-lang.org 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 05ab1e 05AB1E 2015 11 esolang 0 1269 2 3 22179 true 0 https://github.com/Adriandmen/05AB1E esolang 2015 2024 2015 24 48 755 40 false #/05AB1E 2015 2024 872 28 49 4 18431 elixir markdown yaml true 928 0 15 false PUSH 4 PUSH 5 MULTIPLY """Hello World" 05AB1E https://github.com/Adriandmen/05AB1E """" true 0 0 faust FAUST 2002 14 pl http://faust.grame.fr 0 1270 0 22176 true 0 pl 21 22 199 text source.faust programming false 2015 linux unix c max haskell 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. 2006 30 76 107 4532356 Centre national de création musicale dsp true 171 0 14 text http://www.rosettacode.org/wiki/Category:FAUST France https://en.wikipedia.org/wiki/FAUST_(programming_language) 0 0 faust.grame.fr Faust Faust quakec QuakeC 1996 John Carmack 14 pl 0 1271 1 22174 true 0 pl false q/QuakeC.qc 1996 c linux 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. 2001 30 91 124 25207 id Software LLC qc 170 0 15 1 text http://www.rosettacode.org/wiki/Category:QuakeC United States "bprint(""Hello World\n"");" QuakeC bprint true https://en.wikipedia.org/wiki/QuakeC 1 0 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 jsoncanvas JSON Canvas 2024 10 jsonFormat https://jsoncanvas.org https://jsoncanvas.org/spec/1.0 0 1272 0 6 22173 true 0 https://github.com/obsidianmd/jsoncanvas jsonFormat 2024 2024 28 78 2430 21 false 2024 2024 80 19 24 1 1925 An open file format for infinite canvas data. An open file format for infinite canvas data. An open file format for infinite canvas data. html markdown javascript svg css yaml true 2685 0 16 false https://github.com/obsidianmd/jsoncanvas 0 0 teco TECO 1963 13 pl 0 1273 3 22171 2563 true 0 pl false Text editor character oriented 1962 emacs-editor unix isbn 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. 2001 43 24 331 30449 235 0 13 text http://www.rosettacode.org/wiki/Category:Teco United States TECO !Hello World in TECO !The $ symbol below wouldn't actually be a printing character - !it's the [escape] character, \u001b! FTHello World$ https://riju.codes/teco IHello, world! $HT$$ "0uz ! clear repeat flag ! B, switch lines and set flag ! qbua ! load B into A ! l .-z;> ! loop back if another line in buffer ! qz;> ! repeat if a switch was made last pass !" https://en.wikipedia.org/wiki/TECO_(text_editor) 0 0 https://hopl.info/showlanguage.prx?exp=2563 souper souper 2014 10 optimizingCompiler 0 1274 0 10 22170 false 0 https://github.com/google/souper optimizingCompiler 2014 2024 2014 64 167 2097 93 false 2014 2024 868 31 819 3 49691 A superoptimizer for LLVM IR A superoptimizer for LLVM IR Google A superoptimizer for LLVM IR llvmir cpp c markdown bourne-shell cmake dockerfile yaml python perl true 2630 0 20 false United States https://github.com/google/souper 0 0 abcl-lang Armed Bear Common Lisp 2008 12 pl https://common-lisp.net/project/armedbear/ 0 1275 0 15 22167 true 0 https://github.com/armedbear/abcl pl 2016 2024 2008 27 29 287 105 false Armed Bear Common Lisp ABCL 2008 2024 3499 27 856 69 132567 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. 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. 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. lisp java markdown bash tex xml diff html yaml bourne-shell restructuredtext dockerfile korn-shell make awk true 403 0 27 false https://twitter.com/armedbear https://github.com/armedbear/abcl 0 0 observable-framework Observable Framework 2023 Mike Bostock 10 staticSiteGenerator https://observablehq.com/framework/ 0 1276 0 13 22163 true 0 https://github.com/observablehq/framework staticSiteGenerator 2023 2024 22 91 2231 169 false 2023 2025 1799 41 1556 44 307569 A static site generator for data apps, dashboards, reports, and more. Observable Framework combines JavaScript on the front-end for interactive graphics with any language on the back-end for data analysis. A static site generator for data apps, dashboards, reports, and more. Observable Framework combines JavaScript on the front-end for interactive graphics with any language on the back-end for data analysis. A static site generator for data apps, dashboards, reports, and more. Observable Framework combines JavaScript on the front-end for interactive graphics with any language on the back-end for data analysis. javascript markdown json typescript html css csv bourne-shell python yaml go rust r true 2547 0 23 1 false https://github.com/observablehq/framework 0 0 netrexx NetRexx 1996 Mike Cowlishaw 19 pl 0 1277 1 22161 2277 true 0 pl false n/NetRexx.nrx 1996 pl-i rexx object-rexx java jvm 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. 2007 9 19 133 11690683 IBM nrx 65 0 21 1 text http://www.rosettacode.org/wiki/Category:NetRexx United States say 'Hello World' NetRexx say ' true true false true https://en.wikipedia.org/wiki/NetRexx 1 0 https://hopl.info/showlanguage.prx?exp=2277 title|year|author|goodreadsId|rating|ratings|reviews\nThe Netrexx Language|1997|M. F. Cowlishaw|7283371|5.00|1|0 jmp JMP 1989 10 application 0 1278 0 22160 false 2 jsl tea-pl application false 2019 "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." 174 200 1979375 SAS Institute Inc https://community.jmp.com/kvoqx44227/attachments/kvoqx44227/mastering-jmp/82/3/JMP%2014%20Quick%20Reference%20Card.pdf 1154 0 11 jsl United States https://reddit.com/r/jmp https://en.wikipedia.org/wiki/JMP_(statistical_software) 0 0 ark-lang Ark 2014 11 pl https://ark-lang.github.io/ 0 1279 1 6 22160 true 0 https://github.com/ark-lang/ark pl 2014 2024 2014 40 47 676 45 false 2014 2019 3483 48 233 16 4998 toml go markdown make yaml bourne-shell true 867 0 17 false "// binding to printf [c] func printf(fmt: ^u8, ...); pub func main(argc: int, argv: ^^u8) -> int { // accessed via the C module C::printf(c""Running %s\n"", ^argv); // mutable i, type inferred mut i := 0; for i < 5 { C::printf(c""%d\n"", i); i += 1; } return 0; } " https://github.com/ark-lang/ark 0 0 ark-lang.github.io 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 subversion Subversion 2000 10 versionControlApplication http://subversion.apache.org/ 0 1280 1 22154 false 0 versionControlApplication false 2000 c free-pascal freebsd xml csharp php python perl ruby java mime unix 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. 2002 491 493 1596 144868 Apache Software Foundation true 2476 0 10 text componentfoo/ /trunk/ /tags/ /1.1/ componentbar/ /trunk/ /tags/ /1.1/ https://en.wikipedia.org/wiki/Apache_Subversion 0 0 subversion.apache.org yasl Yet Another Scripting Language 2017 15 pl 0 v0.13.5 1281 1 8 22154 true 0 https://github.com/yasl-lang/yasl pl 2017 2024 2017 5 14 63 54 false Yet Another Scripting Language 2017 2025 2268 13 998 4 29353 c cpp logos bourne-shell markdown python yaml cmake true 119 0 24 false 0 true https://www.reddit.com/r/ProgrammingLanguages/comments/diiqwt/request_for_feedback_on_pattern_matchingtype/ "# simple program that iteratively calculates factorials fn range(a, b) { tmp := [] for i := a; i < b; i += 1 { tmp->push(i) } return tmp } fn fact(n) { tmp := 1 while n > 0 { tmp *= n n -= 1 } return tmp } for i <- range(0, 7) { echo ""fact(#{i}): #{fact(i)}"" }" https://github.com/yasl-lang/yasl # true true false 0 0 aardvark Aardvark 2020 Hg0428 and JustCoding123 and CompilingCoder and TheBoys619 and PlasDev and ZDev1 66 pl https://aardvark-docs.replit.app/ 0 v1.0.0-test.3-bugfix 1282 1 6 22145 true 0 https://github.com/Aardvark-team/Aardvark-py pl 2022 2024 2022 3 1 8 0 false 2022 2025 337 7 125 37 3749 Aardvark was originally designed in Python as an interpretter. This encompassed all releases up to 1.0. Then, in 2021 and 2022, other implementations started emerging, written in language such as Go and C++. In 2022, however, Aardvark underwent the 1.0 redesign. The language was redesigned from the ground up and re-implemented with a new, but temporary Python interpretter. Now, in 2023, the team is building the final compiler. This compiler is written in Aardvark itself and compiles to LLVM. It has the goal of being faster than C while easier than Python. It was designed for beginners and pros alike. The documentation is avaialiable here: https://aardvark-docs.programit.repl.co. It includes many tutorials and articles. Aardvark was originally designed in Python as an interpretter. This encompassed all releases up to 1.0. Then, in 2021 and 2022, other implementations started emerging, written in language such as Go and C++. In 2022, however, Aardvark underwent the 1.0 redesign. The language was redesigned from the ground up and re-implemented with a new, but temporary Python interpretter. Now, in 2023, the team is building the final compiler. This compiler is written in Aardvark itself and compiles to LLVM. It has the goal of being faster than C while easier than Python. It was designed for beginners and pros alike. The documentation is avaialiable here: https://aardvark-docs.programit.repl.co. It includes many tutorials and articles. discord Aardvark was originally designed in Python as an interpretter. This encompassed all releases up to 1.0. Then, in 2021 and 2022, other implementations started emerging, written in language such as Go and C++. In 2022, however, Aardvark underwent the 1.0 redesign. The language was redesigned from the ground up and re-implemented with a new, but temporary Python interpretter. Now, in 2023, the team is building the final compiler. This compiler is written in Aardvark itself and compiles to LLVM. It has the goal of being faster than C while easier than Python. It was designed for beginners and pros alike. The documentation is avaialiable here: https://aardvark-docs.programit.repl.co. It includes many tutorials and articles. python markdown bourne-shell toml powershell json true 20 0 77 6 false 1 true https://aardvark-docs.programit.repl.co/ South Korea "stdout.write(""Hello World!\n"")" https://discord.gg/MM3HmfzRfS https://github.com/Aardvark-team/Aardvark-py true true true true true true true true true true true true true true true true true true true true true true true true true true true true false true true true true true true true true true true true true true true true true true true 0 0 bioconductor-pm Bioconductor 2001 11 packageManager https://www.bioconductor.org/ 0 1283 0 22143 false 0 packageManager false 1649 2001 162 Fred Hutchinson Cancer Research Center 831 0 11 United States https://twitter.com/bioconductor https://en.wikipedia.org/wiki/Bioconductor 0 0 bioconductor.org jupyter-editor Project Jupyter 2014 10 editor https://jupyter.org/ 0 1284 0 22140 false 0 editor false 2014 2014 julia python r haskell ruby json markdown html latex restructuredtext jquery maple mathematica sagemath mathematica-editor octave rstudio scilab spyder-editor "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." 2018 477 17 45 57313979 https://github.com/jupyter/ 2406 0 10 na Various https://en.wikipedia.org/wiki/Project_Jupyter 0 0 jupyter.org ko ko 2018 Petar Maymounkov 12 pl 0 1285 0 17 22139 true 0 https://github.com/kocircuit/kocircuit pl 2018 2024 2018 17 22 307 16 false 2018 2018 423 4 1843 10 26067 https://github.com/kocircuit/kocircuit go markdown hcl json assembly-language yaml bourne-shell perl protobuf xml svg toml dockerfile make cson c csv true 378 0 29 1 false 9241 The Netherlands and United States https://github.com/kocircuit/kocircuit 0 0 moya moya 2015 Will McGugan 14 pl https://www.moyaproject.com/ 0 v0.6.19 1286 0 12 22139 true 0 https://github.com/moyaproject/moya pl 2015 2024 2015 12 14 111 0 false 2015 2019 950 3 2751 6 710885 2011 https://github.com/moyaproject html json python xml ini javascript css svg csharp bourne-shell csv markdown true 158 0 26 1 false 0 true United Kingdom https://github.com/moyaproject/moya 0 0 moyaproject.com 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 latino latino 2015 Primitivo R. Montero 22 pl https://lenguaje-latino.org/ 0 v0.9.1 1287 1 17 22139 true 0 https://github.com/primitivorm/latino pl 2020 2023 2015 1 1 13 0 false Spanish l/Latino.lat 2015 2021 1162 33 389 258 197802 2022 https://github.com/lenguaje-latino lat c bourne-shell markdown cmake yaml make svg bash dockerfile m4 tex xml yacc lex awk sed powershell true 51 0 41 1 false 0 true text 7415 Mexico "escribir(""Hello World"") " Latino https://github.com/primitivorm/latino escribir """" true true 0 0 lenguaje-latino.org htl HTL 2019 Mike Bostock 12 template library https://observablehq.com/@observablehq/htl 0 0.3.1 1288 1 5 22138 true 0 https://github.com/observablehq/htl template 2019 2024 9 24 298 12 false 2019 2021 78 5 54 1 3073 Inspired by lit-html and HTM, and referencing the fantastically precise HTML5 spec, we built hypertext literal: a tagged template literal for HTML which interpolates values based on context, allowing automatic escaping and the interpolation of non-serializable values, such as event listeners, style objects, and other DOM nodes. Inspired by lit-html and HTM, and referencing the fantastically precise HTML5 spec, we built hypertext literal: a tagged template literal for HTML which interpolates values based on context, allowing automatic escaping and the interpolation of non-serializable values, such as event listeners, style objects, and other DOM nodes. Inspired by lit-html and HTM, and referencing the fantastically precise HTML5 spec, we built hypertext literal: a tagged template literal for HTML which interpolates values based on context, allowing automatic escaping and the interpolation of non-serializable values, such as event listeners, style objects, and other DOM nodes. html javascript json markdown yaml true 377 0 17 1 false 0 true "html`It’s yellow (and italic).`" https://github.com/observablehq/htl 0 0 ktexteditor-editor ktexteditor-editor 2014 Christoph Cullmann 12 editor https://invent.kde.org/frameworks/ktexteditor 0 v6.2.0 1289 0 11 22138 false 0 https://github.com/KDE/ktexteditor editor 2015 2024 2014 5 22 72 0 false 2014 2025 5344 237 2613 514 188180 KDE e.V. javascript cpp qt cmake xml markdown yaml bourne-shell svg json c true 377 0 23 1 false 6 true Germany https://github.com/KDE/ktexteditor 0 0 zenscript zenscript 2014 Stan Hebben 14 pl 0 1290 1 3 22137 true 0 https://github.com/CraftTweaker/ZenScript pl 8 8 1390 text source.zenscript programming 2018 2024 2014 9 21 76 8 false 2014 2025 277 17 327 1 227 zs zs java gradle markdown true 157 0 19 1 false var x = 5; print(x+5); for i in 0 to 10 { print(10 - i); } for i in 10 .. 20 { if i %2 == 0{ print(i); } } https://github.com/CraftTweaker/ZenScript print true 0 0 ZenScript ZenScript ixml Invisible XML 2020 Steven Pemberton 17 grammarLanguage https://invisiblexml.org/ 0 1291 1 13 22134 true 0 https://github.com/invisiblexml/ixml/ grammarLanguage 2020 2024 10 7 48 21 false ixml 2020 2025 829 8 3993 33 295512 2020 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. 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. https://github.com/invisibleXML 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. xml markdown xslt xquery html css javascript yaml bourne-shell gradle svg make lisp true 79 0 31 xml 1 false The Netherlands https://news.ycombinator.com/item?id=32120230 "url: scheme, "":"", authority, path. scheme: letter+. authority: ""//"", host. host: sub++""."". sub: letter+. path: (""/"", seg)+. seg: fletter*. -letter: [""a""-""z""]; [""A""-""Z""]; [""0""-""9""]. -fletter: letter; "".""." https://github.com/invisiblexml/ixml/ 0 0 invisiblexml.org jisp Jisp 2014 Nelo Mitranim 14 pl https://mitranim.com/jisp/ 0 0.3.3 1292 0 3 22131 true 0 https://github.com/mitranim/jisp pl 2014 2024 7 9 126 30 false 2014 2015 338 1 58 3 13957 https://github.com/mitranim/jisp/issues jisp javascript json markdown true 156 0 29 1 false 0 true Unknown car head cdr tail init last let isa insta any prn https://github.com/mitranim/jisp 0 0 kixtart KiXtart 1991 14 pl http://www.kixtart.org/ 0 1293 1 22131 true 0 pl false 1999 1991 isbn fasttrack-scripting-host autoit "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""." 2005 27 21 70 1370630 https://github.com/kivy 156 0 15 text Various "; Read value from registry $ProductID = ReadValue(""HKEY_LOCAL_MACHINE\Software\Microsoft\Windows NT\CurrentVersion"",""ProductId"") ; Display result or error message If @ERROR = 0 ? ""ProductID=$ProductID"" Else ? ""Error reading product ID"" Endif ? ; Done Exit @ERROR" ; true true false https://en.wikipedia.org/wiki/KiXtart 0 0 kixtart.org aplusplus A++ 1996 13 pl 0 1294 1 22130 true 0 pl false a/A++ 1996 isbn 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. 2001 38 23 4661 425819 Bull's Software-Haus 210 0 15 text Germany "(print ""Hello World"")" A++ print """" true true https://en.wikipedia.org/wiki/A++ 0 0 ply PLY 1994 Greg Turk 24 textDataFormat 3d http://paulbourke.net/dataformats/ply/ 0 1295 1 22126 true 1 spz textDataFormat false Polygon File Format PLY is a computer file format known as the Polygon File Format or the Stanford Triangle Format. It was principally designed to store three-dimensional data from 3D scanners. The data storage format supports a relatively simple description of a single object as a list of nominally flat polygons, with attributes such as color, texture coordinates, and normals. PLY is a computer file format known as the Polygon File Format or the Stanford Triangle Format. It was principally designed to store three-dimensional data from 3D scanners. The data storage format supports a relatively simple description of a single object as a list of nominally flat polygons, with attributes such as color, texture coordinates, and normals. Stanford University PLY is a computer file format known as the Polygon File Format or the Stanford Triangle Format. It was principally designed to store three-dimensional data from 3D scanners. The data storage format supports a relatively simple description of a single object as a list of nominally flat polygons, with attributes such as color, texture coordinates, and normals. ply true 21 0 25 1 text https://github.com/antlr/grammars-v4/tree/master/ply United States ply format ascii 1.0 comment Mars model by Paul Bourke element vertex 259200 property float x property float y property float z element face 516960 property list uchar int vertex_indices end_header 15081.5 -3.45644e+06 65.8061 15081 -3.45659e+06 197.422 15078.2 -3.45648e+06 329.009 15075.4 -3.45663e+06 460.597 15071.2 -3.4567e+06 592.148 15065.6 -3.45674e+06 723.653 15059.9 -3.457e+06 855.16 15050.7 -3.45674e+06 986.473 lots of vertices follow 14541.2 3.33642e+06 -698.464 14547.7 3.33663e+06 -571.58 14551.5 3.33649e+06 -444.589 14552.7 3.336e+06 -317.541 14556.9 3.33645e+06 -190.56 14558.7 3.33661e+06 -63.5247 3 0 721 1 3 721 0 720 3 1 722 2 3 722 1 721 3 2 723 3 3 723 2 722 lots of triangular facets follow false true true true false false false true https://en.wikipedia.org/wiki/PLY_(file_format) 0 0 peoplecode PeopleCode 2008 14 pl 0 1296 3 22124 true 0 pl false p/PeopleCode 2008 java 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. 2006 27 10 83 5157513 Oracle 155 0 15 text https://github.com/antlr/grammars-v4/tree/master/peoplecode http://www.rosettacode.org/wiki/Category:PeopleCode "/* Hello World in PeopleCode 8.45 &MsgText = MsgGetText(66666666, 999999999, ""Hello World!""); " "MessageBox(0, """", 0, 0, ""Hello World""); " "&SQL = CreateSQL(""SQL Statement""); &SQL.Execute([bind_values]);" PeopleCode """" true https://en.wikipedia.org/wiki/PeopleCode 6 0 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 gdl GNU Data Language 2004 Marc Schellens 15 idl http://gnudatalanguage.sourceforge.net/ 0 1297 0 1 22124 true 0 idl false GNU Data Language 2004 linux solaris idl octave ncl perl-data-language r scilab scipy yorick hdf postscript python The GNU Data Language (GDL) is a free alternative to IDL (Interactive Data Language). Together with its library routines, GDL is developed to serve as a tool for data analysis and visualization in such disciplines as astronomy, geosciences, and medical imaging. GDL is licensed under the GPL. Other open-source numerical data analysis tools similar to GDL include GNU Octave, NCAR Command Language (NCL), Perl Data Language (PDL), R, Scilab, SciPy, and Yorick. GDL as a language is dynamically-typed, vectorized, and has object-oriented programming capabilities. GDL library routines handle numerical calculations (e.g. FFT), data visualisation, signal/image processing, interaction with host OS, and data input/output. GDL supports several data formats, such as NetCDF, HDF (v4 & v5), GRIB, PNG, TIFF, and DICOM. Graphical output is handled by X11, PostScript, SVG, or z-buffer terminals, the last one allowing output graphics (plots) to be saved in raster graphics formats. GDL features integrated debugging facilities, such as breakpoints. GDL has a Python bridge (Python code can be called from GDL; GDL can be compiled as a Python module). GDL uses Eigen (C++ library) numerical library (similar to Intel MKL) to have excellent computing performance on multi-cores processors, with better benchmark than IDL on large matrix operations. Packaged versions of GDL are available for several Linux and BSD flavours as well as Mac OS X. The source code compiles on Microsoft Windows (since GDL 0.9.3) and other UNIX systems, including Solaris. GDL is not an official GNU package. 2005 18 12 107 1801308 https://github.com/gnudatalanguage/gdl/issues cpp true 111 0 16 1 false text Various https://en.wikipedia.org/wiki/GNU_Data_Language 1 0 gnudatalanguage.sourceforge.net title|year|author|goodreadsId|rating|ratings|reviews\nGDL Programming Manual|2015|HIRASAWA Gakuhito|45092547|0.0|0|0 opl OPL 1984 15 pl http://opl-dev.sourceforge.net 0 1298 1 22124 true 0 pl false Open Programming Language 1984 basic visual-basic python python-for-s60 Open Programming Language (OPL) is an embedded programming language for portable devices that run the Symbian Operating System. 2004 18 22 100 832032 Psion PLC 111 0 15 text http://www.rosettacode.org/wiki/Category:OPL United Kingdom "PROC test: dINIT ""Your Challenge"" dTEXT """",""Will your answer to this question be no?"" dBUTTONS ""Yes"",%y,""No"",%n IF DIALOG=%y PRINT ""No it wasn't!"" ELSE PRINT ""Yes it was!"" ENDIF GET ENDP" https://en.wikipedia.org/wiki/Open_Programming_Language 6 0 OPL opl-dev.sourceforge.net 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 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 vcpkg-pm Vcpkg 2016 9 packageManager 0 2023.12.12 1299 0 17 22123 false 0 https://github.com/microsoft/vcpkg packageManager 2016 2024 2016 434 6202 22468 1218 false 2016 2025 24623 2583 12165 90 555194 Vcpkg helps you manage C and C++ libraries on Windows, Linux and MacOS. This tool and ecosystem are constantly evolving; your involvement is vital to its success! Vcpkg helps you manage C and C++ libraries on Windows, Linux and MacOS. This tool and ecosystem are constantly evolving; your involvement is vital to its success! Vcpkg helps you manage C and C++ libraries on Windows, Linux and MacOS. This tool and ecosystem are constantly evolving; your involvement is vital to its success! json cmake diff powershell markdown yaml bourne-shell python xml bash cpp make c perl nix dockerfile z-shell true 43658 0 26 false 2023 false https://github.com/microsoft/vcpkg 0 0 fun Fun 2010 Marcus Westin 13 pl http://marcuswest.in/essays/fun-intro/ 0 1300 1 8 22122 true 0 https://github.com/marcuswestin/fun pl 2010 2023 5 9 174 4 false 2010 2023 1182 3 68 5 7122 A programming language for the realtime web. A programming language for the realtime web. http://marcuswest.in/ A programming language for the realtime web. standard-ml javascript css markdown json html make yaml true 206 0 21 1 false United States "// Fun code let user = Session.User let myTasks = Query({ type: ""task"", owner: user.id })
""Hello "" user.name "", these are your tasks matey:""
for (task in myTasks) {
if (task.completed) { ""Completed!"" } else { }
} let markComplete = handler(task) { task.completed = true }
""Create a new task""

Hello World

BoBlog

Bob's Blog

Halloween

New Rails Templating Engine

We have wonderful products!

{{ product.title }}

A dialogue

<%= user.name %>

There seems to be a problem

<->

{{msg}}

{ string($act/TITLE) }

H2_COUNT. $1

1. First Section

2. Second Section

3. Conclusion

Workers

Hello, world

Hello, web!

Hello {name}!

Hello ${name}!

{$name}

Wow, so many!

My tasks

My CD Collection

{{title}}

{{title}}

<%= @header %>

News Feed's

Listing Books

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

""Create a new task""

Error ""} + obj.status + "" "" + obj.response + {""

Guru Meditation:

Job server	IP	File descriptor	Client ID	Functions
{{ server_info['hostport'][0] }}:{{ server_info['hostport'][1] }}	{%- if server_info['failed'] -%} Not responding! {%- endif -%}
	{{ worker['ip'] }}	{{ worker['file_descriptor'] }}	{{ worker['client_id'] }}	{{ worker['tasks']\|join(', ') }}