Sciweavers

117 search results - page 15 / 24
» Program Extraction from Classical Proofs
Sort
View
ICFP
2012
ACM
11 years 10 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
VLDB
1990
ACM
143views Database» more  VLDB 1990»
13 years 11 months ago
Synthesizing Database Transactions
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
Xiaolei Qian
CGIM
2003
13 years 9 months ago
Snake for Band Edge Extraction and Its Applications
A novel snake model suitable for edge extraction of bandshape objects is presented in this paper. Based on the proposed model, an edge tracking system, EdgeTrak, has been develope...
Min Li, Chandra Kambhamettu, Maureen C. Stone
CADE
2011
Springer
12 years 7 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
CIE
2007
Springer
14 years 1 months ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li