Sciweavers

215 search results - page 19 / 43
» Verifying haskell programs using constructive type theory
Sort
View
ICFP
2006
ACM
14 years 9 months ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
ENTCS
2008
90views more  ENTCS 2008»
13 years 9 months ago
Quantum Data and Control Made Easier
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
Michael Lampis, Kyriakos G. Ginis, Michalis A. Pap...
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
POPL
2010
ACM
14 years 6 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
POPL
2003
ACM
14 years 9 months ago
Ownership types for object encapsulation
Ownership types provide a statically enforceable way of specifying object encapsulation and enable local reasoning about program correctness in object-oriented languages. However,...
Chandrasekhar Boyapati, Barbara Liskov, Liuba Shri...