107 search results - page 10 / 22 » Implementing the Meta-Theory of Deductive Systems |
POPL
1998
ACM
13 years 11 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
AAAI
2010
13 years 9 months ago
2010
We describe a generic framework for representing and reasoning with annotated Semantic Web data, formalise the annotated language, the corresponding deductive system, and address ...
ROBOCUP
1999
Springer
13 years 11 months ago
1999
Springer
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of the approach, which makes agent scripts expressive...
FMOODS
2007
13 years 9 months ago
2007
Abstract. This paper gives an overview of the KeY approach and highlights the main features of the KeY system. KeY is an approach (and a system) for the deductive verification of ...