265 search results - page 12 / 53 » Weakly Algebraizable Logics |
111
Voted
ENTCS
2006
15 years 1 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
108
click to vote
LICS
2010
IEEE
15 years 8 days ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
124
click to vote
IPL
2002
15 years 1 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
125
Voted
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...