280 search results - page 6 / 56 » Equivalence of Two Formal Semantics for Functional Logic Pro... |
SIGCSE
2002
ACM
13 years 7 months ago
2002
ACM
In our approach to the Programming Languages course, formal models are integrated as a thread that pervades the course, rather than as a one of many topics that is introduced and ...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
TPHOL
2002
IEEE
14 years 24 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
IPL
2008
13 years 7 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...