Sciweavers

215 search results - page 32 / 43
» Verifying haskell programs using constructive type theory
Sort
View
POPL
2006
ACM
14 years 9 months ago
A virtual class calculus
Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They re...
Erik Ernst, Klaus Ostermann, William R. Cook
POPL
2007
ACM
14 years 9 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
ICFP
2001
ACM
14 years 9 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo
POPL
2012
ACM
12 years 4 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
ICFP
2003
ACM
14 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay