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☆75Updated 8 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- An extended typed Lambda Calculus☆21Updated last year
- Macro Lambda Calculus☆49Updated 6 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- ☆35Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated 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
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Kempe is a compiled stack-based language☆58Updated 11 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 2 weeks ago
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 5 years ago
- Reference compiler for c0☆36Updated 3 months ago
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A toy dependent typed language.☆32Updated this week
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆56Updated 3 weeks ago
- A dependently-typed, array-polymorphic language that runs on parallel architectures☆24Updated 11 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆44Updated 8 months ago