euschn / ingpuLinks
GPU-based interaction nets evaluator
☆16Updated 13 years ago
Alternatives and similar repositories for ingpu
Users that are interested in ingpu are comparing it to the libraries listed below
Sorting:
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 5 years ago
- ☆35Updated 7 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 3 weeks ago
- Macro Lambda Calculus☆50Updated 6 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- ☆37Updated last year
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- Absal ex☆58Updated 2 years ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 weeks ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- A toy dependent typed language.☆32Updated last week
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated last week
- A nano "theorem prover".☆62Updated 6 years ago
- An extended typed Lambda Calculus☆21Updated last year
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- A minimal proof checker.☆76Updated last year
- Lean type-checker written in Scala.☆38Updated 3 years ago