1948 search results - page 269 / 390 » Formalizing Mirror Theory |
167
click to vote
PLDI
2009
ACM
16 years 11 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
157
click to vote
PPDP
2009
Springer
16 years 3 days ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
163
click to vote
LPNMR
2001
Springer
15 years 10 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
169
click to vote
WADT
1999
Springer
15 years 9 months ago
1999
Springer
Based on the FOCUS theory of distributed systems (see [Broy, Stølen 01]) that are composed of interacting components we introduce a formal model of services and layered architectu...
184
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...