Sciweavers

518 search results - page 7 / 104
» Automating Proofs in Category Theory
Sort
View
POPL
2010
ACM
14 years 4 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
ENTCS
2008
128views more  ENTCS 2008»
13 years 7 months ago
Towards Formalizing Categorical Models of Type Theory in Type Theory
This note is about work in progress on the topic of "internal type theory" where we investigate the internal formalization of the categorical metatheory of constructive ...
Alexandre Buisse, Peter Dybjer
CSL
2003
Springer
14 years 19 days ago
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
Alexandre Miquel
LICS
1998
IEEE
13 years 11 months ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett
CLASSIFICATION
2010
13 years 4 months ago
A Formal Proof of a Paradox Associated with Cohen's Kappa
Abstract: Suppose two judges each classify a group of objects into one of several nominal categories. It has been observed in the literature that, for fixed observed agreement betw...
Matthijs J. Warrens