Sciweavers

3552 search results - page 62 / 711
» Proof theory in the abstract
Sort
View
MLQ
1998
61views more  MLQ 1998»
15 years 5 months ago
Extracting Algorithms from Intuitionistic Proofs
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
Fernando Ferreira, António Marques
ENTCS
2010
105views more  ENTCS 2010»
15 years 6 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
POPL
2010
ACM
16 years 3 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
BSL
2008
98views more  BSL 2008»
15 years 6 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
Nachum Dershowitz, Yuri Gurevich
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 10 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....