Results 1 
4 of
4
Compositional Logic Programming
 In Proceedings of the JICSLP'96 postconference workshop: Multiparadigm logic programming, Report 9628. Technische Universitat
, 2000
"... Relational program derivation has gathered momentum over the last decade with the development of many specification logics. However, before such relational specifications can be executed in existing programming languages, they must be carefully phrased to respect the evaluation order of the langu ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Relational program derivation has gathered momentum over the last decade with the development of many specification logics. However, before such relational specifications can be executed in existing programming languages, they must be carefully phrased to respect the evaluation order of the language. In turn, this requirement inhibits the rapid prototyping of specifications in a relational notation. The aim of this thesis is to bridge the gap between the methodology and practice of relational program derivation by realising a compositional style of logic programming that permits specifications to be phrased naturally and executed declaratively.
Formulas as Programs
, 1998
"... We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts
1 Formulas as Programs
, 1998
"... Abstract. We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts with the socalled formulas as types approach in w ..."
Abstract
 Add to MetaCart
Abstract. We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts with the socalled formulas as types approach in which the proofs of the formulas are typed terms that can be taken as programs. This view of computing is inspired by logic programming and constraint logic programming but differs from them in a number of crucial aspects. Formulas as programs is argued to yield a realistic approach to programming that has been realized in the implemented programming language Alma0 Apt, Brunekreef, Partington & Schaerf (1998) that combines the advantages of imperative and logic programming. The work here reported can also be used to reason about the correctness of nonrecursive Alma0 programs that do not include destructive assignment.
Formulas as Programs
, 1998
"... We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts with the socalled formulas as types approach in which the ..."
Abstract
 Add to MetaCart
We provide here a computational interpretation of firstorder logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs. This contrasts with the socalled formulas as types approach in which the proofs of the formulas are typed terms that can be taken as programs. This view of computing is inspired by logic programming and constraint logic programming but differs from them in a number of crucial aspects. Formulas as programs is argued to yield a realistic approach to programming that has been realized in the implemented programming language Alma0 Apt, Brunekreef, Partington & Schaerf (1998) that combines the advantages of imperative and logic programming. The work here reported can also be used to reason about the correctness of nonrecursive Alma0 programs that do not include destructive assignment. 1991 Mathematics Subject Classification: 68N05, 68N17, 68Q60 1991 Comput...