Sciweavers

1805 search results - page 67 / 361
» Functional programming with structured graphs
Sort
View
ACL
2010
13 years 8 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
CGO
2006
IEEE
14 years 4 months ago
Selecting Software Phase Markers with Code Structure Analysis
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Jeremy Lau, Erez Perelman, Brad Calder
ICFP
2007
ACM
14 years 10 months ago
Functional pearl: the great escape or, how to jump the border without getting caught
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts p...
David Herman
ICSE
2007
IEEE-ACM
14 years 10 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
WG
1993
Springer
14 years 2 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...