Sciweavers

111 search results - page 19 / 23
» Constructing Polymorphic Programs with Quotient Types
Sort
View
ICFP
2010
ACM
13 years 9 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
ENTCS
2008
90views more  ENTCS 2008»
13 years 8 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...
ISSRE
2002
IEEE
14 years 24 days ago
Inter-Class Mutation Operators for Java
The effectiveness of mutation testing depends heavily on the types of faults that the mutation operators are designed to represent. Therefore, the quality of the mutation operator...
Yu-Seung Ma, Yong Rae Kwon, Jeff Offutt
C++
1994
128views more  C++ 1994»
13 years 9 months ago
Implementing Signatures for C++
ne the design and detail the implementation of a language extension for abstracting types and for decoupling subtyping and inheritance in C++. This extension gives the user more of...
Gerald Baumgartner, Vincent F. Russo
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer