All Projects → WhatisRT → meta-cedille

WhatisRT / meta-cedille

Licence: MIT license
Minimalistic dependent type theory with syntactic metaprogramming

Programming Languages

Agda
84 projects
Nix
1067 projects
emacs lisp
2029 projects

Projects that are alternatives of or similar to meta-cedille

Mikrokosmos
(λ) Educational lambda calculus interpreter
Stars: ✭ 50 (+25%)
Mutual labels:  lambda-calculus
Elsa
Elsa is a lambda calculus evaluator
Stars: ✭ 135 (+237.5%)
Mutual labels:  lambda-calculus
gidti
Book: Gentle Introduction to Dependent Types with Idris
Stars: ✭ 70 (+75%)
Mutual labels:  lambda-calculus
Formality Javascript
An implementation of the Formality language in JavaScript
Stars: ✭ 71 (+77.5%)
Mutual labels:  lambda-calculus
Iron
Coq formalizations of functional languages.
Stars: ✭ 114 (+185%)
Mutual labels:  lambda-calculus
StepULC
Efficient and single-steppable ULC evaluation algorithm
Stars: ✭ 15 (-62.5%)
Mutual labels:  lambda-calculus
Pts
implementation of Pure Type Systems (PTS) in Rust.
Stars: ✭ 41 (+2.5%)
Mutual labels:  lambda-calculus
pomagma
An inference engine for extensional untyped λ-calculus
Stars: ✭ 15 (-62.5%)
Mutual labels:  lambda-calculus
Kind
A modern proof language
Stars: ✭ 2,075 (+5087.5%)
Mutual labels:  lambda-calculus
lambda-zero
A minimalist pure lazy functional programming language
Stars: ✭ 65 (+62.5%)
Mutual labels:  lambda-calculus
Church
⛪️ Church Encoding in JS
Stars: ✭ 107 (+167.5%)
Mutual labels:  lambda-calculus
Combinators Js
🐦 Some combinators
Stars: ✭ 114 (+185%)
Mutual labels:  lambda-calculus
BOHM1.1
Bologna Optimal Higher-Order Machine, Version 1.1
Stars: ✭ 45 (+12.5%)
Mutual labels:  lambda-calculus
Lambda
Fun with λ calculus!
Stars: ✭ 65 (+62.5%)
Mutual labels:  lambda-calculus
abella
An interactive theorem prover based on lambda-tree syntax
Stars: ✭ 81 (+102.5%)
Mutual labels:  lambda-calculus
Lambda calculus
A simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust
Stars: ✭ 46 (+15%)
Mutual labels:  lambda-calculus
Curryhoward
Automatic code generation for Scala functions and expressions via the Curry-Howard isomorphism
Stars: ✭ 229 (+472.5%)
Mutual labels:  lambda-calculus
universe-of-syntax
A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with all the proofs you could possibly need.
Stars: ✭ 16 (-60%)
Mutual labels:  lambda-calculus
lambda-notebook
Lambda Notebook: Formal Semantics in Jupyter
Stars: ✭ 16 (-60%)
Mutual labels:  lambda-calculus
js-church-encoding
Church Encoding Implementation in JavaScript
Stars: ✭ 33 (-17.5%)
Mutual labels:  lambda-calculus

Meta Cedille

This is the reference implementation for a version of cedille that supports metaprogramming. The wiki and blog contain some information and documentation.

Building

  • Manually

Agda 2.6.2, the Agda standard library (version 1.7) and bytestring-trie (the Haskell library) are required. If those are setup correctly, just use the makefile. If you are using stack, you can also try make stack (this will not install Agda and the Agda standard library for you though).

  • Using Nix

If you use nix, simply use nix-build.

Running the current tests/examples

The file test/Test.mced contains the current tests. Run ./meta-cedille --load test/Test to execute all current tests. Alternatively, run run_tests.sh (which doesn’t spawn a repl).

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].