Sciweavers

110 search results - page 10 / 22
» A Tutorial on Proof Theoretic Foundations of Logic Programmi...
Sort
View
SYNTHESE
2011
239views more  SYNTHESE 2011»
13 years 2 months ago
Carnap on theoretical terms: structuralism without metaphysics
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
Michael Friedman
IPL
2008
118views more  IPL 2008»
13 years 7 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
TLCA
2005
Springer
14 years 1 months ago
Avoiding Equivariance in Alpha-Prolog
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
Christian Urban, James Cheney
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano
MICS
2010
81views more  MICS 2010»
13 years 6 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth