Sciweavers

921 search results - page 2 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View

Book
290views
15 years 5 months ago
Type Theory and Functional Programming
"Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scient...
Simon Thompson
BMCBI
2007
169views more  BMCBI 2007»
13 years 7 months ago
Transcriptional regulatory network refinement and quantification through kinetic modeling, gene expression microarray data and i
Background: Gene expression microarray and other multiplex data hold promise for addressing the challenges of cellular complexity, refined diagnoses and the discovery of well-targ...
Abdallah Sayyed-Ahmad, Kagan Tuncay, Peter J. Orto...
IJAC
2010
231views more  IJAC 2010»
13 years 4 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
ICNP
2005
IEEE
14 years 16 days ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
HASKELL
2005
ACM
14 years 15 days ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...