Sciweavers

35 search results - page 6 / 7
» An Algebra of Pure Quantum Programming
Sort
View
ICFP
2008
ACM
14 years 5 months ago
Functional translation of a calculus of capabilities
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
Arthur Charguéraud, François Pottier
GI
1997
Springer
13 years 9 months ago
Functional Object-Oriented Programming with Object-Gofer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
Wolfram Schulte, Klaus Achatz
FUIN
2010
137views more  FUIN 2010»
13 years 2 months ago
Extending and Implementing RASP
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
Stefania Costantini, Andrea Formisano, Davide Pett...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
13 years 9 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
POPL
2004
ACM
14 years 5 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann