Sciweavers

429 search results - page 69 / 86
» Parameter-free polymorphic types
Sort
View
HASKELL
2007
ACM
15 years 1 months ago
A lightweight interactive debugger for haskell
This paper describes the design and construction of a Haskell source-level debugger built into the GHCi interactive environment. We have taken a pragmatic approach: the debugger i...
Simon Marlow, José Iborra, Bernard Pope, An...
ICALP
2007
Springer
15 years 1 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
14 years 10 months ago
A new quantum behaved particle swarm optimization
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
Millie Pant, Radha Thangaraj, Ajith Abraham
BMCBI
2006
159views more  BMCBI 2006»
14 years 9 months ago
ProtRepeatsDB: a database of amino acid repeats in genomes
Background: Genome wide and cross species comparisons of amino acid repeats is an intriguing problem in biology mainly due to the highly polymorphic nature and diverse functions o...
Mridul K. Kalita, Gowthaman Ramasamy, Sekhar Durai...
IANDC
2006
93views more  IANDC 2006»
14 years 9 months ago
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
Jia Meng, Claire Quigley, Lawrence C. Paulson