2008 · 30 citations · 19 references
ComputingComputer ScienceCompilersProgramming LanguagesTheory Of ComputationCompiler ConstructionData TypesHoare LogicProof AssistantsType CheckingType SystemsCompiler DesignCompiler SupportDependent TypesDynamic Type CheckingInvariantsProgram VerificationType PreservationType Theory
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants, in order to capture important invariants of the program in the types. This allows type-based program verification and is a promising compromise between plain old types and full blown Hoare logic proofs. The introduction of GADTs in GHC (and more recently type families) made such dependent typing available in an industry-quality implementation, making it possible to consider its use in large scale programs.
19
George C. Necula · 1997 · 1.8K citations
Formal certification of a compiler back-end or
Xavier Leroy · 2006 · 652 citations
From system F to typed assembly language
Greg Morrisett, David Walker, Karl Crary et al. · ACM Transactions on Programming Languages and Systems · 1999 · 587 citations · Full text
Template meta-programming for Haskell
Tim Sheard, Simon Peyton Jones · 2002 · 548 citations