429 search results - page 51 / 86 » Parameter-free polymorphic types |
123
click to vote
HASKELL
2005
ACM
15 years 5 months ago
2005
ACM
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...
165
click to vote
SCP
2011
14 years 6 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
BMCBI
2010
14 years 12 months ago
2010
Background: Over the last few years, genome-wide association (GWA) studies became a tool of choice for the identification of loci associated with complex traits. Currently, impute...
APLAS
2008
ACM
15 years 1 months ago
2008
ACM
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However,...