Sciweavers

77 search results - page 1 / 16
» Partiality and Nondeterminacy in Program Proofs
Sort
View
FAC
1998
80views more  FAC 1998»
13 years 4 months ago
Partiality and Nondeterminacy in Program Proofs
Joseph M. Morris, Alexander Bunkenburg
ASE
2006
122views more  ASE 2006»
13 years 5 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark
PLPV
2012
ACM
12 years 24 days ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
SLP
1993
110views more  SLP 1993»
13 years 6 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
KBSE
1997
IEEE
13 years 9 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell