852 search results - page 104 / 171 » entcs 2010 |
119
click to vote
ENTCS
2007
15 years 3 months ago
2007
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
135
Voted
ENTCS
2007
15 years 3 months ago
2007
In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras...
112
click to vote
ENTCS
2007
15 years 3 months ago
2007
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
103
Voted
ENTCS
2007
15 years 3 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
132
click to vote
ENTCS
2007
15 years 3 months ago
2007
Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this pape...