11397 search results - page 251 / 2280 » A Relational Abstraction for Functions |
208
click to vote
BIOADIT
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. In this paper we present a functional model of a spiking neuron intended for hardware implementation. Some features of biological spiking neuabstracted, while preserving ...
200
click to vote
ASM
2003
ASM
16 years 14 days ago
2003
ASM
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
200
click to vote
IFL
2003
Springer
16 years 13 days ago
2003
Springer
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
156
click to vote
MPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
221
click to vote
AFP
1995
Springer
15 years 10 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...