Sciweavers

215 search results - page 7 / 43
» Verifying haskell programs using constructive type theory
Sort
View
HASKELL
2008
ACM
13 years 8 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 1 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
POPL
2007
ACM
14 years 8 months ago
A typed intermediate language for compiling multiple inheritance
Type-preserving compilation can improve software reliability by generating code that can be verified independently of the compiler. Practical type-preserving compilation does not ...
Juan Chen
SIGPLAN
2002
13 years 7 months ago
A rule-based language for programming software updates
We describe the design of a rule-based language for expressing changes to Haskell programs in a systematic and reliable way. The update language essentially offers update commands...
Martin Erwig, Deling Ren
PEPM
2010
ACM
14 years 4 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage