Sciweavers

4757 search results - page 372 / 952
» Monads for Functional Programming
Sort
View
APLAS
2006
ACM
16 years 21 days ago
A Pushdown Machine for Recursive XML Processing
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
Keisuke Nakano, Shin-Cheng Mu
APLAS
2000
ACM
15 years 11 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
POPL
1997
ACM
15 years 11 months ago
Type-Checking Higher-Order Polymorphic Multi-Methods
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
François Bourdoncle, Stephan Merz
ICLP
2011
Springer
14 years 10 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
POPL
2009
ACM
16 years 7 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv