Sciweavers

230 search results - page 39 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
LICS
2009
IEEE
14 years 2 months ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram
ENTCS
2008
121views more  ENTCS 2008»
13 years 7 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
GIS
2006
ACM
14 years 8 months ago
Index for fast retrieval of uncertain spatial point data
Location information gathered from a variety of sources in the form of sensor data, video streams, human observations, and so on, is often imprecise and uncertain and needs to be ...
Dmitri V. Kalashnikov, Yiming Ma, Sharad Mehrotra,...
AFP
2008
Springer
249views Formal Methods» more  AFP 2008»
14 years 2 months ago
An iTask Case Study: A Conference Management System
Workflow systems are automated systems in which tasks are coordinated by assigning them to either humans or computers. Contemporary workflow systems are static and not very flex...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
BMCBI
2007
102views more  BMCBI 2007»
13 years 7 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...