Sciweavers

5415 search results - page 376 / 1083
» The Implementation of Functional Programming Languages
Sort
View
ICALP
2005
Springer
16 years 9 days ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...
PADL
2000
Springer
15 years 10 months ago
Transformation-by-Example for XML
Abstract. xml is a language for describing markup languages for structured data. A growing number of applications that process xml documents are transformers, i.e., programs that c...
Shriram Krishnamurthi, Kathryn E. Gray, Paul T. Gr...
VL
1996
IEEE
125views Visual Languages» more  VL 1996»
15 years 11 months ago
Teaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
Amir Michail
PPDP
2004
Springer
16 years 4 days 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&...
ICFP
2009
ACM
16 years 7 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...