jsiek/abstract-binding-trees jsiek/abstract-binding-trees

  • Stars
    star
    69
  • Rank 452,630 (Top 9 %)
  • Language Agda
  • Created almost 5 years ago
  • Updated 3 months ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
jsiek/abstract-binding-trees
github

jsiek

Reviews

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

Repository Details

Abstract binding trees (abstract syntax trees plus binders), as a library in Agda

More Repositories

1

B629-denotational

Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
TeX
72
star
2

deduce

A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
Python
56
star
3

gradual-typing-in-agda

Formalizations of Gradually Typed Languages in Agda
TeX
54
star
4

B522-PL-Foundations

Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University
Agda
53
star
5

featherweight-C

Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine
C++
26
star
6

denotational_semantics

Denotational semantics based on graph and filter models
Agda
17
star
7

arete

Arete is an experimental programming language.
TeX
12
star
8

al

Al: a language for teaching algorithms and data structures
OCaml
6
star
9

step-indexed-logic

A modal logic for reasoning about step-indexed logical relations
TeX
6
star
10

B505-algorithms-public

Public material for the course B505 Applies Algorithms at Indiana University
5
star
11

prototypes-in-python

Prototypes of programming languages written in Python.
Python
3
star
12

agda-stdlib-doc

1
star