3319 search results - page 371 / 664 » Subshifts, Languages and Logic |
211
Voted
CN
1999
15 years 6 months ago
1999
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
314
Voted
POPL
2007
ACM
16 years 7 months ago
2007
ACM
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
304
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
254
click to vote
POPL
2001
ACM
16 years 7 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
191
Voted
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...