2911 search results - page 97 / 583 » A Theory of Expressiveness in Mechanisms |
177
click to vote
MST
2007
15 years 5 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
146
click to vote
CIE
2005
Springer
15 years 12 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
274
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
153
click to vote
CONCUR
2005
Springer
15 years 12 months ago
2005
Springer
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
354
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Handling exceptions in a knowledge-based system has been considered as an important issue in many domains of applications, such as medical domain. In this paper, we propose severa...