Sciweavers

3624 search results - page 368 / 725
» Abstract Algebraic Logic
Sort
View
POPL
2004
ACM
16 years 7 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
182
Voted
LICS
2002
IEEE
15 years 11 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
180
Voted
FPCA
1989
15 years 10 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 6 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 10 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....