6978 search results - page 207 / 1396 » On Proofs in System P |
243
click to vote
IFL
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
157
click to vote
POPL
1997
ACM
15 years 10 months ago
1997
ACM
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
184
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
189
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...