gidtiBook: Gentle Introduction to Dependent Types with Idris
Stars: ✭ 70 (+366.67%)
Ptsimplementation of Pure Type Systems (PTS) in Rust.
Stars: ✭ 41 (+173.33%)
Type-TheoryLecture note on Lambda Calculus and Types for FLOLAC
Stars: ✭ 26 (+73.33%)
lambda-calculusAn introduction to the Lambda Calculus
Stars: ✭ 59 (+293.33%)
Write You A HaskellBuilding a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
Stars: ✭ 3,064 (+20326.67%)
Formality JavascriptAn implementation of the Formality language in JavaScript
Stars: ✭ 71 (+373.33%)
saltThe compilation target that functional programmers always wanted.
Stars: ✭ 62 (+313.33%)
pyproverResolution theorem proving for predicate logic in pure Python.
Stars: ✭ 71 (+373.33%)
Aws Lambda WorkshopSome incremental examples suitable to host an AWS Lambda Functions workshop
Stars: ✭ 18 (+20%)
universe-of-syntaxA universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with all the proofs you could possibly need.
Stars: ✭ 16 (+6.67%)
Set-TheoryCoq encoding of ZFC and formalization of the textbook Elements of Set Theory
Stars: ✭ 55 (+266.67%)
Lambda🔮 Estudos obscuros de programação funcional
Stars: ✭ 297 (+1880%)
lambda-fibonacciImplementation of the Fibonacci sequence in JS using pure Lambda Calculus
Stars: ✭ 18 (+20%)
Mikrokosmos(λ) Educational lambda calculus interpreter
Stars: ✭ 50 (+233.33%)
LambdaCalculusPlaygroundAn Android app that provides a visual interface for creating and evaluating lambda calculus expressions
Stars: ✭ 16 (+6.67%)
lambda-zeroA minimalist pure lazy functional programming language
Stars: ✭ 65 (+333.33%)
system-FFormalization of the polymorphic lambda calculus and its parametricity theorem
Stars: ✭ 20 (+33.33%)
ZionA statically-typed strictly-evaluated garbage-collected readable programming language.
Stars: ✭ 33 (+120%)
LeanHomepage
Theorem Proving in Lean
FAQ
Stars: ✭ 2,006 (+13273.33%)
ElsaElsa is a lambda calculus evaluator
Stars: ✭ 135 (+800%)
HolCanonical sources for HOL4 theorem-proving system. Branch `develop` is where “mainline development” occurs; when `develop` passes our regression tests, `master` is merged forward to catch up.
Stars: ✭ 414 (+2660%)
coq jupyterJupyter kernel for Coq
Stars: ✭ 70 (+366.67%)
Lambda TalkA Flock of Functions: Combinators, Lambda Calculus, & Church Encodings in JS
Stars: ✭ 315 (+2000%)
CedilleCedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
Stars: ✭ 289 (+1826.67%)
BOHM1.1Bologna Optimal Higher-Order Machine, Version 1.1
Stars: ✭ 45 (+200%)
lplzooFine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck
Stars: ✭ 32 (+113.33%)
Church⛪️ Church Encoding in JS
Stars: ✭ 107 (+613.33%)
ATS-blockchain⛓️ Blockchain + Smart contracts from scratch
Stars: ✭ 18 (+20%)
planerPowerful Light Artificial NEuRon inference framework for CNN
Stars: ✭ 52 (+246.67%)
lunarflowLambda calculus go brrrr
Stars: ✭ 27 (+80%)
LambdaFun with λ calculus!
Stars: ✭ 65 (+333.33%)
Krivine-MachineAbstract krivine machine implementing call-by-name semantics. In OCaml.
Stars: ✭ 34 (+126.67%)
StepULCEfficient and single-steppable ULC evaluation algorithm
Stars: ✭ 15 (+0%)
lambdalambda calculus interpreter
Stars: ✭ 23 (+53.33%)
Lambda calculusA simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust
Stars: ✭ 46 (+206.67%)
vanilla-langAn implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
Stars: ✭ 73 (+386.67%)
abellaAn interactive theorem prover based on lambda-tree syntax
Stars: ✭ 81 (+440%)
lambdaMacro Lambda Calculus
Stars: ✭ 38 (+153.33%)
Ltextλtext - higher-order file applicator
Stars: ✭ 37 (+146.67%)
meta-cedilleMinimalistic dependent type theory with syntactic metaprogramming
Stars: ✭ 40 (+166.67%)
CurryhowardAutomatic code generation for Scala functions and expressions via the Curry-Howard isomorphism
Stars: ✭ 229 (+1426.67%)
FstarA Proof-oriented Programming Language
Stars: ✭ 2,171 (+14373.33%)
Dblib LinearFormalisation of the linear lambda calculus in Coq
Stars: ✭ 10 (-33.33%)
CoqCoq 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.
Stars: ✭ 3,566 (+23673.33%)
rusty-razorRazor is a tool for constructing finite models for first-order theories
Stars: ✭ 54 (+260%)
LinearOneLinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
Stars: ✭ 16 (+6.67%)
Fp Core.rsA library for functional programming in Rust
Stars: ✭ 772 (+5046.67%)
archsatA proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superposition and Rewriting.
Stars: ✭ 20 (+33.33%)
KindA modern proof language
Stars: ✭ 2,075 (+13733.33%)
lambda-notebookLambda Notebook: Formal Semantics in Jupyter
Stars: ✭ 16 (+6.67%)
PlamAn interpreter for learning and exploring pure λ-calculus
Stars: ✭ 385 (+2466.67%)
informatica-publicPublic code developed during my MSc study at University of Bologna
Stars: ✭ 79 (+426.67%)
IronCoq formalizations of functional languages.
Stars: ✭ 114 (+660%)