euschn / ingpu
GPU-based interaction nets evaluator
☆15Updated 12 years ago
Related projects ⓘ
Alternatives and complementary repositories for ingpu
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Fωμ type checker and compiler☆51Updated last year
- An extended typed Lambda Calculus☆20Updated 3 months ago
- Macro Lambda Calculus☆45Updated 5 years ago
- ☆36Updated 6 years ago
- A Lean 4 library for iterators.☆11Updated 11 months ago
- Demo for dependent types + runtime code generation☆48Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Specification of the Formality proof and programming language☆40Updated last year
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- Specification of the Cedille Core language☆29Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated last year
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated 11 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Two-Level Type Theory☆27Updated 4 years ago
- A parser for ANSI C, in Lean4.☆20Updated last year
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- ☆36Updated 3 years ago
- Algebraic proof discovery in Agda☆32Updated 2 years ago