Results 1  10
of
224,459
A Full Formalization of SLDResolution in the Calculus of Inductive Constructions
"... This paper presents a full formalization of the semantics of definite programs, in the calculus of inductive constructions. First, we describe a formalization of the proof of first order terms unification: this proof is obtained from a similar proof dealing with quasiterms, thus showing how to rela ..."
Abstract
 Add to MetaCart
This paper presents a full formalization of the semantics of definite programs, in the calculus of inductive constructions. First, we describe a formalization of the proof of first order terms unification: this proof is obtained from a similar proof dealing with quasiterms, thus showing how
SLDResolution with Reflection
, 1995
"... The aim of this thesis is to define a procedural and declarative semantics of SLDresolution with reflection, in the general framework defined by Jaffar et al. This scheme is in fact general enough to constitute a ground work suitable for (i) the possible integration of metaprogramming and constrain ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The aim of this thesis is to define a procedural and declarative semantics of SLDresolution with reflection, in the general framework defined by Jaffar et al. This scheme is in fact general enough to constitute a ground work suitable for (i) the possible integration of metaprogramming
SLDResolution with Reflection
 Logic Programming  Proc. 1994 Intl. Symp., 554568
, 1995
"... We present a language containing names of ground expressions and a corresponding simple extension to SLDresolution which allows metalevel computation and interlevel communication through reflection. The extended language allows significant freedom in the choice of names and as an example of a possi ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
We present a language containing names of ground expressions and a corresponding simple extension to SLDresolution which allows metalevel computation and interlevel communication through reflection. The extended language allows significant freedom in the choice of names and as an example of a
A Fixpoint Semantics and an SLDResolution Calculus for Modal Logic Programs
, 2001
"... We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLDresolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. For an MProlog program P ..."
Abstract

Cited by 15 (13 self)
 Add to MetaCart
We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLDresolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. For an MProlog program
An SLDresolution calculus for basic serial multimodal logics
 Proceedings of ICTAC 2005, LNCS 3722
, 2005
"... Abstract. We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4,5(intheform,e.g., 4:✷iϕ → ✷j✷kϕ) andI: ✷iϕ → ✷jϕ. We do not assume any special restriction for the form of programs ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
of programs and goals. Our fixpoint semantics and SLDresolution calculus are defined using the direct approach and closely reflect the axioms of the used modal logic. We prove that our SLDresolution calculus is sound and complete. 1
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Guarded Commands, Nondeterminacy and Formal Derivation of Programs
, 1975
"... Socalled "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract

Cited by 521 (0 self)
 Add to MetaCart
. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown.
Results 1  10
of
224,459