2452 search results - page 170 / 491 » On Reduction of Lagrange Systems |
147
click to vote
LICS
2006
IEEE
16 years 3 days ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
169
Voted
RTSS
1996
IEEE
15 years 10 months ago
1996
IEEE
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
161
click to vote
AAAI
2000
15 years 7 months ago
2000
A serious shortcoming of many Description Logic based knowledge representation systems is the inadequacy of their query languages. In this paper we present a novel technique that ...
109
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impl...
199
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...