1948 search results - page 178 / 390 » Formalizing Mirror Theory |
157
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
251
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
176
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
150
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
158
click to vote
LATA
2010
Springer
16 years 3 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...