Sciweavers

2477 search results - page 264 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
WWW
2002
ACM
16 years 7 months ago
An event-condition-action language for XML
XML repositories are now a widespread means for storing and exchanging information on the Web. As these repositories become increasingly used in dynamic applications such as e-com...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...
ENTCS
2007
109views more  ENTCS 2007»
15 years 6 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
ICFP
2002
ACM
16 years 6 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
PPDP
2007
Springer
16 years 20 days ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
HASKELL
2005
ACM
16 years 3 days ago
Dynamic applications from the ground up
Some Lisp programs such as Emacs, but also the Linux kernel (when fully modularised) are mostly dynamic; i.e., apart from a small static core, the significant functionality is dy...
Don Stewart, Manuel M. T. Chakravarty