CafeOBJ / cafeobj
Development of the CafeOBJ interpreter
☆32Updated last month
Related projects ⓘ
Alternatives and complementary repositories for cafeobj
- Template Haskell Implementation of Egison Pattern Matching☆32Updated 4 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 3 years ago
- An interpreter of Hagino's Categorical Programming Language (CPL).☆115Updated 5 months ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- Minimal Haskell Compiler☆63Updated 6 years ago
- HoTT in Japanese☆33Updated last year
- Monadic effects and equational reasonig in Coq☆68Updated 2 weeks ago
- LMNtal Compiler☆19Updated 7 months ago
- Haskell User's Gofer System☆22Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆44Updated 8 years ago
- A cyclic theorem prover framework.☆31Updated last week
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆53Updated 5 months ago
- Repository and Wiki for enriching the Standard ML Basis Library☆60Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆120Updated 2 years ago
- HoTT in Lean 3☆75Updated 4 years ago
- ATS2: Unleashing the Potentials of Types and Templates☆41Updated 4 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆27Updated last year
- Standard ML compiler based on typed intermediate languages.☆46Updated 10 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆34Updated 7 years ago
- ☆80Updated 6 months ago
- super tiny implementation of higher-order logic proof assistant in lean☆21Updated 5 years ago
- A Lisp implementation in which a lot of language features are self-definable.☆18Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- SML# compiler☆218Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- αProlog☆17Updated last year
- An interactive theorem prover based on lambda-tree syntax☆90Updated 3 weeks ago
- An automatic theorem prover for first order logic with equality☆30Updated 4 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- The Definition of Standard ML, Revised (1997)☆113Updated 7 years ago