engboris / stellogenLinks
An experimental unification-based programming language with logic-agnostic types, based on Girard's transcendental syntax
☆113Updated 2 months ago
Alternatives and similar repositories for stellogen
Users that are interested in stellogen are comparing it to the libraries listed below
Sorting:
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆177Updated 4 years ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆116Updated this week
- Turnstyle is a graphical esoteric programming language based on lambda calculus☆81Updated this week
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- A graphical interactive proof assistant designed for education☆169Updated 10 months ago
- A minimal proof checker.☆75Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆77Updated 8 years ago
- Forge: A Tool and Language for Teaching Formal Methods☆89Updated 2 months ago
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated 3 weeks ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- The cuteness implementation of a dependently typed language.☆193Updated 2 years ago
- an implementation of stuck macros☆145Updated last week
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 3 months ago
- The Makam Metalanguage☆199Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 2 months ago
- Staged compilation with dependent types☆182Updated 4 months ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- ☆119Updated last year
- Selected Papers of Dana S. Scott☆163Updated last year
- ☆37Updated last year
- Pure functional programming with whole-program mutability inference☆75Updated 2 months ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- ☆64Updated 3 years ago
- Programming with pure lambda calculus☆121Updated this week
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 7 months ago
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆64Updated 11 months ago