plclub / cis670-16faView external linksLinks
Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016
☆42Oct 25, 2022Updated 3 years ago
Alternatives and similar repositories for cis670-16fa
Users that are interested in cis670-16fa are comparing it to the libraries listed below
Sorting:
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20May 10, 2017Updated 8 years ago
- ☆17May 10, 2017Updated 8 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- JVM Abstracting Abstract Machine☆25Jan 29, 2019Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- The Penn Locally Nameless Metatheory Library☆75Mar 26, 2025Updated 10 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- A Haskell parser for JVM bytecode files☆39Jan 12, 2024Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- being the lecture materials and exercises for the 2016/17 session of Advanced Functional Programming at Strathclyde☆13May 9, 2017Updated 8 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- List of ICFP'13 accepted papers, with links to preprint or additional information when available☆72Jul 24, 2016Updated 9 years ago
- Mindless, verified (erasably) coding using dependent types☆104Dec 17, 2015Updated 10 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- http://www.cse.chalmers.se/edu/course/afp/☆16Dec 1, 2015Updated 10 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- Link to preprints for POPL'17 and co-located events☆100Mar 15, 2017Updated 8 years ago
- Experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for LambdaJS and a subset of Scheme pro…☆30Nov 24, 2015Updated 10 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated 2 weeks ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Coq formalizations of functional languages.☆145Jul 2, 2020Updated 5 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Canopy blog data that powers ICFP liveblog☆16Nov 2, 2016Updated 9 years ago
- A curated list of awesome Coq frameworks, libraries and software.☆233Feb 5, 2026Updated last week
- Literature review of GHC's Core language, System FC☆67Jun 27, 2018Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Feb 7, 2016Updated 10 years ago
- ☆48Jul 5, 2019Updated 6 years ago