Sciweavers

1982 search results - page 229 / 397
» Parametricity and dependent types
Sort
View
DAM
2010
92views more  DAM 2010»
15 years 6 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
ENTCS
2008
121views more  ENTCS 2008»
15 years 6 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
2006
116views more  ENTCS 2006»
15 years 6 months ago
Stepwise Refinement of Processes
Industry is looking to create a market in reliable "plug-and-play" components. To model components in a modular style it would be useful to combine event-based and state...
Steve Reeves, David Streader
COMCOM
2007
111views more  COMCOM 2007»
15 years 6 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn
CORR
2007
Springer
130views Education» more  CORR 2007»
15 years 6 months ago
Characterization of Search Engine Caches
Search engines provide cached copies of indexed content so users will have something to “click on” if the remote resource is temporarily or permanently unavailable. Depending ...
Frank McCown, Michael L. Nelson