Sciweavers

28 search results - page 2 / 6
» Making data structures confluently persistent
Sort
View
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 9 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
PADL
2010
Springer
14 years 2 months ago
First-Order Interactive Programming
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...
Roly Perera
ISW
2001
Springer
13 years 9 months ago
Persistent Authenticated Dictionaries and Their Applications
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?â€...
Aris Anagnostopoulos, Michael T. Goodrich, Roberto...
POS
1998
Springer
13 years 9 months ago
Spatio-temporal Access in Persistent Java
Persistent programming languages are targetted primarily at application systems involving complex data structures and relationships, as typi ed by Geographical Information Systems...
Sonia Berman, R. Southern, A. Vasey, D. Ziskind
ADAEUROPE
2000
Springer
13 years 9 months ago
On Persistent and Reliable Streaming in Ada
Saving internal program data for further use is one of the most useful ideas in programming. Developing general features to provide such data saving/ restoring is a very active res...
Jörg Kienzle, Alexander B. Romanovsky