Extracting Feasible Programs

First Page		Document Content
Date: 2006-01-11 06:16:21 Proof theory Functions and mappings Logic in computer science Function Primitive recursive function Curry–Howard correspondence Second-order logic Modal logic Computational complexity theory Mathematics Logic Mathematical logic		Extracting Feasible Programs Add to Reading List Source URL: aaai.org Download Document from Source Website File Size: 82,47 KB Share Document on Facebook

	Logic and programming The Temporal Curry–Howard Correspondence Conclusions and outlook DocID: 1t3Gc - View Document
	INSTRUCTIONS FOR PRODUCING A CAMERA-READY MANUSCRIPT A.B. AUTHOR Department of Physics, Theoretical Physics, 1 Keble Road, Oxford OX1 3NP, England This is where the abstract should be placed. It should consist of one pa DocID: 1gnrI - View Document
	Unbounded Proof-Length Speed-up in Deduction Modulo Guillaume Burel1 1 Universit´e Henri Poincar´e & LORIA2 DocID: 1ggFx - View Document
	Self-Representation in Girard’s System U Keywords Lambda Calculus; Self Representation; Types 1. DocID: 1g42s - View Document
	Jordan Journal of Mathematics and Statistics (JJMS) 3(3), 2010, ppAN EXTENSION OF MULHOLLAND’S INEQUALITY BICHENG YANG Abstract. By introducing multi-parameters and using the way of weight coefficients and DocID: 1g1O8 - View Document