Sciweavers

1005 search results - page 66 / 201
» Operational Semantics and Program Equivalence
Sort
View
ESOP
2012
Springer
12 years 3 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
AIR
2006
83views more  AIR 2006»
13 years 7 months ago
A revision-based approach to handling inconsistency in description logics
Recently, the problem of inconsistency handling in description logics has attracted a lot of attention. Many approaches have been proposed to deal with this problem based on existi...
Guilin Qi, Weiru Liu, David A. Bell
ATAL
2010
Springer
13 years 8 months ago
Programming norm change
To adequately deal with the unpredictable and dynamic environments normative frameworks are typically deployed in, mechanisms for modifying the norms at runtime are crucial. We pr...
Nick A. M. Tinnemeier, Mehdi Dastani, John-Jules C...
ACL
2006
13 years 9 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
FOSSACS
2006
Springer
13 years 11 months ago
Reversing Algebraic Process Calculi
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
Iain C. C. Phillips, Irek Ulidowski