Sciweavers

2138 search results - page 192 / 428
» Logical Step-Indexed Logical Relations
Sort
View
TE
2010
104views more  TE 2010»
15 years 1 months ago
Integrating Asynchronous Digital Design Into the Computer Engineering Curriculum
Abstract--As demand increases for circuits with higher performance, higher complexity, and decreased feature size, asynchronous (clockless) paradigms will become more widely used i...
Scott C. Smith, Waleed Al-Assadi, Jia Di
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
16 years 6 months ago
The ADO.NET entity framework: making the conceptual level real
This paper describes the ADO.NET Entity Framework, a platform for programming against data that raises the level of ion from the logical (relational) level to the conceptual (enti...
Anil Nori, José A. Blakeley, S. Muralidhar
ENTCS
2002
129views more  ENTCS 2002»
15 years 6 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 5 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
SLOGICA
2010
138views more  SLOGICA 2010»
15 years 5 months ago
Extensionality and Restriction in Naive Set Theory
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Zach Weber