Sciweavers

2236 search results - page 320 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
LICS
2010
IEEE
15 years 2 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
ATAL
2007
Springer
15 years 10 months ago
Reasoning about judgment and preference aggregation
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
ESOP
2004
Springer
15 years 9 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
ESOP
2012
Springer
14 years 2 days ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
129
Voted
PASTE
2010
ACM
15 years 2 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan