Compilation and Verification of Data-Centric Languages
- verification
- query-language
- query-engine
- functional-programming
58,136 visible repositories in the index
97–120 of 140 · Most stars
Compilation and Verification of Data-Centric Languages
Common Lisp CFFI wrapper around the DuckDB C API
A blocking queue written in Elixir.
query language and terminal utility for querying and transforming Lisp, JSON and other text files. written in Common Lisp
🐝 A Highly Performant and easy to use goroutine pool for Go
A micro workers class that easily manages a pool of threads to optimise simultaneous jobs and jobs endings, for MicroPython (used on Pycom modules & ESP32)
Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.
A practical functional programming library for promises
Library for Classical Coq
XAsyncSockets is an efficient Python/MicroPython library of managed asynchronous sockets.
Simple implementation of the hungry-consumer model in Elixir
Rcpp Bindings to C++ parser for TOML files
The Thue programming language: Programming with grammars
Clojure library for Blueprints (part of the Tinkerpop graph stack).
Parseq is a library for Common Lisp used for parsing sequences such as strings and lists using parsing expression grammars.
A query library for retrieving part of JSON based on JSONPath syntax.
Elixir macro for extracting or transforming values inside a pipe flow.
Embeddable Forth interpreter written in Ada
A lock-free concurrent data structures library for Common Lisp.
Easy use of Microsoft DirectShow in Delphi for Win32 AND Win64
Command line tool for Bluetooth Low Energy MicroPython devices
High-performance network library for D programming language, event-driven asynchonous implemention(IOCP / kqueue / epoll).
Go option and result types that optionally contain a value
Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]