Sciweavers

29 search results - page 4 / 6
» Another proof of Soittola's theorem
Sort
View
LPAR
2010
Springer
13 years 4 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
TPHOL
1997
IEEE
13 years 9 months ago
An Isabelle-Based Theorem Prover for VDM-SL
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
Sten Agerholm, Jacob Frost
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 1 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
PLDI
2012
ACM
11 years 8 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
MSCS
2006
53views more  MSCS 2006»
13 years 5 months ago
Random reals and Lipschitz continuity
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
Andrew E. M. Lewis, George Barmpalias