AndyShiue / Ende-readmeLinks
Ende is a hypothetical programming language.
☆23Updated 5 years ago
Alternatives and similar repositories for Ende-readme
Users that are interested in Ende-readme are comparing it to the libraries listed below
Sorting:
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- An idris backend compiling to chez scheme☆48Updated 8 years ago
- The LVish Haskell library☆80Updated 3 years ago
- A series of implementations of a simple functional programming language.☆30Updated 9 years ago
- Epic - a Supercombinator Compiler☆64Updated 10 years ago
- xmonad in Coq☆46Updated 13 years ago
- LINear LaNGuage: Type Theory and Process Calculi for Distributed and High-precision programming☆108Updated 2 years ago
- A programming language that runs in Haskell's type system.☆256Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Generic implementation of different CFA families based on monadic decomposition☆23Updated 12 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆123Updated 3 years ago
- Standard ML compiler based on typed intermediate languages.☆50Updated 11 years ago
- ☆62Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Link to preprints for POPL'17 and co-located events☆101Updated 8 years ago
- implementation of Pure Type Systems (PTS) in Rust.☆51Updated 8 years ago
- A fork of jhc. And also a Haskell compiler.☆134Updated 6 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Updated last year
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Higher-order optimization library☆76Updated 2 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Type provider library for Idris☆95Updated 8 years ago
- A small implementation of type inference☆80Updated 10 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆68Updated 2 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- A hip inductive theorem prover!☆90Updated 4 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 10 years ago
- being the materials for CS410 Advanced Functional Programming in the 2014-15 session☆71Updated 10 years ago