Sciweavers

97 search results - page 7 / 20
» Semi-Contraction: Axioms and Construction
Sort
View
POPL
1997
ACM
13 years 11 months ago
Proof-Carrying Code
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
George C. Necula
TYPES
2000
Springer
13 years 11 months ago
Collection Principles in Dependent Type Theory
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic ru...
Peter Aczel, Nicola Gambino
CONCUR
2010
Springer
13 years 8 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu
AML
2011
322views Mathematics» more  AML 2011»
13 years 2 months ago
A dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
Arnold W. Miller
AML
2002
69views more  AML 2002»
13 years 7 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner