1805 search results - page 30 / 361 » A Theory of Closure Operators |
140
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
150
click to vote
BIRTHDAY
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
133
click to vote
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
124
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
137
click to vote
AAAI
2000
15 years 5 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...