euschn / ingpu
GPU-based interaction nets evaluator
☆15Updated 13 years ago
Alternatives and similar repositories for ingpu:
Users that are interested in ingpu are comparing it to the libraries listed below
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- Macro Lambda Calculus☆45Updated 5 years ago
- ☆35Updated 6 years ago
- A Lean 4 library for iterators.☆11Updated last year
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated 11 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Demo for dependent types + runtime code generation☆64Updated last month
- A toy dependent typed language.☆24Updated this week
- Two-Level Type Theory☆28Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆55Updated 8 months ago
- Fωμ type checker and compiler☆52Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated last year
- LL(1) parser generator verified in Coq☆45Updated 4 years ago
- Absal ex☆56Updated last year
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 7 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆81Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago