Sciweavers

1194 search results - page 2 / 239
» A Calculus for Predicative Programming
Sort
View
CSL
2004
Springer
13 years 11 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
ICFP
2003
ACM
13 years 11 months ago
Reasoning about recursive procedures with parameters
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
Ralph-Johan Back, Viorel Preoteasa
LPAR
1999
Springer
13 years 10 months ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
ENTCS
2006
94views more  ENTCS 2006»
13 years 6 months ago
Reasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
Cliff B. Jones
AAAI
1992
13 years 7 months ago
Lexical Imprecision in Fuzzy Constraint Networks
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
James Bowen, K. Robert Lai, Dennis Bahler