Barry-Jay / SFLinks
Coq implementation of SF-calculus and the tranlsation to it of lift lambda-calculus
☆11Updated 8 years ago
Alternatives and similar repositories for SF
Users that are interested in SF are comparing it to the libraries listed below
Sorting:
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- enumerative property-based testing for Haskell☆52Updated 2 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Paper and talk☆54Updated 2 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Austin's supercompiler work☆21Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- ☆32Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Type Your Matrices For Great Good☆29Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago