Type-Based Methods for Termination and Productivity in Coq
https://coq.inria.fr/files/coq5_submission_5.pdf
https://coq.inria.fr/files/coq5_submission_5.pdf
Integrating Dependent and Linear Types
https://www.cl.cam.ac.uk/~nk480/dlnl-paper.pdf
https://www.cl.cam.ac.uk/~nk480/dlnl-paper.pdf
A survey of compatibility logic
https://arxiv.org/abs/1612.04513
http://www.csc.villanova.edu/~japaridz/CL/
https://arxiv.org/abs/1612.04513
http://www.csc.villanova.edu/~japaridz/CL/
Strict Set (which Agda calls SSet) comes from 2-level type theory, see https://arxiv.org/pdf/1705.03307.pdf and https://arxiv.org/pdf/1604.03799.pdf)
https://arxiv.org/abs/2001.10490
Lean's approach to hygiene macros
Lean's approach to hygiene macros
A classical sequent calculus with dependent types
https://hal.archives-ouvertes.fr/hal-01744359/document
https://hal.archives-ouvertes.fr/hal-01744359/document
Introduction to Categories and Categorical Logic
https://arxiv.org/abs/1102.1313
https://arxiv.org/abs/1102.1313
Forwarded from Tony Xu
While we're still at it, I'd like to announce my project to formalize the Stacks project in Arend
75 Problems for Testing Automated Theorem Provers
http://www.sfu.ca/~jeffpell/papers/75ATPproblems86.pdf
http://www.sfu.ca/~jeffpell/papers/75ATPproblems86.pdf
Denotational Design with Typeclass Morphisms
http://conal.net/papers/type-class-morphisms/type-class-morphisms-long.pdf
http://conal.net/papers/type-class-morphisms/type-class-morphisms-long.pdf
Fast and Loose Reasoning is Morally Correct
https://www.cs.ox.ac.uk/jeremy.gibbons/publications/fast+loose.pdf
https://www.cs.ox.ac.uk/jeremy.gibbons/publications/fast+loose.pdf
Categorical Logic by Andrew M. Pitts https://www.cl.cam.ac.uk/~amp12/papers/catl/catl.pdf
Categories with Families: Unityped, Simply Typed, and Dependently Typed https://arxiv.org/abs/1904.00827
A Minimalistic Verified Bootstrapped Compiler
https://popl21.sigplan.org/details/CPP-2021/6/A-Minimalistic-Verified-Bootstrapped-Compiler-Proof-Pearl-
https://popl21.sigplan.org/details/CPP-2021/6/A-Minimalistic-Verified-Bootstrapped-Compiler-Proof-Pearl-
popl21.sigplan.org
A Minimalistic Verified Bootstrapped Compiler (Proof Pearl) (CPP 2021 - Certified Programs and Proofs) - POPL 2021
Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics…
Cubical Agda paper v2 with
https://staff.math.su.se/anders.mortberg/papers/cubicalagda2.pdf
transpX discussedhttps://staff.math.su.se/anders.mortberg/papers/cubicalagda2.pdf
RefinedC
Automating the Foundational Verification of C Code with Refined Ownership Types
https://plv.mpi-sws.org/refinedc/
Automating the Foundational Verification of C Code with Refined Ownership Types
https://plv.mpi-sws.org/refinedc/
Choosing is Losing:
How to combine the benefits of shallow and deep embeddings through reflection in dependently-typed host languages
https://arxiv.org/abs/2105.10819
How to combine the benefits of shallow and deep embeddings through reflection in dependently-typed host languages
https://arxiv.org/abs/2105.10819
Synthesis of Heap-Manipulating Programs from Separation Logic
https://gopiandcode.uk/logs/log-certified-synthesis.html
https://gopiandcode.uk/logs/log-certified-synthesis.html
gopiandcode.uk
Gopiandcode > logs > Goodbye C developers: The future of programming with certified program synthesis