Sciweavers

1026 search results - page 124 / 206
» A Methodology for Equational Reasoning
Sort
View
ESOP
2012
Springer
12 years 4 months 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
CVPR
2009
IEEE
15 years 4 months ago
What is a Camera?
This paper addresses the problem of characterizing a general class of cameras under reasonable, “linear” assumptions. Concretely, we use the formalism and terminology of cla...
Jean Ponce (Ecole Normale Superieure)
ICLP
2009
Springer
14 years 9 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
ECBS
2009
IEEE
89views Hardware» more  ECBS 2009»
14 years 3 months ago
Optimisation Process for Maintaining Evolvability during Software Evolution
Software systems have to be changed continuously and evolutionarily throughout the whole time of their development and usage. Meanwhile, the software systems have to remain flexi...
Robert Brcina, Stephan Bode, Matthias Riebisch
LICS
2009
IEEE
14 years 3 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons