291 search results - page 12 / 59 » A Logic for Parametric Polymorphism |
CADE
2007
Springer
15 years 9 months ago
2007
Springer
63
Voted
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
90
Voted
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
FUIN
2010
14 years 6 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
LFCS
1992
Springer
15 years 1 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...