Sciweavers

230 search results - page 35 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
ICFP
2002
ACM
14 years 7 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
AMAI
2008
Springer
13 years 7 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
KR
2004
Springer
14 years 1 months ago
Discovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
Fangzhen Lin
BMCBI
2010
146views more  BMCBI 2010»
13 years 7 months ago
A pairwise residue contact area-based mean force potential for discrimination of native protein structure
Background: Considering energy function to detect a correct protein fold from incorrect ones is very important for protein structure prediction and protein folding. Knowledge-base...
Shahriar Arab, Mehdi Sadeghi, Changiz Eslahchi, Ha...
TLCA
2009
Springer
14 years 2 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer