plclub / cis6700-23sp
CIS 6700, Spring 2023
☆17Updated last year
Alternatives and similar repositories for cis6700-23sp:
Users that are interested in cis6700-23sp are comparing it to the libraries listed below
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆22Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 10 months ago
- a proof-of-concept programming language based on Call-by-push-value☆53Updated last month
- The Penn Locally Nameless Metatheory Library☆74Updated 7 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆81Updated 3 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- A deterministic parser with fused lexing☆72Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- PL conference deadline countdowns☆54Updated this week
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- A monadic library for symbolic evaluation☆58Updated last week
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆74Updated 2 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated this week
- Benchmarking various normalization algorithms for the lambda calculus☆44Updated 2 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 6 months ago
- ☆47Updated 2 months ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Coq plugin embedding elpi☆142Updated this week
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 11 months ago
- Mechanizations of Type Theories☆28Updated last month