303 search results - page 14 / 61 » Theory Interpretation in Simple Type Theory |
CAV
1999
Springer
13 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
ACSC
2006
IEEE
14 years 1 months ago
2006
IEEE
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
TOCL
2012
11 years 10 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...