Sciweavers

267 search results - page 26 / 54
» Formal Parametric Polymorphism
Sort
View
120
Voted
BIRTHDAY
2006
Springer
15 years 5 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle
109
Voted
TPHOL
2007
IEEE
15 years 8 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka
116
Voted
ECOOP
2010
Springer
15 years 6 months ago
Verifying Generics and Delegates
Recently, object-oriented languages, such as C , have been extended with language features prevalent in most functional languages: parametric polymorphism and higher-order function...
Kasper Svendsen, Lars Birkedal, Matthew Parkinson
110
Voted
GI
2009
Springer
15 years 6 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
124
Voted
FLOPS
1999
Springer
15 years 6 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer