12774 search results - page 93 / 2555 » A Framework for Proof Systems |
195
click to vote
IFL
2007
Springer
15 years 10 months 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...
123
Voted
CORR
2006
Springer
15 years 4 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...
149
click to vote
ENTCS
2002
15 years 3 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...
150
click to vote
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
134
click to vote
JSYML
2010
15 years 2 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...