theoremprover-museum / LCF77Links
The original Edinburgh LCF.
☆34Updated 9 years ago
Alternatives and similar repositories for LCF77
Users that are interested in LCF77 are comparing it to the libraries listed below
Sorting:
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- The Prettiest Printer☆35Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Work in progress☆38Updated 6 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- ☆26Updated 8 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆37Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- being a particular fragment of Haskell, extended to a proof system☆42Updated this week
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Miller/pattern unification in Agda☆67Updated last month
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 12 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)