Sciweavers

1805 search results - page 241 / 361
» Functional programming with structured graphs
Sort
View
KDD
1995
ACM
193views Data Mining» more  KDD 1995»
15 years 5 months ago
Analyzing the Benefits of Domain Knowledge in Substructure Discovery
Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working wit...
Surnjani Djoko, Diane J. Cook, Lawrence B. Holder
ENTCS
2008
121views more  ENTCS 2008»
15 years 1 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
ENTCS
2010
101views more  ENTCS 2010»
14 years 11 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach
POPL
2012
ACM
13 years 9 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
ERLANG
2007
ACM
15 years 5 months ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...