Sciweavers

439 search results - page 32 / 88
» Type invariants for Haskell
Sort
View
PEPM
1994
ACM
13 years 11 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
ENTCS
2008
90views more  ENTCS 2008»
13 years 7 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...
JFP
2007
94views more  JFP 2007»
13 years 7 months ago
A monadic framework for delimited continuations
Delimited continuations are more expressive than traditional abortive continuations and they apparently require a framework beyond traditional continuation-passing style (CPS). We...
R. Kent Dybvig, Simon L. Peyton Jones, A. M. R. Sa...
ECOOP
2007
Springer
14 years 1 months ago
Generic Universe Types
Ownership is a powerful concept to structure the object store and to control aliasing and modifications of objects. This paper presents an ownership type system for a Javalike pr...
Werner Dietl, Sophia Drossopoulou, Peter Müll...
ESOP
2010
Springer
14 years 5 months ago
Stateful Contracts for Affine Types
Affine type systems manage resources by preventing some values from being used more than once. This offers expressiveness and performance benefits, but difficulty arises in intera...
Jesse A. Tov, Riccardo Pucella