1061 search results - page 31 / 213 » Dependently Sorted Logic |
CADE
2003
Springer
14 years 10 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
AINA
2007
IEEE
14 years 4 months ago
2007
IEEE
In the near future, homes are envisioned to be equipped with numerous intelligent communicating devices. Such smart home needs to exhibit highly adaptive behavior to meet the inha...
ICFP
2010
ACM
13 years 11 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...