1894 search results - page 170 / 379 » A TLA Proof System |
147
click to vote
TLCA
1993
Springer
15 years 8 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
118
click to vote
LICS
2006
IEEE
15 years 10 months 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 ...
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper, chaos in a current-mode controlled boost converter is studied. Firstly, the existence of chaos is proven theoretically in this system. The proof consists of show...
122
click to vote
RTA
1997
Springer
15 years 8 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
148
click to vote
SWWS
2008
15 years 5 months ago
2008
- Semantic technologies, such as RDF (Resource Description Framework) and OWL (Web Ontology Language), are being widely used to store information. Ontology is mostly used in semant...