10715 search results - page 384 / 2143 » Proofs from Tests |
186
click to vote
AAAI
1990
15 years 8 months ago
1990
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
169
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
158
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
183
click to vote
FUIN
2008
15 years 7 months ago
2008
This paper presents a cancellation theorem for the preorders in van Glabbeek's linear time-branching time spectrum over BCCSP. Apart from having some intrinsic interest, the p...
137
click to vote
JSC
2006
15 years 6 months ago
2006
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...