Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016
☆42Oct 25, 2022Updated 4 years ago
Alternatives and similar repositories for cis670-16fa
Users that are interested in cis670-16fa are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 9 years ago
- ☆16May 10, 2017Updated 9 years ago
- a version of the 2048 game for Coq☆22Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 9 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 4 years ago
- ☆11Jul 20, 2016Updated 10 years ago
- JVM Abstracting Abstract Machine☆26Jan 29, 2019Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆33Oct 22, 2024Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆80Mar 26, 2025Updated last year
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆20Sep 27, 2021Updated 5 years ago
- Writeup that goes along with this:☆41Jan 18, 2018Updated 8 years ago
- Propositional logic tools, inspired by the Coq standard library.☆10Dec 19, 2017Updated 8 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- Simplified Observational Type Theory☆93Feb 17, 2026Updated 8 months ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 7 years ago
- being the lecture materials and exercises for the 2016/17 session of Advanced Functional Programming at Strathclyde☆13May 9, 2017Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 5 years ago
- Link to preprints for POPL'17 and co-located events☆100Mar 15, 2017Updated 9 years ago
- Shared Cheat Sheet for Coq☆10Sep 8, 2016Updated 10 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 9 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 9 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- http://www.cse.chalmers.se/edu/course/afp/☆16Dec 1, 2015Updated 10 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Feb 5, 2025Updated last year
- second-order abstract syntax☆31Sep 15, 2021Updated 5 years ago
- A function definition package for Rocq☆238Updated this week
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 10 years ago
- Experiments in formalizing refinement type systems in Coq☆18Feb 7, 2016Updated 10 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74May 7, 2018Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆25May 27, 2015Updated 11 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- A Coq library for parametric coinduction☆57Apr 29, 2026Updated 6 months ago
- Introduction to algebraic effects and handlers☆100Jul 21, 2018Updated 8 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35May 14, 2017Updated 9 years ago
- ☆11Apr 19, 2019Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 9 years ago
- Get a GUI fast in any language under the sea!☆48Jan 31, 2023Updated 3 years ago
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆169Jul 11, 2026Updated 3 months ago