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:
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- a self-hosting lambda calculus compiler☆36Updated 4 months ago
- ☆35Updated 7 years ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆54Updated 5 months ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- An extended typed Lambda Calculus☆21Updated last year
- ☆36Updated 3 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- Macro Lambda Calculus☆49Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Absal ex☆58Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- SKI combinators☆55Updated 8 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Kempe is a compiled stack-based language☆58Updated 10 months ago
- Reference compiler for c0☆36Updated 2 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated 2 months ago