Sciweavers

1036 search results - page 148 / 208
» Incompleteness of Behavioral Logics
Sort
View
234
Voted
POPL
2004
ACM
16 years 4 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
152
Voted
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
15 years 9 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
127
Voted
FPCA
1989
15 years 7 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
152
Voted
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 3 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
142
Voted
DAC
2007
ACM
16 years 4 months ago
Global Critical Path: A Tool for System-Level Timing Analysis
An effective method for focusing optimization effort on the most important parts of a design is to examine those elements on the critical path. Traditionally, the critical path is...
Girish Venkataramani, Mihai Budiu, Tiberiu Chelcea...