Alternatives and similar repositories for Prowl-Ideas-Pile

Users that are interested in Prowl-Ideas-Pile are comparing it to the libraries listed below

• UberPyro / prowl
  WIP stack language that uses regex for control flow
  ☆42Updated 2 years ago
• robertkleffner / wort
  A core concatenative programming language with variables and first-rank polymorphic type inference
  ☆31Updated 5 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 7 months ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated this week
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 5 years ago
• glossopoeia / boba
  A general purpose statically-typed concatenative programming language.
  ☆55Updated 2 years ago
• trith / trith
  A concatenative programming language founded on the unholy trinity of Forth, Lisp and RDF triples.
  ☆70Updated 14 years ago
• joes-esolangs / barrel
  An esoteric RPN golfing language
  ☆24Updated 3 years ago
• catseye / Vinegar
  MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail
  ☆15Updated 2 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆31Updated 8 years ago
• acorrenson / owl
  A mini language for logic programming
  ☆23Updated 5 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 11 months ago
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆60Updated 6 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆65Updated last week
• camllight / camllight
  The Caml Light implementation of the Caml language
  ☆67Updated 2 years ago
• Superstar64 / aith
  [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…
  ☆71Updated last year
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• xieyuheng / inet-forth
  An implementation of interaction nets as a forth-like language.
  ☆36Updated 2 weeks ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆42Updated 6 years ago
• joom / dilim
  A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.
  ☆16Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated 9 months ago
• SaberVM / FVM
  The Functional Virtual Machine.
  ☆14Updated 11 months ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆48Updated 11 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• strictly-lang / compiler
  strictly is a declarative programming language for interactive web-components
  ☆10Updated last year
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year