1073 search results - page 100 / 215 » Formal Program Development with Approximations |
IFL
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
EPIA
1999
Springer
14 years 1 months ago
1999
Springer
In this paper we propose a hybrid system that bridges the gap between traditional image processing methods, used for low-level object recognition, and abductive constraint logic pr...
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
13 years 9 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
AOSD
2007
ACM
14 years 1 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...