• Stars
    star
    2
  • Language
    TeX
  • Created about 9 years ago
  • Updated about 9 years ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Notes on a realizability model for a classical logic

More Repositories

1

learn-tt

A collection of resources for learning type theory and type theory adjacent fields.
1,913
star
2

higher-order-unification

A small implementation of higher-order unification
Haskell
165
star
3

pcf

A small compiler for PCF
Haskell
118
star
4

blott

An experimental type checker for a modal dependent type theory.
OCaml
110
star
5

nbe-for-mltt

Normalization by Evaluation for Martin-LΓΆf Type Theory
OCaml
107
star
6

hm

A small implementation of type inference
Standard ML
74
star
7

miniprl

A small implementation of a proof refinement logic.
Standard ML
49
star
8

wiki-summary.el

Get summaries of wikipedia articles in Emacs
Emacs Lisp
27
star
9

undergraduate-thesis

A discouraging story.
TeX
15
star
10

graph-models

Notes on P-omega
TeX
14
star
11

modal

Modal logic in Haskell through Static Pointers
Haskell
8
star
12

sml-fingertree

The ugliness is worth it, the ugliness is worth it, the ugliness...
Standard ML
8
star
13

cooked-pi

What if we built the same frustrating type checker over and over again? For science.
Haskell
7
star
14

independence-of-the-continuum-hypothesis

Some notes on the independence of the continuum hypothesis.
TeX
7
star
15

c-dsl

a dsl for generating C
Haskell
7
star
16

register-alloc

WIP - A little doodle of a register allocator with an explanation of how it works.
Haskell
6
star
17

fibrational-semantics

Notes on simple fibrational semantics.
TeX
6
star
18

hlf

an implementation of LF
Haskell
5
star
19

hi

A toy interpreter for Haskell
Haskell
5
star
20

sml-kanren

Let's make another miniKanren.
Standard ML
5
star
21

ds-kanren

a tiny logic programming language
Haskell
4
star
22

concurrent-stack-with-helping

A case study in Iris formalizing a concurrent stack with helping.
TeX
4
star
23

emacs.d

my emacs config
Emacs Lisp
3
star
24

secret-notes

Containing small notes which aren't original or noteworthy, but which I don't want to lose.
TeX
3
star
25

hasquito

a dysfunctional compiler to javascript
Haskell
3
star
26

blog

the source for jozefg.bitbucket.org
HTML
3
star
27

sml-abt-unify

Simple unification for ABTs in SML
Standard ML
3
star
28

a-short-talk-on-iris

The notes for a short talk given on Iris in a seminar on concurrent separation logic at Carnegie Mellon.
TeX
2
star
29

bound-gen

Making bound play nice with monad-gen.
Haskell
2
star
30

regex

an exercise in decision procedures in Agda
Agda
2
star
31

folds-common

A conglomeration of folds.
Haskell
2
star
32

ctt.elf

Probably wrong formalization of computational type theory in Twelf.
2
star
33

drafts

Drafts of posts for my blog
TeX
2
star
34

oplss

My notes from OPLSS and related pre-lecture-thingies
2
star
35

kripke

Modal logic and Kripke semantics in Twelf
2
star
36

hotc

Notes on higher-order typed compilation. Probably wrong
TeX
2
star
37

sml-higher-order-matching

A (probably broken) second order pattern matching
Standard ML
2
star
38

simple-abt

Nothing fancy, just binding without pain
Standard ML
2
star
39

generic-church

automatic church encodings
Haskell
2
star
40

monad-gen

a monad for fresh values
Haskell
2
star
41

f2js

A compiler in need of a better name
Haskell
2
star
42

jozefg.github.io

website
HTML
1
star
43

reified-records

automatic reification of records to maps
Haskell
1
star
44

c_of_scheme

a lousy scheme compiler
Haskell
1
star