d3scomp / NPRG014
Supplementary materials for the course of "Concepts of Modern Programming Languages" (NPRG014) taught at Charles University, Prague, Czech Republic.
☆24Updated 4 months ago
Alternatives and similar repositories for NPRG014:
Users that are interested in NPRG014 are comparing it to the libraries listed below
- Programming in the C language course materials☆11Updated last week
- A community around PL at Prague.☆18Updated 4 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 this week
- Learn Lean and topology☆21Updated last year
- This was a fork of Checked C used from 2021-2024. The changes have been merged into the original Checked C repo.☆26Updated 6 months ago
- Rough and Ready Haskell Notebooks with HLS and VS Code☆48Updated 2 years ago
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- A toy dependent typed language.☆28Updated this week
- Probabilistic Functional Logic Programming☆16Updated last month
- GitHub Action to run arbitrary commands in a TeXLive environment☆103Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆50Updated 3 weeks ago
- A small logic programming language.☆16Updated 11 months ago
- The glitch-soc/Mastodon fork running on types.pl☆22Updated last month
- A book about functional programming in Lean☆39Updated last year
- This project is about formally verifying Seymour's decomposition theorem for regular matroids.☆22Updated last week
- Invert (transpose) a GFM Markdown Table☆12Updated last year
- IDE support for the functional logic programming language Curry☆31Updated last month
- VSCode extension for Metamath☆10Updated last month
- 🩺 A library for compiler diagnostics☆44Updated 2 months ago
- Functional Programming in Lean☆78Updated this week
- Binary rational numbers in Coq [maintainer=@herbelin]☆14Updated last year
- Correctness proof of the Huffman coding algorithm in Coq [maintainer=@palmskog]☆14Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆27Updated 2 years ago
- ☆34Updated 5 months ago
- A Lean 4 formalization of partial combinatory algebras.☆13Updated 3 months ago
- Fir programming language☆40Updated this week
- Execute and document benchmarks reproducibly.☆90Updated 2 months ago
- A parser for ANSI C, in Lean4.☆20Updated last year
- ☆9Updated last year
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 11 months ago