Sciweavers

Share
2 search results - page 1 / 1
» randoCoP: Randomizing the Proof Search Order in the Connecti...
Sort
View
CADE
2008
Springer
9 years 3 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
ICFP
2000
ACM
8 years 7 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
books