Sciweavers

1269 search results - page 128 / 254
» Pi-Calculus in Logical Form
Sort
View
184
Voted
POPL
2012
ACM
14 years 27 days ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
JOLLI
2010
142views more  JOLLI 2010»
15 years 3 months ago
Towards a Type-Theoretical Account of Lexical Semantics
After a quick overview of the field of study known as “Lexical Semantics”, where we advocate the need of accessing additional information besides syntax and Montaguestyle sema...
Christian Bassac, Bruno Mery, Christian Retor&eacu...
125
Voted
DAC
2007
ACM
16 years 6 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi
158
Voted
CADE
2007
Springer
16 years 5 months ago
Formalization of Continuous Probability Distributions
Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that ...
Osman Hasan, Sofiène Tahar
128
Voted
CADE
2006
Springer
16 years 5 months ago
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
Peter Baumgartner, Renate A. Schmidt