Sciweavers

110 search results - page 7 / 22
» A Tutorial on Proof Theoretic Foundations of Logic Programmi...
Sort
View
ENTCS
2000
109views more  ENTCS 2000»
13 years 7 months ago
Forward and Backward Chaining in Linear Logic
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
James Harland, David J. Pym, Michael Winikoff
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Issam Maamria, Michael Butler
ICALP
2007
Springer
14 years 1 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
CEFP
2007
Springer
14 years 1 months ago
Proving Properties of Lazy Functional Programs with Sparkle
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...