Sciweavers

7289 search results - page 286 / 1458
» A Dependent Set Theory
Sort
View
CONCUR
2008
Springer
15 years 8 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
172
Voted
JAPLL
2006
87views more  JAPLL 2006»
15 years 6 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
JUCS
2008
91views more  JUCS 2008»
15 years 6 months ago
The Riemann Integral in Weak Systems of Analysis
: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannsen and Chris Pollett (connected with the hierarchy of counting functions), we introduce s...
Fernando Ferreira, Gilda Ferreira
LPAR
2010
Springer
15 years 4 months ago
Qex: Symbolic SQL Query Explorer
We describe a technique and a tool called Qex for generating input tables and parameter values for a given parameterized SQL query. The evaluation semantics of an SQL query is tra...
Margus Veanes, Nikolai Tillmann, Jonathan de Halle...
POPL
2010
ACM
16 years 4 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins