13734 search results - page 161 / 2747 » Abstractions of data types |
142
click to vote
POPL
1997
ACM
15 years 8 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
147
click to vote
TLCA
1993
Springer
15 years 8 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
117
click to vote
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
144
click to vote
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
lue Abstraction for Verifying Linearizability Viktor Vafeiadis Microsoft Research, Cambridge, UK This paper presents a novel abstraction for heap-allocated data structures that kee...
138
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...