Sciweavers

58 search results - page 6 / 12
» Monadic Parsing in Haskell
Sort
View
ENTCS
2008
125views more  ENTCS 2008»
13 years 9 months ago
Quantum Arrows in Haskell
We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and ...
Juliana Kaizer Vizzotto, Antônio Carlos da R...
JCT
2006
110views more  JCT 2006»
13 years 9 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
HASKELL
2009
ACM
14 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
AAIP
2009
13 years 11 months ago
Porting IgorII from Maude to Haskell
This paper describes our efforts and solutions in porting our IP system IGOR 2 from the termrewriting language MAUDE to HASKELL. We describe how, for our purpose necessary feature...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...
HASKELL
2005
ACM
14 years 3 months ago
There and back again: arrows for invertible programming
Invertible programming occurs in the area of data conversion where it is required that the conversion in one direction is the inverse of the other. For that purpose, we introduce ...
Artem Alimarine, Sjaak Smetsers, Arjen van Weelden...