Sciweavers

1768 search results - page 175 / 354
» A Logic for Algebraic Effects
Sort
View
201
Voted
LICS
2002
IEEE
16 years 6 hour 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
197
Voted
FPCA
1989
15 years 11 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 7 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
184
Voted
ICCAD
1993
IEEE
85views Hardware» more  ICCAD 1993»
15 years 11 months ago
Input don't care sequences in FSM networks
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ï¬...
Huey-Yih Wang, Robert K. Brayton
AAAI
1994
15 years 8 months ago
Representing Multiple Theories
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
P. Pandurang Nayak