2106 search results - page 38 / 422 » Operational Semantics for MSC'96 |
90
Voted
LFP
1990
14 years 11 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
82
Voted
IJAR
2007
14 years 9 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
IJAR
2008
14 years 9 months ago
2008
There is a well-recognised need in diverse applications for reasoning with multiple, potentially inconsistent sources of information. One approach is to represent each source of i...
APLAS
2010
ACM
14 years 10 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
72
Voted
DAGSTUHL
2003
14 years 11 months ago
2003
Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e...