d3scomp / NPRG014
Supplementary materials for the course of "Concepts of Modern Programming Languages" (NPRG014) taught at Charles University, Prague, Czech Republic.
☆24Updated last month
Alternatives and similar repositories for NPRG014:
Users that are interested in NPRG014 are comparing it to the libraries listed below
- A Python backed for Idris 2☆21Updated 2 months ago
- Python type hints are Turing complete.☆31Updated 2 years ago
- A Deductive Verification Tool for OCaml Programs☆67Updated 6 months ago
- GitHub Action to run arbitrary commands in a TeXLive environment☆93Updated 10 months ago
- Extra minimal TypeScript implementation of Hindley-Milner type inference☆28Updated 4 months ago
- An equational theorem prover based on Knuth-Bendix completion☆49Updated last month
- A community around PL at Prague.☆18Updated last month
- Sokoban (in Coq) [maintainer=@erikmd]☆21Updated 2 weeks ago
- Learn Lean and topology☆21Updated last year
- An implementation of "A Pretty Expressive Printer" in OCaml☆22Updated 10 months ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop …☆35Updated last month
- An overview of property-based testing functionality☆56Updated 7 months ago
- Invert (transpose) a GFM Markdown Table☆12Updated 10 months ago
- The SML/NJ project hosts the entire source code of the Standard ML of New Jersey system.☆29Updated 5 years ago
- ☆9Updated last year
- ☆25Updated last week
- Functional Programming in Lean☆73Updated 8 months ago
- Commutative diagrams with TikZ☆46Updated 2 years ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆29Updated this week
- The Steel separation logic library for F*☆32Updated this week
- VSCode extension for Metamath☆9Updated this week
- A verified compiler for a lazy functional language☆32Updated this week
- A (parametrized) Rust SAT solver originally based on MiniSat☆30Updated 7 months ago
- Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]☆14Updated last year
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆19Updated this week
- Accompanying materials for "A Core Calculus for Documents"☆31Updated last year
- Coq code formatter☆22Updated this week
- The Next Generation of Compositional Programming☆23Updated 3 weeks ago
- Using Haskell's type system to guarantee commutativity.☆18Updated 11 years ago
- ☆33Updated 2 months ago