3319 search results - page 219 / 664 » Subshifts, Languages and Logic |
165
click to vote
TIME
1994
IEEE
15 years 10 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
192
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
143
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
167
click to vote
LOGCOM
2010
15 years 5 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
259
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...