Sciweavers

303 search results - page 9 / 61
» Theory Interpretation in Simple Type Theory
Sort
View
RTA
2007
Springer
14 years 1 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant
CADE
1992
Springer
13 years 11 months ago
Implementing the Meta-Theory of Deductive Systems
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
Frank Pfenning, Ekkehard Rohwedder
ARITH
1997
IEEE
13 years 11 months ago
Theory and applications for a double-base number system
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
Vassil S. Dimitrov, Graham A. Jullien, William C. ...
TYPES
1994
Springer
13 years 11 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
ICFP
2005
ACM
14 years 7 months ago
Recursive type generativity
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
Derek Dreyer