Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

ICFP
2008
ACM

favoriteEmaildiscussreport

107views Programming Languages» more ICFP 2008»

A type-preserving compiler in Haskell

14 years 11 months ago

A type-preserving compiler in Haskell

Download www.iro.umontreal.ca

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 in the types important invariants of the program. This allows type-based program verification and is a promising compromise between plain old types and full blown Hoare logic proofs.

Louis-Julien Guillemette, Stefan Monnier

Real-time Traffic

Hoare Logic Proofs | ICFP 2008 | Programming Languages | Type-based Program Verification | Types Important Invariants |

claim paper

Related Content

» A typepreserving closure conversion in haskell

» UUXML A TypePreserving XML SchemaHaskell Data Binding

» TypeSafe Code Transformations in Haskell

» A certified framework for compiling and executing garbagecollected languages

» Precision in Practice A TypePreserving Java Compiler

» Security Types Preserving Compilation Extended Abstract

» A backend for GHC based on categorical multicombinators

» The Structure of the Essential Haskell Compiler or Coping with Compiler Complexity

» Shake before building replacing make with haskell

» The architecture of the Utrecht Haskell compiler

Post Info
More Details (n/a)

Added	13 Dec 2009
Updated	13 Dec 2009
Type	Conference
Year	2008
Where	ICFP
Authors	Louis-Julien Guillemette, Stefan Monnier

Comments (0)