6274 search results - page 61 / 1255 » Proofs, Programs, Processes |
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
179
click to vote
AMAI
1999
Springer
15 years 5 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
164
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
202
click to vote
PEPM
2010
ACM
15 years 8 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
175
click to vote
FROCOS
2005
Springer
15 years 11 months ago
2005
Springer
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...