632 search results - page 87 / 127 » Combining programming with theorem proving |
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
AGP
1997
IEEE
14 years 1 days ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
KRDB
2003
13 years 9 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...