khayyamsaleem / gradual-typing
an implementation of gradual typing in mit-scheme
☆9Updated 3 years ago
Alternatives and similar repositories for gradual-typing:
Users that are interested in gradual-typing are comparing it to the libraries listed below
- A scheme port of the Haskell code from "A Tutorial Implementation of a Dependently Typed Lambda Calculus"☆8Updated 10 years ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 3 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- A very little language☆16Updated last year
- ☆21Updated 4 years ago
- A metalanguage for creating sophisticated DSLs in Racket.☆30Updated this week
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Ubuntu PPA for Racket (based on the upstream in Debian at https://salsa.debian.org/bremner/racket). Check the Launchpad page for details …☆10Updated 2 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 11 months ago
- ☆16Updated 10 months ago
- ☆34Updated 3 weeks ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 6 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- ☆12Updated last year
- Sound and efficient gradual typing via contract verification.☆20Updated last year
- A TODO list feature for DrRacket, like to Agda's goal list but for any language.☆33Updated last year
- A meta-language for adding Clojure-style shorthand function literals to arbitrary Racket languages.☆17Updated 8 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆57Updated 9 months ago
- A prototype of soft contract verification for an untyped functional language☆34Updated 3 years ago
- For supporting template-based programming☆21Updated 4 years ago
- Nominal logic programming extensions to miniKanren, based on alphaProlog.☆25Updated 11 years ago
- A Scala-style magic function application form☆43Updated 2 years ago
- dependently-typed lisp with flexible compiler backends☆28Updated 5 years ago
- Library classes for the Twelf Proof System☆21Updated 4 years ago
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- ☆10Updated 9 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago