Sciweavers

1805 search results - page 160 / 361
» Functional programming with structured graphs
Sort
View
TPHOL
2002
IEEE
15 years 6 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
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 ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
SIGMOD
1989
ACM
153views Database» more  SIGMOD 1989»
15 years 5 months ago
Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...
Atsushi Ohori, Peter Buneman, Val Tannen
EPS
1995
Springer
15 years 4 months ago
An Evolutionary Programming Approach to Self-Adaptation on Finite State Machines
Evolutionary programming was first offered as an alternative method for generating artificial intelligence. Experiments were offered in which finite state machines were used to...
Lawrence J. Fogel, Peter J. Angeline, David B. Fog...
ECBS
2002
IEEE
146views Hardware» more  ECBS 2002»
15 years 6 months ago
Top-Down Composition of Software Architectures
This paper discusses an approach for top-down composition of software architectures. First, an architecture is derived that addresses functional requirements only. This architectu...
Hans de Bruin, Hans van Vliet
APLAS
2009
ACM
15 years 7 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata