1763 search results - page 22 / 353 » A Formalization of Polytime Functions |
AFP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Refactoring is the process of improving the design of existing programs without changing their functionality. These notes cover refactoring in functional languages, using...
DSVIS
2003
Springer
14 years 3 months ago
2003
Springer
Modern industrial-strength user interface toolkits are usually described informally, in terms of implementation artifacts such as objects and imperative state. While the practical...
TAP
2010
Springer
13 years 8 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
LISP
2008
13 years 10 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
AFP
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...