Sciweavers

237 search results - page 29 / 48
» Modular Monad Transformers
Sort
View
ICFP
2007
ACM
14 years 7 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones
APLAS
2004
ACM
14 years 1 months ago
PType System: A Featherweight Parallelizability Detector
Parallel programming is becoming an important cornerstone of general computing. In addition, type systems have significant impact on program analysis. In this paper, we demonstrat...
Dana N. Xu, Siau-Cheng Khoo, Zhenjiang Hu
FOCS
2004
IEEE
13 years 11 months ago
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
Irit Dinur, Omer Reingold
FOSSACS
2008
Springer
13 years 9 months ago
The Microcosm Principle and Concurrency in Coalgebra
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova
IASTEDSEA
2004
13 years 9 months ago
Instance orientation: A programming methodology
Instance orientation is an approach for designing and programming software systems. It addresses a limitation of current software architectures: it allows multiple higherlevel vie...
Thomas Schöbel-Theuer