Sciweavers

313 search results - page 13 / 63
» Model equivalence of PRISM programs
Sort
View
ESOP
2012
Springer
12 years 3 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
JMLR
2012
11 years 10 months ago
Max-Margin Min-Entropy Models
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...
Kevin Miller, M. Pawan Kumar, Benjamin Packer, Dan...
CTCS
1997
Springer
13 years 12 months ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani
LPNMR
2007
Springer
14 years 1 months ago
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
Pedro Cabalar, David Pearce, Panos Rondogiannis, W...
IPPS
2007
IEEE
14 years 2 months ago
Scheduling in the Z-Polyhedral Model
The polyhedral model is extensively used for analyses and transformations of regular loop programs, one of the most important being automatic parallelization. The model, however, ...
Gautam Gupta, DaeGon Kim, Sanjay V. Rajopadhye