Sciweavers

62 search results - page 11 / 13
» Monad transformers as monoid transformers
Sort
View
RTA
1998
Springer
15 years 1 months ago
Decidable and Undecidable Second-Order Unification Problems
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
Jordi Levy
NJC
2006
86views more  NJC 2006»
14 years 9 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
HASKELL
2005
ACM
15 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...
AAIP
2009
14 years 10 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...
JAPLL
2010
131views more  JAPLL 2010»
14 years 7 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...