https://github.com/namin/dafny-sandbox

Dafny for Metatheory of Programming Languages
https://github.com/namin/dafny-sandbox

binders coq dafny meta-theory

Last synced: 3 months ago
JSON representation

Dafny for Metatheory of Programming Languages

• Host: GitHub
• URL: https://github.com/namin/dafny-sandbox
• Owner: namin
• Created: 2012-10-26T16:38:26.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2024-09-10T03:27:49.000Z (5 months ago)
• Last Synced: 2024-10-11T21:46:51.903Z (4 months ago)
• Topics: binders, coq, dafny, meta-theory
• Language: Dafny
• Homepage: https://www.youtube.com/watch?v=7C-GitT4X6w
• Size: 146 KB
• Stars: 22
• Watchers: 4
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Dafny for Metatheory of Programming Languages

=============================================

[Related talk at MSR](http://research.microsoft.com/apps/video/default.aspx?id=198423).

Dafny

-----

Dafny is an [open-source](https://github.com/Microsoft/dafny) automatic program

verifier for functional correctness developed at

[Microsoft Research](http://research.microsoft.com/en-us/projects/dafny/).

Software Foundations

--------------------

Software Foundations is a textbook on programming languages written in

[Coq](http://coq.inria.fr) and

[available online](http://www.cis.upenn.edu/~bcpierce/sf/).

I've translated some parts of Software Foundations from Coq to Dafny.

* [Imp](https://github.com/namin/dafny-sandbox/blob/master/Imp.dfy)

* [Types: Type Systems](https://github.com/namin/dafny-sandbox/blob/master/Imp.dfy)

* [Stlc: The Simply Typed Lambda-Calculus](https://github.com/namin/dafny-sandbox/blob/master/Stlc.dfy)

* [Norm: Normalization of STLC](https://github.com/namin/dafny-sandbox/blob/master/Norm.dfy)

* [References: Typing Mutable References](https://github.com/namin/dafny-sandbox/blob/master/References.dfy)

Beyond Software Foundations

---------------------------

* [StlcLn: Locally-nameless STLC](https://github.com/namin/dafny-sandbox/blob/master/StlcLn.dfy)

* [LnSystemF: Locally-nameless System F](https://github.com/namin/dafny-sandbox/blob/master/LnSystemF.dfy)

Step-Indexed Logical Relations

------------------------------

Step-indexed logical relations seem like a natural fit for Dafny. Hence,

I am formalizing

[Amal Ahmed's Lectures on Logical Relations](http://www.cs.uoregon.edu/Activities/summerschool/summer12/curriculum.html).

* [Lr_Ts_Stlc.dfy](https://github.com/namin/dafny-sandbox/blob/master/Lr_Ts_Stlc.dfy):

  Proof of type-safety of the STLC using step-indexed logical relations.

* [Lr_Ts_Stlc_IsoRecTypes.dfy](https://github.com/namin/dafny-sandbox/blob/master/Lr_Ts_Stlc_IsoRecTypes.dfy):

  Augment STLC with iso-recursive types (explicit `fold` and `unfold`).

  The previous proof simply needs to be augmented as well. The old cases remain unchanged.