SoftwareFoundationGroupAtKyotoU / SystemFgLinks
Implementation of Polymorphic Gradual Typing
☆12Updated 7 years ago
Alternatives and similar repositories for SystemFg
Users that are interested in SystemFg are comparing it to the libraries listed below
Sorting:
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- A monadic library for symbolic evaluation☆69Updated 3 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated this week
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- Logical Relation for MLTT in Coq☆27Updated last month
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- Certified Machine Learning☆41Updated 4 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated last week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A style guide for Coq☆18Updated 3 years ago
- A cyclic theorem prover framework.☆32Updated last month
- Examples from our paper "Capturing the Future by Replaying the Past"☆22Updated last year
- The Penn Locally Nameless Metatheory Library☆76Updated 6 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated last year
- A cost-aware logical framework, embedded in Agda.☆67Updated last week
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Materials for OPLSS 2021☆11Updated 4 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- mirror of A simple type-theoretic language: Mini-TT☆40Updated 8 years ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- ☆16Updated 3 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆47Updated 7 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Constructive Galois connections☆36Updated 7 years ago