Results 1  10
of
211,491
A ProofTheoretic Foundation of Abortive Continuations
 HIGHERORDER AND SYMBOLIC COMPUTATION 20, 4
, 2007
"... We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce’s law without enforcing Ex Falso Quodlibet. We show that a “natural” implementation of this logic is Parigot’s classical natural deduction. We then move on to the computational ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce’s law without enforcing Ex Falso Quodlibet. We show that a “natural” implementation of this logic is Parigot’s classical natural deduction. We then move on to the computational side and emphasize that Parigot’s λµ corresponds to minimal classical logic. A continuation constant must be added to λµ to get full classical logic. The extended calculus is isomorphic to a syntactical restriction of Felleisen’s theory of control that offers a more expressive reduction semantics. This isomorphic calculus is in correspondence with a refined version of Prawitz’s natural deduction.
ProofTheoretic Foundation of Compilation in Logic Programming Languages
 Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP’98
"... Commercial implementations of logic programming languages are engineered Appeared in the Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming  JICSLP'98 (J. Jaffar editor), pp ????, MIT Press, Manchester, UK, 1619 June 1998. around a compiler based o ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
on Warren's Abstract Machine (WAM) or a variant of it. In spite of various correctness proofs, the logical machinery relating the prooftheoretic specification of a logic programming language and its compiled form is still poorly understood. In this paper, we propose a logicindependent definition
mjProlog  1. Proof Theoretical Foundations 
, 1999
"... this article we give the proof theoretical foundations of an extension of Prolog, to be called mjProlog, for dealing with representations of recursive functions, as Prolog deals with terms. In opposition to other related systems, mjProlog remains in the framework of first order intuitionistic logi ..."
Abstract
 Add to MetaCart
this article we give the proof theoretical foundations of an extension of Prolog, to be called mjProlog, for dealing with representations of recursive functions, as Prolog deals with terms. In opposition to other related systems, mjProlog remains in the framework of first order intuitionistic
ProofTheoretic Foundations for the Design of Actor Systems
"... The pioneering work of Hewitt and Baker on the foundations of concurrency during the seventies has inspired the development of a promising objectbased framework for understanding open distributed systems, the actor model. So far, theoretical research on actors has focused on identifying the basic p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
primitives of the model and on characterising the operational behaviour of distributed programming languages in terms of actor components. In this paper, we show that the actor model can also be used as a faithful basis for rigorously designing open distributed systems. We argue that a prooftheoretic
A Tutorial on Proof Theoretic Foundations of Logic Programming
, 2003
"... Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory.
The Uniform Prooftheoretic Foundation of Linear Logic Programming (Extended Abstract)
 PROCEEDINGS OF THE INTERNATIONAL LOGIC PROGRAMMING SYMPOSIUM
, 1991
"... We present a prooftheoretic analysis of a natural notion of logic programming for Girard's linear logic. This analysis enables us to identify a suitable notion of uniform proof. This in turn enables us to identify choices of classes of definite and goal formulae for which uniform proofs are c ..."
Abstract

Cited by 45 (7 self)
 Add to MetaCart
We present a prooftheoretic analysis of a natural notion of logic programming for Girard's linear logic. This analysis enables us to identify a suitable notion of uniform proof. This in turn enables us to identify choices of classes of definite and goal formulae for which uniform proofs
A prooftheoretic foundation for tabled higherorder logic programming
 18th International Conference on Logic Programming
, 2002
"... logic programming ..."
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
. Isabelle is now based on higherorder logic  a precise and wellunderstood foundation. Examples illustrate use of this metalogic to formalize logics and proofs. Axioms for firstorder logic are shown sound and complete. Backwards proof is formalized by metareasoning about objectlevel entailment
Results 1  10
of
211,491