Scraps

A collection of random snippets and scraps of mostly Agda, Rocq, Idris, and Lean files.

Inconsistencies

• Hurkens.idr: An "implementation" of Hurkens' paradox relying on Type: Type. As Idris 2 currently does not have cumulative universes yet, type checking this file will not terminate!
• HurkensLower.agda: Another "implementation" of Hurkens' paradox, but instead of just using the --type-in-type flag, it uses an impredicative record with unrestricted elimination implemented using rewrite rules. Type checking with this implementation does terminate, but with the flag set and the actual record does not.
• Hurkens: Yet another "implementation" of Hurkens' paradox, using universe polymorphism to try to get it to type check as far as possible.
• Berardi: An adaptation of the inconsistency arising from excluded middle, impredicativity, and large elimination of (small) impredicatives from Proof-irrelevance out of excluded-middle and choice in the calculus of constructions. Crucially, EM and impredicativity alone imply proof irrelevance, while proof irrelevance is directly inconsistent with large elimination.
• StrictPositivity: An adaptation of this proof that non-strictly positive inductive types with an impredicative universe is inconsistent.
• NestedPositivity.lean: Showing that if you don't respect nested positivity, you can derive False using impredicative Prop.
• SizedFalse.agda: A few short proofs of false using sized types.
• CoquandGirard.agda: Abandoned attempt at mechanizing Girard's original paradox as described by Coquand.
• Trees: Coquand's Paradox of Trees, an inductive flavour of Burali-Forti's paradox.
• PropImpred.lean: Not an inconsistency, but a reproduction of the proof in this paper that impredicativity with some form of computing proof-irrelevance yields non-normalization.

Propositional Equality

• Snipe: A partial proof of the problem given here (and in this Tweet). Snipe.idr uses pattern-matching on Refl, while SnipeJ.idr avoids this using the J eliminator.
• Hedberg.idr: A proof of Hedberg's theorem, that types with decidable equality satisfy UIP.
• Hedberg.agda: Two proofs of Hedberg's theorem, one via a reflexive mere relation implying equality and another via a constant endofunction on equalities (path collapsibility).
• Equality.agda: Implementing propositional equality from scratch using rewrite rules (see Notes on Propositional Equality).
• DIP.ced: Demonstration that Cedille refutes UIP due to the Kleene trick.
• ObsEq.agda: An attempt at encoding observational equality à la Tarski as recursion over codes.

Ordinals and Sizes

• Ordinals.idr: A construction of some large ordinals following Ordinals in Type Theory.
• Ordinals.ced: The generalization of ordinal trees in an impredicative setting is not well-founded.
• Ordinals.agda: As above, but with an explicit proof of falsehood.
• GenericOrd.agda: An attempt at defining some sort of type-level Ord using Practical Generic Programming.
• Sized.agda: Examples of sized types used in How to Use Sized Types? Let Me Count the Ways.

Guarded Types and Coinduction

• Guardedness.agda: Some examples of coprograms that don't pass productivity checking.
• Guarded.agda: Some examples using Agda's Guarded Type Theory support.
• Clocked.agda: Coinductive types à la Clocked Type Theory via Agda's support for guarded types, using a postulated forcing tick which Agda doesn't like :(

Models

• DeBruijn.idr: Syntax and typing of a simple dependently-typed language using de Bruijn indices. A context well-formedness judgement appears to be missing.
• Autophagy.agda: Intrinsically-typed syntax for type theory following Type Theory Should Eat Itself.
• IndInd.agda: An attempt at encoding an inductive–inductive type in Agda as a mutual indexed type; there appears to be a problem with the elimination principle. (See Constructing Inductive-Inductive Types via Type Erasure.)
• Desc.agda: Encoding inductives as fixpoints of descriptions. This is from someone's blog post but I can't find it.
• Kipling.agda: The Kipling embedding from Outrageous but Meaningful Coincidences.
• CwF.agda, CwFModel.agda: A definition of a category with families in Agda, complete with equalities that must be satisfied, and a model using induction–recursion to define type encodings.
• Universes.lagda.md: Various ways to model a universe hierarchy.
• StraTT.agda: A model of the universes of stratified type theory with explicit universe levels. The actual structures for the types are excluded because working with accessibility predicates is too messy.
• SystemF.agda: A reproduction of the model (i.e. interpreter) of Stratified System F from Towards Tagless Interpretation of System F, extended with a parametricity theorem.
• VeryDependent.agda: Attempting to use Agda issue #1556 to implement intrinsically-typed syntax, but blocked on renaming.

Programs

• Interlude: A package containing additional definitions for convenience, mostly stolen from Haskell's base package.
• IncrementalCycles.idr: An implementation of an acyclic directed graph that can incrementally detect cycles as edges are added. This could be used to implement a type synthesis algorithm that can handle floating cumulative universes (i.e. universes not attached to some Type 0 at the bottom).
• TTT.rkt: A simple type theory that's a little more than CoC... but not by much.
• cedille.rkt: An abandoned Redex model of Cedille that never made it past syntax.
• hm.pl: An incomplete Prolog implementation of Hindley-Milner type inference.
• Dyna: Various recursion schemes, including histomorphisms and dynamorphisms.
• Fib.agda: The nth Fibonacci number via instance search of a data type encoding the recursive structure of computing them (for @braxtonhall).
• QS.agda: An attempt at formalizing the quicksort example from this Tweet originally found in Modelling General Recursion in Type Theory but failed at Step 3.

Miscellaneous Proofs

• Cedille.ced: A cheat sheet for Cedille; see the wiki page.
• CastTpEq.ced: The Cast and TpEq constructs used in various Cedille developments, also found in the core library.
• Mendler: Mendler-style encodings of (weak, strong) induction in Cedille.
• Injectivity.ced: An old attempt at proving injectivity of constructors in Cedille.