Sciweavers

215 search results - page 11 / 43
» Verifying haskell programs using constructive type theory
Sort
View
ENTCS
2007
100views more  ENTCS 2007»
13 years 9 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
ICFP
2006
ACM
14 years 9 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
ICFP
2005
ACM
14 years 9 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
ICFP
2006
ACM
14 years 9 months ago
Simple unification-based type inference for GADTs
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...

Publication
232views
15 years 7 months ago
Multi-stage Programming:  Its Theory and Applications
MetaML is a statically typed functional programming language with special support for program generation. In addition to providing the standard features of contemporary programming...
Walid Taha