Discover jonsterling/sml-zipper Open Source project

A minimal Github client for iOS. No longer actively developed.

109

Githood

Objective-C

dreamtt

A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.

My mathematical Zettelkasten, created using forester.

forest

Shell

agda-calf

A cost-aware logical framework, embedded in Agda.

A mini-book on category theory. Superseded by https://github.com/jonsterling/forest

math

ocaml-forester

Mirror of ocaml-forester

A Taskwarrior client. This was created to fill my own need: feel free to modify it! If it looks really ugly, you probably have your terminal configured wrong.

Tasky

Python

Lens.hpp

Functional Lenses in C++

C++

coq-guarded-computational-type-theory

A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.

latex-dieudonne

A self-contained implementation of forward and backward inference for intuitionistic propositional logic

lcf-sequent-calculus-example

An example of ReactiveFormlets use in the MVVM style

RAFExamples

Objective-C

coq-domains

agda-synthetic-domain-theory

secret project

Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.

agda-stc

Type safe abstract binding trees for Haskell, using Vinyl

hs-abt

Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees

sml-modernized-algol

An abstract machine using indexed containers and their zippers

agda-zipper-machine

Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought

sml-logical-framework

I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.

constructive-sheaf-semantics

A quick & dirty Yesod-based local web interface to TaskWarrior

TaskWarriorWeb

Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -> nat) in System T.

agda-effectful-forcing

An experimental type theory with scoped equality reflection, and non-arbitrary proof search. This is basically a pared down version of Andromeda/Brazil, but with untyped reduction and a more Nuprl-like feel. Computational content of proofs is got via a realizability-based extraction. (Note: substitution is unsafe here, not because of a problem with the theory, but because I didn't understand how Bound works sadly.)

TT-Reflection

topos-theory-notes

Experiments with synthetic guarded domain theory in Lean 4.

lean4-sgdt

Lean

itt-bidirectional

A bidirectional type checker for intensional constructive type theory (with thanks to Stephanie Weirich).

Hypertext translations of some classic mathematical papers into English

math-translations

some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson

agda-brouwerian-mathematics

Abstract binding trees in Agda

agda-abt

lecture-notes

A case-study in effects-and-handlers for bubbling out configurations from the interior of programs that typeset text.

effectful-typesetting

translations of brouwer's writings; corrections from native speakers welcome!

brouwer-translations

Read at your own risk! Not everything in here is guaranteed to be correct.

mathematical-notebook

agda-bar-induction

coq-algebra

coq-sgdt

Agda-Sheaves

Sheaves in Agda (will be superseded by https://github.com/jonsterling/constructive-sheaf-semantics which has sheaves on a site)

agda-nominal-sets

coq-meaning-explanation

An experiment with nominal features in a programming language

sml-pronominal-ml

Open-ended computation for when you need it (open recursion)

hs-monad-open

normalization by evaluation for MLTT in twelf

twelf-nbe

ocaml-modular-typechecking

Modular type checking using open types

guarded-theories

A library for Brouwerian data structures (spreads, fans, choice sequences)

sml-spreads

A general-purpose library for LCF+validations refiners

purescript-lcf

PureScript

stlc-type-inference

bar-induction-slides

Grit: the kernel around which a PRL forms

racket-grit

Racket

agda-directed-plump-ordering

agda-sheaf-semantics

here we go again

A possibly-wrong implementation of OTT (a fork of pi-forall)

Luitzen

(intrinsically typed) ABTs for OCaml

ocaml-abt

just learning to use lean

lean-syntax

Lean

tt-singletons

experiments with singleton types & identity types in type theory

modular development of intensional type theory in twelf

twelf-itt

latex-diagrams

An extension of Paul Taylor's excellent diagrams package with an improved default arrow head, using METAFONT

An example of how to use LCF + validations to type check and normalize lambda terms (via cut admissibility)

sml-elaborating-typechecker

latex3-jmsdelim

A DSL for scripting Tmux in Haskell. [BTW, this doesn't really work. Sorry!]

Tmux-Haskell

coq-synthetic-realizability

Some experiments

Formalizing some basic commutative algebra in Coq in order to procrastinate on my thesis proposal and paper reviews.

coq-algebra-experiments

Bindings for DynamoDb Streams

hs-aws-dynamodb-streams

Coq-Up

A tarpit in Coq

Abstract binding trees for purescript

purescript-abt

PureScript

bibtex-references

choice-sequences

ITT 1979 in Twelf (à la Constructive Mathematics and Computer Programming)

twelf-cmcp

intuitionistic completeness of first order logic à la Constable & Bickford

sml-ifol-completeness

A processor for Literate Haskell, inspired by Docco. Uses Pandoc, Highlighting-Kate, BlazeHtml and Shakespearean templates.

Lithos

coq-presheaf-cwf

Makefile

agda-cubical-sets

open-ended data types in standard ml (i.e. the ultimate benign effect)

sml-open-ended

My TeXmacs configuration files

.TeXmacs-progs

Scheme

CCG-Framework

A framework for testing multi-modal CCG constructions

agda-groupoids

Groupoids in Agda with no postulates (by Darin Morrison)

Kripke's Schema as a computational effect

sml-kripke-schema

some very sad notes for a very sad class

systems-study-notes

Constructive witness to completeness of realizability interpretation for IPL, using exceptions. Based on an idea from Mark Bickford and Bob Constable

sml-ipl-completeness

This is the CMU ABT library, with some minor improvements. DEPRECATED in favor of https://github.com/JonPRL/sml-typed-abts

sml-abt

experiments with higher dimensional partial equivalence relations for mixing exact equality with fibrant equality

higher-dimensional-pers

Demonstration of meaning explanations in agda

agda-meaning-explanations

A parser library for ABTs based on parcom. DEPRECATED in favor of https://github.com/jonsterling/sml-typed-abts

LaTeX-Macros

My personal macros

coq-cbpv

Makefile

sml-abt-parser

An Agda proof of Diaconescu's Theorem for Constructive Type Theory using Setoids

Diaconescu-TT

A package to support combining ebproof with mathpartir

latex-ebproof-rules

burnt-offering-secrets

HTML

sml-nominal-sets

a model of MLTT over the Baire spread

agda-mltt-forcing

An experimental nameserver written in C0

c0ns

An open-ended operator structure for abts

sml-open-abt

Adding GHC type literal promotion to http://www.cis.upenn.edu/~eir/packages/singletons/. There are trade-offs.

singletons

An in-progress port of LambdaPi to Standard ML

music

LilyPond

lambdapi

A fork of Stephanie Weirich's pi-forall, which does away with the parametric quantifier (not my research question) and adds equality reflection

ETT-Lite