Sciweavers

4757 search results - page 199 / 952
» Monads for Functional Programming
Sort
View
PPDP
2004
Springer
15 years 11 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 11 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
ICSE
1997
IEEE-ACM
15 years 10 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
PPDP
2007
Springer
16 years 17 days ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
GCC
2003
Springer
15 years 11 months ago
Coarse-Grained Distributed Parallel Programming Interface for Grid Computing
Abstract. In this paper, a practical coarse-grained distributed parallel programming interface for grid computing (PI4GC) is introduced. des a group of generic and abstract functio...
Yongwei Wu, Qing Wang, Guangwen Yang, Weimin Zheng