67 search results - page 10 / 14 » A Proof Theory for Generic Judgments: An extended abstract |
LPAR
2000
Springer
13 years 10 months ago
2000
Springer
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
COMBINATORICS
2004
13 years 6 months ago
2004
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
CSCLP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
IFM
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
ITP
2010
13 years 10 months ago
2010
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...