Sciweavers

3323 search results - page 96 / 665
» Computational Semantics with Functional Programming
Sort
View
ICFP
2002
ACM
15 years 9 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
PLDI
2000
ACM
15 years 2 months ago
Caching function calls using precise dependencies
This paper describes the implementation of a purely functional programming language for building software systems. In this language, external tools like compilers and linkers are ...
Allan Heydon, Roy Levin, Yuan Yu
FOSSACS
2004
Springer
15 years 3 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
EPS
1995
Springer
15 years 1 months ago
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Where...
Zbigniew Michalewicz