euschn / ingpu
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:
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Macro Lambda Calculus☆49Updated 6 years ago
- ☆35Updated 6 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated 11 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- a self-hosting lambda calculus compiler☆35Updated last month
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- An extended typed Lambda Calculus☆21Updated 9 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Absal ex☆57Updated last year
- SC Mini is a "minimal" positive supercompiler☆47Updated 4 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Pure Type Systems for Functional Programming☆11Updated 10 years ago
- An implementation of interaction nets as a forth-like language.☆33Updated this week
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago